./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:46:40,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:46:40,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:46:40,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:46:40,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:46:40,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:46:40,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:46:40,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:46:40,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:46:40,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:46:40,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:46:40,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:46:40,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:46:40,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:46:40,159 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:46:40,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:46:40,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:46:40,159 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:46:40,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:46:40,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:46:40,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:46:40,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:46:40,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:46:40,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:46:40,161 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:46:40,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:46:40,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:46:40,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:46:40,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:46:40,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:46:40,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:46:40,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:46:40,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2025-01-09 20:46:40,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:46:40,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:46:40,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:46:40,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:46:40,394 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:46:40,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2025-01-09 20:46:41,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8464f109a/9210b27c92014b74a5021d6f77c5ab64/FLAG3c33e4784 [2025-01-09 20:46:41,867 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:46:41,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2025-01-09 20:46:41,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8464f109a/9210b27c92014b74a5021d6f77c5ab64/FLAG3c33e4784 [2025-01-09 20:46:42,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8464f109a/9210b27c92014b74a5021d6f77c5ab64 [2025-01-09 20:46:42,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:46:42,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:46:42,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:46:42,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:46:42,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:46:42,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e72eb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42, skipping insertion in model container [2025-01-09 20:46:42,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:46:42,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i[37019,37032] [2025-01-09 20:46:42,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i[47352,47365] [2025-01-09 20:46:42,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:46:42,526 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:46:42,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i[37019,37032] [2025-01-09 20:46:42,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i[47352,47365] [2025-01-09 20:46:42,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:46:42,627 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:46:42,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42 WrapperNode [2025-01-09 20:46:42,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:46:42,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:46:42,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:46:42,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:46:42,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,704 INFO L138 Inliner]: procedures = 208, calls = 227, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1264 [2025-01-09 20:46:42,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:46:42,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:46:42,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:46:42,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:46:42,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,770 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-01-09 20:46:42,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:46:42,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:46:42,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:46:42,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:46:42,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (1/1) ... [2025-01-09 20:46:42,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:46:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:46:42,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:46:42,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:46:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:46:42,865 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:46:42,865 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:46:42,865 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:46:42,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:46:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:46:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:46:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:46:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:46:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:46:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:46:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:46:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:46:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:46:42,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:46:43,004 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:46:43,005 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:46:44,057 INFO L? ?]: Removed 302 outVars from TransFormulas that were not future-live. [2025-01-09 20:46:44,057 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:46:44,075 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:46:44,075 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 20:46:44,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:46:44 BoogieIcfgContainer [2025-01-09 20:46:44,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:46:44,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:46:44,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:46:44,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:46:44,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:46:42" (1/3) ... [2025-01-09 20:46:44,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f4ffb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:46:44, skipping insertion in model container [2025-01-09 20:46:44,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:46:42" (2/3) ... [2025-01-09 20:46:44,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f4ffb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:46:44, skipping insertion in model container [2025-01-09 20:46:44,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:46:44" (3/3) ... [2025-01-09 20:46:44,085 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-1.i [2025-01-09 20:46:44,095 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:46:44,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test2-1.i that has 5 procedures, 388 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-01-09 20:46:44,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:46:44,146 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@62474784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:46:44,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:46:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 380 states, 367 states have (on average 1.6130790190735695) internal successors, (592), 374 states have internal predecessors, (592), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:46:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:46:44,153 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:44,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:44,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:44,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1337805440, now seen corresponding path program 1 times [2025-01-09 20:46:44,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:44,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519284840] [2025-01-09 20:46:44,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:44,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:46:44,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:46:44,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:44,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:44,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:44,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519284840] [2025-01-09 20:46:44,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519284840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:44,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:44,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:46:44,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119739461] [2025-01-09 20:46:44,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:44,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:46:44,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:44,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:46:44,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:46:44,283 INFO L87 Difference]: Start difference. First operand has 380 states, 367 states have (on average 1.6130790190735695) internal successors, (592), 374 states have internal predecessors, (592), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:46:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:44,330 INFO L93 Difference]: Finished difference Result 758 states and 1219 transitions. [2025-01-09 20:46:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:46:44,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 20:46:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:44,339 INFO L225 Difference]: With dead ends: 758 [2025-01-09 20:46:44,339 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 20:46:44,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:46:44,344 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:44,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:46:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 20:46:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-01-09 20:46:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 364 states have (on average 1.4615384615384615) internal successors, (532), 370 states have internal predecessors, (532), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:46:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 548 transitions. [2025-01-09 20:46:44,378 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 548 transitions. Word has length 9 [2025-01-09 20:46:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:44,379 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 548 transitions. [2025-01-09 20:46:44,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:46:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 548 transitions. [2025-01-09 20:46:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 20:46:44,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:44,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:44,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:46:44,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:44,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1772541247, now seen corresponding path program 1 times [2025-01-09 20:46:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:44,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747694621] [2025-01-09 20:46:44,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:44,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 20:46:44,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 20:46:44,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:44,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:44,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:44,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747694621] [2025-01-09 20:46:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747694621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:44,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:44,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:46:44,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42484811] [2025-01-09 20:46:44,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:44,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:46:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:44,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:46:44,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:46:44,758 INFO L87 Difference]: Start difference. First operand 376 states and 548 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:46:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:44,904 INFO L93 Difference]: Finished difference Result 914 states and 1343 transitions. [2025-01-09 20:46:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:46:44,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 20:46:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:44,913 INFO L225 Difference]: With dead ends: 914 [2025-01-09 20:46:44,914 INFO L226 Difference]: Without dead ends: 739 [2025-01-09 20:46:44,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:46:44,916 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 517 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:44,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1666 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:46:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-01-09 20:46:44,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 378. [2025-01-09 20:46:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 366 states have (on average 1.459016393442623) internal successors, (534), 372 states have internal predecessors, (534), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:46:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 550 transitions. [2025-01-09 20:46:44,943 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 550 transitions. Word has length 63 [2025-01-09 20:46:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:44,944 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 550 transitions. [2025-01-09 20:46:44,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:46:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 550 transitions. [2025-01-09 20:46:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:46:44,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:44,952 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:44,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:46:44,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:44,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:44,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1726808251, now seen corresponding path program 1 times [2025-01-09 20:46:44,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:44,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283897306] [2025-01-09 20:46:44,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:44,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:45,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:46:45,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:46:45,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:45,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283897306] [2025-01-09 20:46:45,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283897306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:45,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:45,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:46:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462114810] [2025-01-09 20:46:45,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:45,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:46:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:45,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:46:45,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:46:45,274 INFO L87 Difference]: Start difference. First operand 378 states and 550 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:46:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:45,334 INFO L93 Difference]: Finished difference Result 710 states and 1030 transitions. [2025-01-09 20:46:45,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:46:45,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-01-09 20:46:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:45,336 INFO L225 Difference]: With dead ends: 710 [2025-01-09 20:46:45,336 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 20:46:45,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:46:45,337 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 30 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:45,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1320 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:46:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 20:46:45,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-01-09 20:46:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 324 states have (on average 1.4104938271604939) internal successors, (457), 330 states have internal predecessors, (457), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:46:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 473 transitions. [2025-01-09 20:46:45,353 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 473 transitions. Word has length 139 [2025-01-09 20:46:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:45,353 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 473 transitions. [2025-01-09 20:46:45,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:46:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 473 transitions. [2025-01-09 20:46:45,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:46:45,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:45,356 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:45,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:46:45,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:45,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2010984557, now seen corresponding path program 1 times [2025-01-09 20:46:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:45,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9515296] [2025-01-09 20:46:45,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:45,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:46:45,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:46:45,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:45,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:45,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:45,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9515296] [2025-01-09 20:46:45,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9515296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:45,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:45,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:46:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924987104] [2025-01-09 20:46:45,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:45,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:46:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:45,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:46:45,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:45,554 INFO L87 Difference]: Start difference. First operand 336 states and 473 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:46:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:45,603 INFO L93 Difference]: Finished difference Result 668 states and 942 transitions. [2025-01-09 20:46:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:46:45,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-01-09 20:46:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:45,606 INFO L225 Difference]: With dead ends: 668 [2025-01-09 20:46:45,607 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 20:46:45,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:45,609 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 1 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:45,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 896 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:46:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 20:46:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-01-09 20:46:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 324 states have (on average 1.4012345679012346) internal successors, (454), 330 states have internal predecessors, (454), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:46:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2025-01-09 20:46:45,623 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 139 [2025-01-09 20:46:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:45,623 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2025-01-09 20:46:45,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:46:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2025-01-09 20:46:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:46:45,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:45,626 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:45,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:46:45,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:45,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:45,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1820533361, now seen corresponding path program 1 times [2025-01-09 20:46:45,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:45,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859330035] [2025-01-09 20:46:45,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:45,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:45,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:46:45,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:46:45,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:45,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:46:45,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:45,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859330035] [2025-01-09 20:46:45,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859330035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:45,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:45,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:46:45,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820448391] [2025-01-09 20:46:45,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:45,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:46:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:45,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:46:45,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:45,802 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:46:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:45,859 INFO L93 Difference]: Finished difference Result 902 states and 1276 transitions. [2025-01-09 20:46:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:46:45,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-01-09 20:46:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:45,863 INFO L225 Difference]: With dead ends: 902 [2025-01-09 20:46:45,863 INFO L226 Difference]: Without dead ends: 570 [2025-01-09 20:46:45,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:46:45,865 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 270 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:45,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1111 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:46:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-01-09 20:46:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2025-01-09 20:46:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 551 states have (on average 1.4174228675136116) internal successors, (781), 562 states have internal predecessors, (781), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:46:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 807 transitions. [2025-01-09 20:46:45,884 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 807 transitions. Word has length 139 [2025-01-09 20:46:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:45,884 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 807 transitions. [2025-01-09 20:46:45,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:46:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 807 transitions. [2025-01-09 20:46:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:46:45,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:45,886 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:45,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:46:45,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:45,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:45,887 INFO L85 PathProgramCache]: Analyzing trace with hash 555867994, now seen corresponding path program 1 times [2025-01-09 20:46:45,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:45,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567519793] [2025-01-09 20:46:45,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:45,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:45,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:46:45,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:46:45,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:45,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:46:46,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:46,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567519793] [2025-01-09 20:46:46,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567519793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:46,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:46,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:46:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014561317] [2025-01-09 20:46:46,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:46,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:46:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:46,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:46:46,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:46:46,133 INFO L87 Difference]: Start difference. First operand 568 states and 807 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:46:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:46,209 INFO L93 Difference]: Finished difference Result 803 states and 1155 transitions. [2025-01-09 20:46:46,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:46:46,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:46:46,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:46,213 INFO L225 Difference]: With dead ends: 803 [2025-01-09 20:46:46,213 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 20:46:46,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:46:46,214 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 30 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:46,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1073 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:46:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 20:46:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-01-09 20:46:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 467 states have (on average 1.342612419700214) internal successors, (627), 478 states have internal predecessors, (627), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:46:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 653 transitions. [2025-01-09 20:46:46,228 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 653 transitions. Word has length 154 [2025-01-09 20:46:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:46,229 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 653 transitions. [2025-01-09 20:46:46,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:46:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 653 transitions. [2025-01-09 20:46:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:46:46,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:46,230 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:46,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:46:46,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:46,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash -615646130, now seen corresponding path program 1 times [2025-01-09 20:46:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:46,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560863793] [2025-01-09 20:46:46,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:46,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:46,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:46:46,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:46:46,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:46,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:46:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560863793] [2025-01-09 20:46:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560863793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:46,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:46,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:46:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060458226] [2025-01-09 20:46:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:46,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:46:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:46,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:46:46,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:46:46,463 INFO L87 Difference]: Start difference. First operand 484 states and 653 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:46:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:46,783 INFO L93 Difference]: Finished difference Result 957 states and 1294 transitions. [2025-01-09 20:46:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:46:46,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:46:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:46,787 INFO L225 Difference]: With dead ends: 957 [2025-01-09 20:46:46,787 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 20:46:46,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:46:46,789 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1183 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:46,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 920 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:46:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 20:46:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 381. [2025-01-09 20:46:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 369 states have (on average 1.3279132791327912) internal successors, (490), 375 states have internal predecessors, (490), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:46:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 506 transitions. [2025-01-09 20:46:46,803 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 506 transitions. Word has length 154 [2025-01-09 20:46:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:46,804 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 506 transitions. [2025-01-09 20:46:46,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:46:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 506 transitions. [2025-01-09 20:46:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 20:46:46,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:46,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:46,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:46:46,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:46,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1349751581, now seen corresponding path program 1 times [2025-01-09 20:46:46,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:46,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653403696] [2025-01-09 20:46:46,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:46,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:46,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:46:46,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:46:46,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:46,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:46:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:47,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653403696] [2025-01-09 20:46:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653403696] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:46:47,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100983633] [2025-01-09 20:46:47,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:47,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:46:47,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:46:47,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:46:47,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:46:47,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:46:47,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:46:47,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:47,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:47,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 20:46:47,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:46:47,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 20:46:47,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:46:47,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 20:46:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:46:47,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:46:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:46:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100983633] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:46:48,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:46:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 20:46:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057772397] [2025-01-09 20:46:48,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:46:48,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:46:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:48,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:46:48,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:46:48,134 INFO L87 Difference]: Start difference. First operand 381 states and 506 transitions. Second operand has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:46:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:48,372 INFO L93 Difference]: Finished difference Result 1261 states and 1690 transitions. [2025-01-09 20:46:48,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:46:48,373 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 164 [2025-01-09 20:46:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:48,377 INFO L225 Difference]: With dead ends: 1261 [2025-01-09 20:46:48,377 INFO L226 Difference]: Without dead ends: 1128 [2025-01-09 20:46:48,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 321 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 20:46:48,378 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 2092 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:48,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2108 Valid, 2525 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:46:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-01-09 20:46:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 728. [2025-01-09 20:46:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 712 states have (on average 1.321629213483146) internal successors, (941), 718 states have internal predecessors, (941), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:46:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 963 transitions. [2025-01-09 20:46:48,400 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 963 transitions. Word has length 164 [2025-01-09 20:46:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:48,400 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 963 transitions. [2025-01-09 20:46:48,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:46:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 963 transitions. [2025-01-09 20:46:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 20:46:48,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:48,404 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:48,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:46:48,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:46:48,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:48,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash -360252237, now seen corresponding path program 1 times [2025-01-09 20:46:48,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663082695] [2025-01-09 20:46:48,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:48,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:46:48,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:46:48,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:48,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:46:51,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:51,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663082695] [2025-01-09 20:46:51,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663082695] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:46:51,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404362267] [2025-01-09 20:46:51,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:51,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:46:51,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:46:51,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:46:51,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:46:51,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:46:51,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:46:51,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:51,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:51,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 20:46:51,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:46:51,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 20:46:51,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:46:51,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:46:51,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:46:52,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 20:46:52,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 20:46:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:46:52,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:46:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:46:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404362267] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:46:52,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:46:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-01-09 20:46:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429641264] [2025-01-09 20:46:52,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:46:52,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 20:46:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:52,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 20:46:52,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2025-01-09 20:46:52,566 INFO L87 Difference]: Start difference. First operand 728 states and 963 transitions. Second operand has 20 states, 20 states have (on average 35.45) internal successors, (709), 20 states have internal predecessors, (709), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:46:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:53,039 INFO L93 Difference]: Finished difference Result 2503 states and 3358 transitions. [2025-01-09 20:46:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 20:46:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.45) internal successors, (709), 20 states have internal predecessors, (709), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 392 [2025-01-09 20:46:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:53,049 INFO L225 Difference]: With dead ends: 2503 [2025-01-09 20:46:53,049 INFO L226 Difference]: Without dead ends: 2370 [2025-01-09 20:46:53,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 777 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=426, Unknown=0, NotChecked=0, Total=650 [2025-01-09 20:46:53,051 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 5109 mSDsluCounter, 4851 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5146 SdHoareTripleChecker+Valid, 5256 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:53,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5146 Valid, 5256 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:46:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2025-01-09 20:46:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1592. [2025-01-09 20:46:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1570 states have (on average 1.3178343949044586) internal successors, (2069), 1576 states have internal predecessors, (2069), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:46:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2103 transitions. [2025-01-09 20:46:53,101 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2103 transitions. Word has length 392 [2025-01-09 20:46:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:53,101 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2103 transitions. [2025-01-09 20:46:53,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.45) internal successors, (709), 20 states have internal predecessors, (709), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:46:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2103 transitions. [2025-01-09 20:46:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2025-01-09 20:46:53,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:53,113 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:53,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 20:46:53,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:46:53,315 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:53,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:53,316 INFO L85 PathProgramCache]: Analyzing trace with hash 51275487, now seen corresponding path program 2 times [2025-01-09 20:46:53,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:53,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449726180] [2025-01-09 20:46:53,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:46:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:53,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 848 statements into 2 equivalence classes. [2025-01-09 20:46:53,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 848 statements. [2025-01-09 20:46:53,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:46:53,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:46:53,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:53,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449726180] [2025-01-09 20:46:53,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449726180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:53,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:53,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:46:53,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453190998] [2025-01-09 20:46:53,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:53,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:46:53,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:53,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:46:53,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:46:53,849 INFO L87 Difference]: Start difference. First operand 1592 states and 2103 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:46:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:54,184 INFO L93 Difference]: Finished difference Result 1735 states and 2297 transitions. [2025-01-09 20:46:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:46:54,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 848 [2025-01-09 20:46:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:54,190 INFO L225 Difference]: With dead ends: 1735 [2025-01-09 20:46:54,190 INFO L226 Difference]: Without dead ends: 1603 [2025-01-09 20:46:54,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:46:54,192 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 20 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:54,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1829 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:46:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-01-09 20:46:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1596. [2025-01-09 20:46:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1574 states have (on average 1.3170266836086404) internal successors, (2073), 1580 states have internal predecessors, (2073), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:46:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2107 transitions. [2025-01-09 20:46:54,236 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2107 transitions. Word has length 848 [2025-01-09 20:46:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:54,237 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2107 transitions. [2025-01-09 20:46:54,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:46:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2107 transitions. [2025-01-09 20:46:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-01-09 20:46:54,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:54,252 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:54,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:46:54,253 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:54,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash 865031006, now seen corresponding path program 1 times [2025-01-09 20:46:54,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:54,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008836059] [2025-01-09 20:46:54,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:54,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-01-09 20:46:54,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-01-09 20:46:54,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:54,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:46:56,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:56,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008836059] [2025-01-09 20:46:56,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008836059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:56,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:46:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21506576] [2025-01-09 20:46:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:56,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:46:56,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:56,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:46:56,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:46:56,355 INFO L87 Difference]: Start difference. First operand 1596 states and 2107 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:46:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:56,726 INFO L93 Difference]: Finished difference Result 1747 states and 2311 transitions. [2025-01-09 20:46:56,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:46:56,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2025-01-09 20:46:56,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:56,733 INFO L225 Difference]: With dead ends: 1747 [2025-01-09 20:46:56,734 INFO L226 Difference]: Without dead ends: 1611 [2025-01-09 20:46:56,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:46:56,735 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 24 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2142 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:56,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2142 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:46:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-01-09 20:46:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1600. [2025-01-09 20:46:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1578 states have (on average 1.3168567807351077) internal successors, (2078), 1584 states have internal predecessors, (2078), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:46:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2112 transitions. [2025-01-09 20:46:56,790 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2112 transitions. Word has length 849 [2025-01-09 20:46:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:56,792 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2112 transitions. [2025-01-09 20:46:56,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:46:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2112 transitions. [2025-01-09 20:46:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 20:46:56,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:56,803 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:56,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:46:56,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:56,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1552734507, now seen corresponding path program 1 times [2025-01-09 20:46:56,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:56,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519755268] [2025-01-09 20:46:56,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:57,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-09 20:46:57,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-09 20:46:57,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:57,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:46:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:46:58,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:46:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519755268] [2025-01-09 20:46:58,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519755268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:46:58,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:46:58,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:46:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981005075] [2025-01-09 20:46:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:46:58,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:46:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:46:58,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:46:58,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:46:58,784 INFO L87 Difference]: Start difference. First operand 1600 states and 2112 transitions. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:46:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:46:59,190 INFO L93 Difference]: Finished difference Result 1751 states and 2318 transitions. [2025-01-09 20:46:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:46:59,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 20:46:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:46:59,198 INFO L225 Difference]: With dead ends: 1751 [2025-01-09 20:46:59,198 INFO L226 Difference]: Without dead ends: 1611 [2025-01-09 20:46:59,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:46:59,199 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 31 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:46:59,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2525 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:46:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-01-09 20:46:59,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1608. [2025-01-09 20:46:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1586 states have (on average 1.3165195460277428) internal successors, (2088), 1592 states have internal predecessors, (2088), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:46:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2122 transitions. [2025-01-09 20:46:59,238 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2122 transitions. Word has length 850 [2025-01-09 20:46:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:46:59,239 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2122 transitions. [2025-01-09 20:46:59,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:46:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2122 transitions. [2025-01-09 20:46:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 20:46:59,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:46:59,245 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:46:59,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:46:59,245 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:46:59,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:46:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1777458564, now seen corresponding path program 1 times [2025-01-09 20:46:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:46:59,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781543290] [2025-01-09 20:46:59,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:46:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:46:59,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-09 20:46:59,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-09 20:46:59,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:46:59,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:47:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:47:01,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:47:01,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781543290] [2025-01-09 20:47:01,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781543290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:47:01,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:47:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:47:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481862871] [2025-01-09 20:47:01,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:47:01,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:47:01,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:47:01,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:47:01,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:47:01,105 INFO L87 Difference]: Start difference. First operand 1608 states and 2122 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:47:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:47:01,332 INFO L93 Difference]: Finished difference Result 1765 states and 2332 transitions. [2025-01-09 20:47:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:47:01,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 20:47:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:47:01,339 INFO L225 Difference]: With dead ends: 1765 [2025-01-09 20:47:01,340 INFO L226 Difference]: Without dead ends: 1617 [2025-01-09 20:47:01,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:47:01,342 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 15 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:47:01,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1574 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:47:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-01-09 20:47:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1611. [2025-01-09 20:47:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1589 states have (on average 1.315921963499056) internal successors, (2091), 1595 states have internal predecessors, (2091), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:47:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2125 transitions. [2025-01-09 20:47:01,402 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2125 transitions. Word has length 850 [2025-01-09 20:47:01,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:47:01,403 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2125 transitions. [2025-01-09 20:47:01,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:47:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2125 transitions. [2025-01-09 20:47:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 20:47:01,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:47:01,409 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:47:01,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:47:01,410 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:47:01,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:47:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1426101599, now seen corresponding path program 1 times [2025-01-09 20:47:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:47:01,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531823139] [2025-01-09 20:47:01,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:47:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:47:01,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes.