./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2c_remove_all.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-simple/sll2c_remove_all.c -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 710c04ef5673dec87141831f4d1deaf313c1e98f1de245e13a0e9013883e9f01 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:56:10,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:56:10,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:56:10,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:56:10,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:56:10,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:56:10,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:56:10,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:56:10,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:56:10,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:56:10,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:56:10,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:56:10,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:56:10,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:56:10,684 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:56:10,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:56:10,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:56:10,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:56:10,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:56:10,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:56:10,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:56:10,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:56:10,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:56:10,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:56:10,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:56:10,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:56:10,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:56:10,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:56:10,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:56:10,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:10,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:10,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:10,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:10,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:56:10,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:10,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:10,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:10,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:10,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:56:10,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:56:10,687 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:56:10,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:56:10,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:56:10,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:56:10,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:56:10,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:56:10,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:56:10,687 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 -> 710c04ef5673dec87141831f4d1deaf313c1e98f1de245e13a0e9013883e9f01 [2025-04-29 10:56:10,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:56:10,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:56:10,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:56:10,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:56:10,903 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:56:10,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_remove_all.c [2025-04-29 10:56:12,202 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c295602de/df9b1a725b0e471483b2f84f9986e64b/FLAG147e81a0f [2025-04-29 10:56:12,393 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:56:12,393 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_remove_all.c [2025-04-29 10:56:12,394 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:12,394 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:56:12,399 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c295602de/df9b1a725b0e471483b2f84f9986e64b/FLAG147e81a0f [2025-04-29 10:56:13,203 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c295602de/df9b1a725b0e471483b2f84f9986e64b [2025-04-29 10:56:13,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:56:13,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:56:13,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:13,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:56:13,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:56:13,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19341de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13, skipping insertion in model container [2025-04-29 10:56:13,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:56:13,365 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_remove_all.c[1275,1288] [2025-04-29 10:56:13,368 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:13,375 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:56:13,403 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_remove_all.c[1275,1288] [2025-04-29 10:56:13,404 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:13,416 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:56:13,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13 WrapperNode [2025-04-29 10:56:13,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:13,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:13,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:56:13,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:56:13,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,449 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 101 [2025-04-29 10:56:13,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:13,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:56:13,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:56:13,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:56:13,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,476 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [8, 10]. 56 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 7 writes are split as follows [5, 2]. [2025-04-29 10:56:13,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:56:13,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:56:13,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:56:13,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:56:13,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (1/1) ... [2025-04-29 10:56:13,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:13,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:13,518 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-04-29 10:56:13,523 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-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:56:13,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:56:13,536 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:56:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:56:13,606 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:56:13,608 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:56:13,747 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-04-29 10:56:13,747 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:56:13,757 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:56:13,760 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 10:56:13,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:13 BoogieIcfgContainer [2025-04-29 10:56:13,760 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:56:13,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:56:13,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:56:13,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:56:13,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:56:13" (1/3) ... [2025-04-29 10:56:13,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63238f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:13, skipping insertion in model container [2025-04-29 10:56:13,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:13" (2/3) ... [2025-04-29 10:56:13,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63238f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:13, skipping insertion in model container [2025-04-29 10:56:13,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:13" (3/3) ... [2025-04-29 10:56:13,768 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.c [2025-04-29 10:56:13,780 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:56:13,782 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_remove_all.c that has 2 procedures, 27 locations, 36 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-29 10:56:13,822 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:56:13,833 INFO L340 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;@49e60f99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:56:13,833 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:56:13,835 INFO L278 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:13,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 10:56:13,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:13,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:13,840 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:13,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:13,844 INFO L85 PathProgramCache]: Analyzing trace with hash -129213115, now seen corresponding path program 1 times [2025-04-29 10:56:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:13,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716802700] [2025-04-29 10:56:13,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:13,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 10:56:13,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 10:56:13,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:13,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:14,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:14,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716802700] [2025-04-29 10:56:14,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716802700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:14,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:14,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:56:14,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964933162] [2025-04-29 10:56:14,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:14,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:56:14,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:14,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:56:14,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:56:14,112 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:56:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:14,158 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2025-04-29 10:56:14,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:56:14,160 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-04-29 10:56:14,160 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:14,164 INFO L225 Difference]: With dead ends: 47 [2025-04-29 10:56:14,164 INFO L226 Difference]: Without dead ends: 30 [2025-04-29 10:56:14,167 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:56:14,169 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:14,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 53 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-29 10:56:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2025-04-29 10:56:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-04-29 10:56:14,194 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2025-04-29 10:56:14,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:14,195 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-04-29 10:56:14,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:56:14,196 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-04-29 10:56:14,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 10:56:14,197 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:14,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:14,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:56:14,197 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:14,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1806702190, now seen corresponding path program 1 times [2025-04-29 10:56:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:14,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970053741] [2025-04-29 10:56:14,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:14,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:14,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 10:56:14,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 10:56:14,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:14,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:14,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:14,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970053741] [2025-04-29 10:56:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970053741] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:14,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:14,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824328016] [2025-04-29 10:56:14,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:14,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:14,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:14,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:14,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:14,383 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:56:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:14,404 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-04-29 10:56:14,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:14,405 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-04-29 10:56:14,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:14,405 INFO L225 Difference]: With dead ends: 39 [2025-04-29 10:56:14,406 INFO L226 Difference]: Without dead ends: 27 [2025-04-29 10:56:14,406 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:14,406 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 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-04-29 10:56:14,407 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-29 10:56:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-04-29 10:56:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-04-29 10:56:14,412 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2025-04-29 10:56:14,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:14,413 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-04-29 10:56:14,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:56:14,413 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-04-29 10:56:14,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 10:56:14,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:14,413 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:14,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:56:14,413 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:14,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash -101414118, now seen corresponding path program 1 times [2025-04-29 10:56:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:14,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236425081] [2025-04-29 10:56:14,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:14,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:14,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:56:14,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:56:14,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:14,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:14,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:14,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236425081] [2025-04-29 10:56:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236425081] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:14,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414232369] [2025-04-29 10:56:14,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:14,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:14,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:14,641 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-04-29 10:56:14,641 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-04-29 10:56:14,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:56:14,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:56:14,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:14,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:14,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 10:56:14,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:56:14,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 10:56:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414232369] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:14,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-29 10:56:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472261132] [2025-04-29 10:56:14,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:14,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 10:56:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:14,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 10:56:14,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:56:14,898 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:56:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:14,961 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2025-04-29 10:56:14,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:56:14,961 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-04-29 10:56:14,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:14,962 INFO L225 Difference]: With dead ends: 43 [2025-04-29 10:56:14,962 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 10:56:14,962 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:56:14,963 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:14,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 81 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 10:56:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2025-04-29 10:56:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-04-29 10:56:14,970 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 25 [2025-04-29 10:56:14,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:14,970 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-04-29 10:56:14,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:56:14,970 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-04-29 10:56:14,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 10:56:14,971 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:14,971 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:14,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:56:15,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:15,175 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:15,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1719496605, now seen corresponding path program 2 times [2025-04-29 10:56:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:15,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746301677] [2025-04-29 10:56:15,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:15,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-29 10:56:15,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 10:56:15,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:15,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:15,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746301677] [2025-04-29 10:56:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746301677] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:15,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:15,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:56:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785850585] [2025-04-29 10:56:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:15,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:56:15,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:15,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:56:15,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:15,422 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:15,476 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-04-29 10:56:15,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:56:15,477 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-04-29 10:56:15,477 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:15,478 INFO L225 Difference]: With dead ends: 44 [2025-04-29 10:56:15,478 INFO L226 Difference]: Without dead ends: 41 [2025-04-29 10:56:15,479 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:56:15,479 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:15,480 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 82 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-29 10:56:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2025-04-29 10:56:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-04-29 10:56:15,489 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 28 [2025-04-29 10:56:15,489 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:15,489 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-04-29 10:56:15,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:15,489 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-04-29 10:56:15,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 10:56:15,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:15,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:15,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:56:15,490 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:15,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash -306554898, now seen corresponding path program 1 times [2025-04-29 10:56:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:15,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651398974] [2025-04-29 10:56:15,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:15,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:15,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:56:15,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:56:15,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:15,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:15,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:15,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651398974] [2025-04-29 10:56:15,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651398974] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:15,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:15,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:56:15,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616228491] [2025-04-29 10:56:15,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:15,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:56:15,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:15,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:56:15,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:15,805 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:15,886 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-04-29 10:56:15,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:56:15,886 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-04-29 10:56:15,887 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:15,887 INFO L225 Difference]: With dead ends: 51 [2025-04-29 10:56:15,887 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 10:56:15,887 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:56:15,888 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:15,888 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 10:56:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-04-29 10:56:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-04-29 10:56:15,896 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 31 [2025-04-29 10:56:15,896 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:15,896 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-04-29 10:56:15,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:15,896 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-04-29 10:56:15,897 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:15,897 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:15,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:15,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:56:15,898 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:15,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash 516511425, now seen corresponding path program 1 times [2025-04-29 10:56:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:15,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645099070] [2025-04-29 10:56:15,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:15,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:15,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:56:15,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:15,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:15,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:56:16,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:16,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645099070] [2025-04-29 10:56:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645099070] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:16,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785491855] [2025-04-29 10:56:16,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:16,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:16,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:16,404 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-04-29 10:56:16,406 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-04-29 10:56:16,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:56:16,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:16,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:16,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:16,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-29 10:56:16,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:16,539 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-29 10:56:16,585 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:56:16,585 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 10:56:16,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:16,628 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:16,629 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-04-29 10:56:16,646 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:16,650 INFO L325 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2025-04-29 10:56:16,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 15 [2025-04-29 10:56:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:56:16,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:16,705 INFO L354 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 29 treesize of output 17 [2025-04-29 10:56:16,709 INFO L354 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 21 treesize of output 13 [2025-04-29 10:56:16,760 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:16,760 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2025-04-29 10:56:16,763 INFO L354 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 33 treesize of output 25 [2025-04-29 10:56:16,769 INFO L354 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 6 treesize of output 4 [2025-04-29 10:56:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:56:16,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785491855] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:16,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:16,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 24 [2025-04-29 10:56:16,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383099850] [2025-04-29 10:56:16,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:16,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 10:56:16,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:16,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 10:56:16,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=490, Unknown=5, NotChecked=0, Total=552 [2025-04-29 10:56:16,961 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 10:56:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:17,258 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2025-04-29 10:56:17,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 10:56:17,259 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2025-04-29 10:56:17,259 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:17,260 INFO L225 Difference]: With dead ends: 63 [2025-04-29 10:56:17,260 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 10:56:17,261 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=671, Unknown=5, NotChecked=0, Total=756 [2025-04-29 10:56:17,261 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:17,261 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 213 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:56:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 10:56:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2025-04-29 10:56:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-04-29 10:56:17,269 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 34 [2025-04-29 10:56:17,269 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:17,269 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-04-29 10:56:17,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 10:56:17,269 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-04-29 10:56:17,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 10:56:17,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:17,270 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:17,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:17,470 WARN L466 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-04-29 10:56:17,470 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:17,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:17,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2002424285, now seen corresponding path program 1 times [2025-04-29 10:56:17,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:17,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662511349] [2025-04-29 10:56:17,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:17,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:17,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 10:56:17,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:56:17,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:17,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:56:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:17,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662511349] [2025-04-29 10:56:17,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662511349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:17,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468853970] [2025-04-29 10:56:17,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:17,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:17,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:17,930 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-04-29 10:56:17,932 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-04-29 10:56:18,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 10:56:18,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:56:18,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:18,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:18,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-04-29 10:56:18,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:18,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-29 10:56:18,160 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:56:18,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 10:56:18,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:18,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 10:56:18,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 108 [2025-04-29 10:56:18,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 79 [2025-04-29 10:56:18,547 INFO L325 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-04-29 10:56:18,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2025-04-29 10:56:18,560 INFO L325 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2025-04-29 10:56:18,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 36 [2025-04-29 10:56:18,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2025-04-29 10:56:18,626 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:18,631 INFO L325 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2025-04-29 10:56:18,631 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 34 [2025-04-29 10:56:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:56:18,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468853970] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:19,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:19,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20, 11] total 34 [2025-04-29 10:56:19,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862650067] [2025-04-29 10:56:19,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:19,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 10:56:19,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:19,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 10:56:19,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 10:56:19,364 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 31 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:56:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:19,941 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2025-04-29 10:56:19,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 10:56:19,943 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 31 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-04-29 10:56:19,944 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:19,944 INFO L225 Difference]: With dead ends: 86 [2025-04-29 10:56:19,944 INFO L226 Difference]: Without dead ends: 72 [2025-04-29 10:56:19,945 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=169, Invalid=1313, Unknown=0, NotChecked=0, Total=1482 [2025-04-29 10:56:19,945 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:19,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 223 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:56:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-29 10:56:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2025-04-29 10:56:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-04-29 10:56:19,953 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 40 [2025-04-29 10:56:19,953 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:19,953 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-04-29 10:56:19,953 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 31 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 10:56:19,953 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-04-29 10:56:19,954 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 10:56:19,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:19,954 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:19,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:56:20,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:20,155 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:20,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1650128441, now seen corresponding path program 2 times [2025-04-29 10:56:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:20,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060209689] [2025-04-29 10:56:20,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:20,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-29 10:56:20,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:56:20,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:20,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 10:56:20,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:20,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060209689] [2025-04-29 10:56:20,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060209689] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:20,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656069545] [2025-04-29 10:56:20,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:20,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:20,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:20,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:20,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 10:56:20,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-29 10:56:20,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:56:20,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:20,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:20,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:56:20,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 10:56:20,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:56:20,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656069545] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:20,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:56:20,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-29 10:56:20,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896353443] [2025-04-29 10:56:20,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:20,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:56:20,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:20,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:56:20,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:20,371 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:20,384 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2025-04-29 10:56:20,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:56:20,385 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-04-29 10:56:20,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:20,385 INFO L225 Difference]: With dead ends: 93 [2025-04-29 10:56:20,385 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 10:56:20,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-04-29 10:56:20,386 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:20,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 10:56:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-04-29 10:56:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-04-29 10:56:20,391 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 42 [2025-04-29 10:56:20,392 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:20,392 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-04-29 10:56:20,392 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:20,392 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-04-29 10:56:20,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 10:56:20,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:20,392 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:20,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:20,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:20,593 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:20,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:20,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1648588034, now seen corresponding path program 3 times [2025-04-29 10:56:20,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:20,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077545164] [2025-04-29 10:56:20,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:56:20,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:20,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-04-29 10:56:20,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 10:56:20,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 10:56:20,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:56:20,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:20,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077545164] [2025-04-29 10:56:20,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077545164] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:20,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808811297] [2025-04-29 10:56:20,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:56:20,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:20,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:20,699 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:20,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 10:56:20,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-04-29 10:56:21,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 10:56:21,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 10:56:21,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:21,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:56:21,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:56:21,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:56:21,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808811297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:21,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:56:21,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-04-29 10:56:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950508374] [2025-04-29 10:56:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:21,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:56:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:21,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:56:21,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:56:21,249 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:21,269 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-04-29 10:56:21,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:56:21,272 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-04-29 10:56:21,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:21,272 INFO L225 Difference]: With dead ends: 72 [2025-04-29 10:56:21,272 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 10:56:21,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:56:21,273 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:21,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 10:56:21,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2025-04-29 10:56:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:56:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-04-29 10:56:21,278 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2025-04-29 10:56:21,278 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:21,278 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-04-29 10:56:21,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 10:56:21,278 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-04-29 10:56:21,278 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 10:56:21,279 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:21,279 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:21,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 10:56:21,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:21,479 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:21,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash 197797770, now seen corresponding path program 2 times [2025-04-29 10:56:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:21,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484403275] [2025-04-29 10:56:21,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:21,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-29 10:56:21,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 10:56:21,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:21,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:22,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:22,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484403275] [2025-04-29 10:56:22,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484403275] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:22,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169674320] [2025-04-29 10:56:22,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:22,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:22,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:22,396 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:56:22,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 10:56:22,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-29 10:56:22,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 10:56:22,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:22,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:22,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 161 conjuncts are in the unsatisfiable core [2025-04-29 10:56:22,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:22,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-29 10:56:22,564 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:56:22,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 10:56:22,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:22,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:22,633 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 10:56:22,634 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2025-04-29 10:56:22,648 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-04-29 10:56:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 10:56:23,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:25,939 INFO L354 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 785 treesize of output 585 [2025-04-29 10:56:25,942 INFO L354 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 589 treesize of output 381 [2025-04-29 10:56:26,704 INFO L325 Elim1Store]: treesize reduction 150, result has 10.2 percent of original size [2025-04-29 10:56:26,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 14249 treesize of output 13893 [2025-04-29 10:56:30,719 INFO L325 Elim1Store]: treesize reduction 2054, result has 25.8 percent of original size [2025-04-29 10:56:30,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 27 new quantified variables, introduced 276 case distinctions, treesize of input 1925310 treesize of output 1653253 Killed by 15