./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stack-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:43:00,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:43:00,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:43:00,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:43:00,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:43:00,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:43:00,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:43:00,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:43:00,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:43:00,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:43:00,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:43:00,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:43:00,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:43:00,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:43:00,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:43:00,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:43:00,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:43:00,245 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/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 -> 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 [2025-03-16 19:43:00,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:43:00,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:43:00,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:43:00,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:43:00,467 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:43:00,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stack-2.i [2025-03-16 19:43:01,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256908d2a/92305b5fd79f40a3ad9b0d6c21923e68/FLAGa9fabb38e [2025-03-16 19:43:01,877 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:43:01,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2025-03-16 19:43:01,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256908d2a/92305b5fd79f40a3ad9b0d6c21923e68/FLAGa9fabb38e [2025-03-16 19:43:01,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256908d2a/92305b5fd79f40a3ad9b0d6c21923e68 [2025-03-16 19:43:01,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:43:01,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:43:01,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:43:01,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:43:01,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:43:01,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:43:01" (1/1) ... [2025-03-16 19:43:01,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b13d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:01, skipping insertion in model container [2025-03-16 19:43:01,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:43:01" (1/1) ... [2025-03-16 19:43:01,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:43:02,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2025-03-16 19:43:02,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:43:02,310 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:43:02,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2025-03-16 19:43:02,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:43:02,423 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:43:02,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02 WrapperNode [2025-03-16 19:43:02,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:43:02,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:43:02,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:43:02,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:43:02,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,474 INFO L138 Inliner]: procedures = 252, calls = 297, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 644 [2025-03-16 19:43:02,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:43:02,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:43:02,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:43:02,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:43:02,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,509 INFO L175 MemorySlicer]: Split 148 memory accesses to 18 slices as follows [2, 2, 4, 8, 8, 8, 20, 12, 10, 8, 6, 4, 20, 6, 0, 22, 6, 2]. 15 percent of accesses are in the largest equivalence class. The 51 initializations are split as follows [0, 2, 0, 3, 3, 3, 6, 6, 2, 2, 2, 2, 10, 0, 0, 10, 0, 0]. The 33 writes are split as follows [0, 0, 2, 2, 2, 2, 8, 3, 3, 3, 2, 0, 0, 0, 0, 6, 0, 0]. [2025-03-16 19:43:02,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:43:02,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:43:02,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:43:02,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:43:02,554 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (1/1) ... [2025-03-16 19:43:02,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:43:02,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:02,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:43:02,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:43:02,601 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:43:02,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-16 19:43:02,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:43:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:43:02,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:43:02,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:43:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-16 19:43:02,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-16 19:43:02,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-16 19:43:02,606 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-16 19:43:02,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:43:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:43:02,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:43:02,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:43:02,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:43:02,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:43:02,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-16 19:43:02,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2025-03-16 19:43:02,609 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:43:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:43:02,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-16 19:43:02,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:43:02,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 19:43:02,610 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:43:02,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 19:43:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:43:02,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:43:02,829 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:43:02,831 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:43:02,883 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-03-16 19:43:02,887 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:02,888 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L952-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:02,888 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L951: havoc #t~mem53; [2025-03-16 19:43:03,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-16 19:43:03,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2025-03-16 19:43:03,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:03,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-03-16 19:43:03,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:03,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:03,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-16 19:43:03,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:03,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:03,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-03-16 19:43:03,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:03,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:03,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L999: havoc pop_#t~ret60#1;havoc pop_#t~mem61#1; [2025-03-16 19:43:03,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-16 19:43:03,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:03,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:03,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-16 19:43:03,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:03,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:03,311 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:03,311 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-16 19:43:03,311 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:03,311 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L928-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:03,314 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-16 19:43:03,314 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:03,315 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L934-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:03,315 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L932: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-16 19:43:03,315 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L932: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:03,315 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:03,315 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-16 19:43:03,315 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:07,560 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 19:43:07,560 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:43:07,572 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:43:07,574 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:43:07,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:43:07 BoogieIcfgContainer [2025-03-16 19:43:07,575 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:43:07,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:43:07,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:43:07,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:43:07,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:43:01" (1/3) ... [2025-03-16 19:43:07,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da55338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:43:07, skipping insertion in model container [2025-03-16 19:43:07,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:02" (2/3) ... [2025-03-16 19:43:07,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da55338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:43:07, skipping insertion in model container [2025-03-16 19:43:07,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:43:07" (3/3) ... [2025-03-16 19:43:07,583 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stack-2.i [2025-03-16 19:43:07,593 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:43:07,596 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stack-2.i that has 10 procedures, 214 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 19:43:07,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:43:07,643 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;@26e804ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:43:07,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:43:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 214 states, 128 states have (on average 1.5234375) internal successors, (195), 131 states have internal predecessors, (195), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-16 19:43:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 19:43:07,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:07,667 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:43:07,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:07,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1395291447, now seen corresponding path program 1 times [2025-03-16 19:43:07,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:07,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991593163] [2025-03-16 19:43:07,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:07,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:07,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:43:07,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:43:07,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:07,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-16 19:43:08,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:08,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991593163] [2025-03-16 19:43:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991593163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119361566] [2025-03-16 19:43:08,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:08,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:08,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:08,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:08,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:43:08,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:43:08,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:43:08,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:08,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:08,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 19:43:08,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-16 19:43:08,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:43:08,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119361566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:08,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:43:08,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 19:43:08,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198855072] [2025-03-16 19:43:08,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:08,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:43:08,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:08,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:43:08,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:43:08,478 INFO L87 Difference]: Start difference. First operand has 214 states, 128 states have (on average 1.5234375) internal successors, (195), 131 states have internal predecessors, (195), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:43:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:08,509 INFO L93 Difference]: Finished difference Result 425 states and 754 transitions. [2025-03-16 19:43:08,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:43:08,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2025-03-16 19:43:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:08,518 INFO L225 Difference]: With dead ends: 425 [2025-03-16 19:43:08,518 INFO L226 Difference]: Without dead ends: 211 [2025-03-16 19:43:08,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 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-03-16 19:43:08,524 INFO L435 NwaCegarLoop]: 343 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, 343 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-03-16 19:43:08,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:43:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-16 19:43:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-16 19:43:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 126 states have (on average 1.507936507936508) internal successors, (190), 128 states have internal predecessors, (190), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-16 19:43:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 340 transitions. [2025-03-16 19:43:08,582 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 340 transitions. Word has length 93 [2025-03-16 19:43:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:08,583 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 340 transitions. [2025-03-16 19:43:08,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:43:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2025-03-16 19:43:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 19:43:08,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:08,589 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:43:08,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:43:08,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 19:43:08,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:08,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1088050729, now seen corresponding path program 1 times [2025-03-16 19:43:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760919399] [2025-03-16 19:43:08,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:08,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:43:08,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:43:08,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:08,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-16 19:43:09,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:09,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760919399] [2025-03-16 19:43:09,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760919399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:09,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:09,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:43:09,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205320716] [2025-03-16 19:43:09,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:09,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:43:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:09,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:43:09,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:43:09,391 INFO L87 Difference]: Start difference. First operand 211 states and 340 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:43:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:09,466 INFO L93 Difference]: Finished difference Result 419 states and 684 transitions. [2025-03-16 19:43:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:43:09,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-03-16 19:43:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:09,476 INFO L225 Difference]: With dead ends: 419 [2025-03-16 19:43:09,480 INFO L226 Difference]: Without dead ends: 385 [2025-03-16 19:43:09,481 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-03-16 19:43:09,481 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 300 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:09,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1059 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:43:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-16 19:43:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2025-03-16 19:43:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 230 states have (on average 1.5434782608695652) internal successors, (355), 234 states have internal predecessors, (355), 135 states have call successors, (135), 18 states have call predecessors, (135), 18 states have return successors, (143), 135 states have call predecessors, (143), 135 states have call successors, (143) [2025-03-16 19:43:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 633 transitions. [2025-03-16 19:43:09,527 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 633 transitions. Word has length 93 [2025-03-16 19:43:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:09,528 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 633 transitions. [2025-03-16 19:43:09,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:43:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 633 transitions. [2025-03-16 19:43:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-16 19:43:09,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:09,536 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:43:09,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:43:09,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:09,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1436675077, now seen corresponding path program 1 times [2025-03-16 19:43:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:09,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58231501] [2025-03-16 19:43:09,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:09,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-16 19:43:09,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-16 19:43:09,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:09,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-03-16 19:43:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:10,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58231501] [2025-03-16 19:43:10,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58231501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:10,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:10,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:10,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310110025] [2025-03-16 19:43:10,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:10,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:10,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:10,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:10,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:10,299 INFO L87 Difference]: Start difference. First operand 384 states and 633 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 19:43:14,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:14,586 INFO L93 Difference]: Finished difference Result 815 states and 1342 transitions. [2025-03-16 19:43:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:14,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 172 [2025-03-16 19:43:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:14,593 INFO L225 Difference]: With dead ends: 815 [2025-03-16 19:43:14,593 INFO L226 Difference]: Without dead ends: 777 [2025-03-16 19:43:14,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:14,595 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 401 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:14,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1408 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 103 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 19:43:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-03-16 19:43:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 770. [2025-03-16 19:43:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 461 states have (on average 1.5401301518438177) internal successors, (710), 472 states have internal predecessors, (710), 269 states have call successors, (269), 36 states have call predecessors, (269), 39 states have return successors, (301), 269 states have call predecessors, (301), 269 states have call successors, (301) [2025-03-16 19:43:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1280 transitions. [2025-03-16 19:43:14,679 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1280 transitions. Word has length 172 [2025-03-16 19:43:14,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:14,680 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1280 transitions. [2025-03-16 19:43:14,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 19:43:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1280 transitions. [2025-03-16 19:43:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:43:14,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:14,686 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 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-03-16 19:43:14,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:43:14,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:14,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:14,687 INFO L85 PathProgramCache]: Analyzing trace with hash -648096752, now seen corresponding path program 1 times [2025-03-16 19:43:14,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422549831] [2025-03-16 19:43:14,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:14,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:43:14,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:43:14,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:14,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2025-03-16 19:43:15,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:15,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422549831] [2025-03-16 19:43:15,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422549831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:15,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:15,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262911230] [2025-03-16 19:43:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:15,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:15,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:15,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:15,144 INFO L87 Difference]: Start difference. First operand 770 states and 1280 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-16 19:43:19,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:23,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:23,373 INFO L93 Difference]: Finished difference Result 1533 states and 2530 transitions. [2025-03-16 19:43:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 175 [2025-03-16 19:43:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:23,380 INFO L225 Difference]: With dead ends: 1533 [2025-03-16 19:43:23,380 INFO L226 Difference]: Without dead ends: 769 [2025-03-16 19:43:23,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:23,384 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 337 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:23,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1504 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-03-16 19:43:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-03-16 19:43:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 759. [2025-03-16 19:43:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 456 states have (on average 1.5328947368421053) internal successors, (699), 468 states have internal predecessors, (699), 262 states have call successors, (262), 35 states have call predecessors, (262), 40 states have return successors, (291), 263 states have call predecessors, (291), 262 states have call successors, (291) [2025-03-16 19:43:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1252 transitions. [2025-03-16 19:43:23,432 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1252 transitions. Word has length 175 [2025-03-16 19:43:23,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:23,432 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1252 transitions. [2025-03-16 19:43:23,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-16 19:43:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1252 transitions. [2025-03-16 19:43:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-16 19:43:23,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:23,438 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:43:23,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:43:23,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:23,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash 867567427, now seen corresponding path program 1 times [2025-03-16 19:43:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:23,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476330696] [2025-03-16 19:43:23,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:23,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-16 19:43:23,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-16 19:43:23,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:23,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-03-16 19:43:23,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:23,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476330696] [2025-03-16 19:43:23,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476330696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:23,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:23,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803165322] [2025-03-16 19:43:23,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:23,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:23,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:23,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:23,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:23,842 INFO L87 Difference]: Start difference. First operand 759 states and 1252 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 19:43:27,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:28,163 INFO L93 Difference]: Finished difference Result 1205 states and 1949 transitions. [2025-03-16 19:43:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:28,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 172 [2025-03-16 19:43:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:28,169 INFO L225 Difference]: With dead ends: 1205 [2025-03-16 19:43:28,169 INFO L226 Difference]: Without dead ends: 770 [2025-03-16 19:43:28,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:28,172 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 403 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:28,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1411 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 99 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 19:43:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-16 19:43:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 754. [2025-03-16 19:43:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 453 states have (on average 1.532008830022075) internal successors, (694), 464 states have internal predecessors, (694), 261 states have call successors, (261), 35 states have call predecessors, (261), 39 states have return successors, (287), 262 states have call predecessors, (287), 261 states have call successors, (287) [2025-03-16 19:43:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1242 transitions. [2025-03-16 19:43:28,229 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1242 transitions. Word has length 172 [2025-03-16 19:43:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:28,230 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1242 transitions. [2025-03-16 19:43:28,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 19:43:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1242 transitions. [2025-03-16 19:43:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:43:28,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:28,237 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 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-03-16 19:43:28,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:43:28,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:28,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:28,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2018505712, now seen corresponding path program 1 times [2025-03-16 19:43:28,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:28,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672034832] [2025-03-16 19:43:28,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:28,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:28,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:43:28,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:43:28,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:28,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-03-16 19:43:28,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:28,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672034832] [2025-03-16 19:43:28,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672034832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:28,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843333004] [2025-03-16 19:43:28,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:28,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:28,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:28,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:43:28,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:43:28,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:43:28,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:28,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:28,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 19:43:29,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-16 19:43:29,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-03-16 19:43:29,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843333004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:29,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:29,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-16 19:43:29,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449418742] [2025-03-16 19:43:29,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:29,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:43:29,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:29,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:43:29,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:43:29,423 INFO L87 Difference]: Start difference. First operand 754 states and 1242 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-03-16 19:43:33,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:37,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:38,870 INFO L93 Difference]: Finished difference Result 1896 states and 3113 transitions. [2025-03-16 19:43:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:43:38,871 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 175 [2025-03-16 19:43:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:38,880 INFO L225 Difference]: With dead ends: 1896 [2025-03-16 19:43:38,880 INFO L226 Difference]: Without dead ends: 1145 [2025-03-16 19:43:38,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:43:38,886 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 970 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 619 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:38,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1357 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 1214 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2025-03-16 19:43:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-03-16 19:43:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1124. [2025-03-16 19:43:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 675 states have (on average 1.5140740740740741) internal successors, (1022), 693 states have internal predecessors, (1022), 386 states have call successors, (386), 57 states have call predecessors, (386), 62 states have return successors, (427), 385 states have call predecessors, (427), 386 states have call successors, (427) [2025-03-16 19:43:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1835 transitions. [2025-03-16 19:43:38,948 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1835 transitions. Word has length 175 [2025-03-16 19:43:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:38,948 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1835 transitions. [2025-03-16 19:43:38,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-03-16 19:43:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1835 transitions. [2025-03-16 19:43:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-16 19:43:38,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:38,955 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:43:38,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:43:39,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 19:43:39,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:39,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash 913305153, now seen corresponding path program 1 times [2025-03-16 19:43:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040895396] [2025-03-16 19:43:39,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:39,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-16 19:43:39,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-16 19:43:39,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:39,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-03-16 19:43:39,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:39,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040895396] [2025-03-16 19:43:39,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040895396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:39,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:39,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:39,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885025724] [2025-03-16 19:43:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:39,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:39,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:39,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:39,553 INFO L87 Difference]: Start difference. First operand 1124 states and 1835 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 19:43:43,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:43,767 INFO L93 Difference]: Finished difference Result 1553 states and 2489 transitions. [2025-03-16 19:43:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:43:43,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 172 [2025-03-16 19:43:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:43,775 INFO L225 Difference]: With dead ends: 1553 [2025-03-16 19:43:43,775 INFO L226 Difference]: Without dead ends: 1043 [2025-03-16 19:43:43,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:43,779 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 348 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:43,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1368 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 19:43:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2025-03-16 19:43:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1027. [2025-03-16 19:43:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 620 states have (on average 1.4951612903225806) internal successors, (927), 635 states have internal predecessors, (927), 345 states have call successors, (345), 57 states have call predecessors, (345), 61 states have return successors, (383), 344 states have call predecessors, (383), 345 states have call successors, (383) [2025-03-16 19:43:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1655 transitions. [2025-03-16 19:43:43,838 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1655 transitions. Word has length 172 [2025-03-16 19:43:43,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:43,839 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1655 transitions. [2025-03-16 19:43:43,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 19:43:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1655 transitions. [2025-03-16 19:43:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:43:43,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:43,847 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 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-03-16 19:43:43,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:43:43,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:43,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:43,848 INFO L85 PathProgramCache]: Analyzing trace with hash -252725200, now seen corresponding path program 1 times [2025-03-16 19:43:43,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:43,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938912355] [2025-03-16 19:43:43,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:43,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:43:44,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:43:44,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:44,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-03-16 19:43:45,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:45,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938912355] [2025-03-16 19:43:45,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938912355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:45,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710058107] [2025-03-16 19:43:45,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:45,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:45,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:45,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:45,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:43:45,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:43:45,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:43:45,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:45,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:45,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-16 19:43:45,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:45,545 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 13 treesize of output 9 [2025-03-16 19:43:49,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 19:43:49,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 19:43:49,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-03-16 19:43:49,881 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-03-16 19:43:49,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-03-16 19:44:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-16 19:44:14,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:44:14,927 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 25 treesize of output 23 [2025-03-16 19:44:14,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 31 [2025-03-16 19:44:19,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710058107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:44:19,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 19:44:19,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2025-03-16 19:44:19,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257593211] [2025-03-16 19:44:19,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 19:44:19,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 19:44:19,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:19,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 19:44:19,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1124, Unknown=5, NotChecked=0, Total=1260 [2025-03-16 19:44:19,639 INFO L87 Difference]: Start difference. First operand 1027 states and 1655 transitions. Second operand has 31 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 29 states have internal predecessors, (102), 16 states have call successors, (50), 10 states have call predecessors, (50), 12 states have return successors, (50), 14 states have call predecessors, (50), 16 states have call successors, (50) [2025-03-16 19:44:23,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:27,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:31,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:35,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 19:44:39,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []