./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.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_insert_equal.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 88f268e38877d115a4e1b5643e97b9a66886e70348eadf8d312be17840a519d1 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:56:00,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:56:00,582 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:00,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:56:00,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:56:00,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:56:00,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:56:00,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:56:00,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:56:00,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:56:00,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:56:00,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:56:00,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:56:00,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:56:00,608 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:56:00,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:56:00,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:56:00,608 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:56:00,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:56:00,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:56:00,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:56:00,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:56:00,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:56:00,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:56:00,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:56:00,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:56:00,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:56:00,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:56:00,609 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:56:00,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:00,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:00,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:00,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:00,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:00,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:56:00,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:56:00,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:56:00,611 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 -> 88f268e38877d115a4e1b5643e97b9a66886e70348eadf8d312be17840a519d1 [2025-04-29 10:56:00,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:56:00,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:56:00,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:56:00,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:56:00,859 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:56:00,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.c [2025-04-29 10:56:02,096 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6df158c2/d43b5f92b45d4fbeb9f015bc2d1c69a7/FLAGecec5942a [2025-04-29 10:56:02,334 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:56:02,334 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_equal.c [2025-04-29 10:56:02,335 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:02,336 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:02,342 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6df158c2/d43b5f92b45d4fbeb9f015bc2d1c69a7/FLAGecec5942a [2025-04-29 10:56:03,297 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6df158c2/d43b5f92b45d4fbeb9f015bc2d1c69a7 [2025-04-29 10:56:03,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:56:03,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:56:03,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:03,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:56:03,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:56:03,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:03" (1/1) ... [2025-04-29 10:56:03,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14af226d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:03, skipping insertion in model container [2025-04-29 10:56:03,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:56:03" (1/1) ... [2025-04-29 10:56:03,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:56:03,453 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_insert_equal.c[1802,1815] [2025-04-29 10:56:03,455 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:03,463 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:56:03,487 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_insert_equal.c[1802,1815] [2025-04-29 10:56:03,489 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:56:03,502 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:56:03,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:03 WrapperNode [2025-04-29 10:56:03,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:56:03,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:03,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:56:03,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:56:03,509 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:03" (1/1) ... [2025-04-29 10:56:03,515 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:03" (1/1) ... [2025-04-29 10:56:03,534 INFO L138 Inliner]: procedures = 18, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 129 [2025-04-29 10:56:03,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:56:03,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:56:03,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:56:03,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:56:03,540 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:03" (1/1) ... [2025-04-29 10:56:03,541 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:03" (1/1) ... [2025-04-29 10:56:03,542 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:03" (1/1) ... [2025-04-29 10:56:03,554 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [9, 14]. 61 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 10 writes are split as follows [1, 9]. [2025-04-29 10:56:03,555 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:03" (1/1) ... [2025-04-29 10:56:03,555 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:03" (1/1) ... [2025-04-29 10:56:03,559 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:03" (1/1) ... [2025-04-29 10:56:03,560 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:03" (1/1) ... [2025-04-29 10:56:03,561 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:03" (1/1) ... [2025-04-29 10:56:03,562 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:03" (1/1) ... [2025-04-29 10:56:03,563 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:03" (1/1) ... [2025-04-29 10:56:03,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:56:03,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:56:03,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:56:03,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:56:03,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:03" (1/1) ... [2025-04-29 10:56:03,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:56:03,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:03,592 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:03,594 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:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:56:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:56:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:56:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:56:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:56:03,688 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:56:03,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:56:03,897 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-04-29 10:56:03,897 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:56:03,910 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:56:03,910 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 10:56:03,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:03 BoogieIcfgContainer [2025-04-29 10:56:03,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:56:03,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:56:03,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:56:03,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:56:03,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:56:03" (1/3) ... [2025-04-29 10:56:03,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d1aa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:03, skipping insertion in model container [2025-04-29 10:56:03,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:56:03" (2/3) ... [2025-04-29 10:56:03,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d1aa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:56:03, skipping insertion in model container [2025-04-29 10:56:03,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:56:03" (3/3) ... [2025-04-29 10:56:03,921 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.c [2025-04-29 10:56:03,933 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:56:03,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_equal.c that has 2 procedures, 33 locations, 48 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-29 10:56:03,974 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:56:03,985 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;@616049f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:56:03,985 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:56:03,988 INFO L278 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 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:03,996 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 10:56:03,996 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:03,997 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] [2025-04-29 10:56:03,998 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:04,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash -873451054, now seen corresponding path program 1 times [2025-04-29 10:56:04,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:04,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931291914] [2025-04-29 10:56:04,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:04,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:04,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:56:04,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:56:04,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:04,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:04,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:04,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931291914] [2025-04-29 10:56:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931291914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:04,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:04,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 10:56:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214300717] [2025-04-29 10:56:04,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:04,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 10:56:04,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:04,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 10:56:04,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:56:04,246 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 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) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:04,263 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2025-04-29 10:56:04,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 10:56:04,266 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 24 [2025-04-29 10:56:04,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:04,270 INFO L225 Difference]: With dead ends: 42 [2025-04-29 10:56:04,270 INFO L226 Difference]: Without dead ends: 26 [2025-04-29 10:56:04,272 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:56:04,276 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:04,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-29 10:56:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-04-29 10:56:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-04-29 10:56:04,306 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 24 [2025-04-29 10:56:04,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:04,307 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-04-29 10:56:04,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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:04,307 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-04-29 10:56:04,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 10:56:04,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:04,309 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] [2025-04-29 10:56:04,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:56:04,309 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:04,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash -873463981, now seen corresponding path program 1 times [2025-04-29 10:56:04,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:04,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13037138] [2025-04-29 10:56:04,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:04,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:56:04,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:56:04,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:04,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:56:04,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:04,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13037138] [2025-04-29 10:56:04,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13037138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:04,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:04,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:04,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847023548] [2025-04-29 10:56:04,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:04,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:04,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:04,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:04,522 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:04,542 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2025-04-29 10:56:04,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:04,543 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 24 [2025-04-29 10:56:04,543 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:04,543 INFO L225 Difference]: With dead ends: 48 [2025-04-29 10:56:04,543 INFO L226 Difference]: Without dead ends: 29 [2025-04-29 10:56:04,544 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:04,544 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:04,544 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-29 10:56:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-04-29 10:56:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-04-29 10:56:04,548 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 24 [2025-04-29 10:56:04,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:04,548 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-04-29 10:56:04,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:04,548 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-04-29 10:56:04,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 10:56:04,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:04,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:04,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:56:04,549 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:04,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1600969173, now seen corresponding path program 1 times [2025-04-29 10:56:04,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:04,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641107616] [2025-04-29 10:56:04,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:04,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:04,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 10:56:04,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 10:56:04,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:04,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:56:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:04,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641107616] [2025-04-29 10:56:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641107616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:56:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105295618] [2025-04-29 10:56:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:04,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:56:04,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:04,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:56:04,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:56:04,677 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:56:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:04,693 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2025-04-29 10:56:04,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:56:04,694 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2025-04-29 10:56:04,694 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:04,695 INFO L225 Difference]: With dead ends: 36 [2025-04-29 10:56:04,695 INFO L226 Difference]: Without dead ends: 29 [2025-04-29 10:56:04,695 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:04,695 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:04,695 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-29 10:56:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-29 10:56:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-04-29 10:56:04,699 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 32 [2025-04-29 10:56:04,699 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:04,699 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-04-29 10:56:04,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:56:04,699 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-04-29 10:56:04,700 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 10:56:04,700 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:04,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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:04,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:56:04,700 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:04,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:04,700 INFO L85 PathProgramCache]: Analyzing trace with hash 38386709, now seen corresponding path program 1 times [2025-04-29 10:56:04,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:04,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138123853] [2025-04-29 10:56:04,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:04,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:04,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:56:04,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:56:04,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:04,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:06,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:06,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138123853] [2025-04-29 10:56:06,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138123853] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:06,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250771241] [2025-04-29 10:56:06,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:06,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:06,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:06,383 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:06,385 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:06,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 10:56:06,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 10:56:06,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:06,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:06,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-04-29 10:56:06,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:06,788 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:06,989 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:07,069 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:07,070 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:56:07,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 10:56:07,225 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:07,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2025-04-29 10:56:07,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:07,612 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-29 10:56:07,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-29 10:56:07,627 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 20 treesize of output 15 [2025-04-29 10:56:07,902 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-04-29 10:56:07,907 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 20 treesize of output 15 [2025-04-29 10:56:07,962 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 19 treesize of output 11 [2025-04-29 10:56:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:08,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:09,717 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 Int) (v_ArrVal_285 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_283)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_285) (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-04-29 10:56:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250771241] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:09,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:09,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2025-04-29 10:56:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646454985] [2025-04-29 10:56:09,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:09,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 10:56:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:09,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 10:56:09,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2072, Unknown=28, NotChecked=92, Total=2352 [2025-04-29 10:56:09,902 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:10,822 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2025-04-29 10:56:10,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 10:56:10,825 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2025-04-29 10:56:10,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:10,826 INFO L225 Difference]: With dead ends: 51 [2025-04-29 10:56:10,826 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 10:56:10,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=283, Invalid=3475, Unknown=28, NotChecked=120, Total=3906 [2025-04-29 10:56:10,828 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:10,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 339 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 10:56:10,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 10:56:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2025-04-29 10:56:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-04-29 10:56:10,833 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 33 [2025-04-29 10:56:10,833 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:10,833 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-04-29 10:56:10,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 34 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:10,833 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-04-29 10:56:10,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:10,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:10,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:10,841 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:11,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:11,034 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:11,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash -681188501, now seen corresponding path program 2 times [2025-04-29 10:56:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:11,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737142133] [2025-04-29 10:56:11,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:11,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:11,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-29 10:56:11,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:11,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:11,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:11,207 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:56:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:11,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737142133] [2025-04-29 10:56:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737142133] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:11,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256731049] [2025-04-29 10:56:11,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:11,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:11,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:11,212 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:11,213 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:11,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-29 10:56:11,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:11,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:11,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:11,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:56:11,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:56:11,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:56:11,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256731049] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:11,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:56:11,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-29 10:56:11,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895731219] [2025-04-29 10:56:11,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:11,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:56:11,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:11,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:56:11,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:56:11,344 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:11,369 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-04-29 10:56:11,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:56:11,370 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-04-29 10:56:11,371 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:11,371 INFO L225 Difference]: With dead ends: 50 [2025-04-29 10:56:11,371 INFO L226 Difference]: Without dead ends: 39 [2025-04-29 10:56:11,371 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:56:11,372 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:11,372 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-29 10:56:11,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-04-29 10:56:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-04-29 10:56:11,376 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 34 [2025-04-29 10:56:11,376 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:11,376 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-04-29 10:56:11,376 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:11,377 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-04-29 10:56:11,377 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:56:11,377 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:11,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 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:11,383 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:11,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:11,578 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:11,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash 721626543, now seen corresponding path program 1 times [2025-04-29 10:56:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:11,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530405766] [2025-04-29 10:56:11,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:11,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:56:11,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:56:11,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:11,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:56:11,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:11,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530405766] [2025-04-29 10:56:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530405766] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:11,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:56:11,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:56:11,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623602745] [2025-04-29 10:56:11,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:11,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:56:11,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:11,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:56:11,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:56:11,650 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:11,666 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2025-04-29 10:56:11,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:56:11,667 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-04-29 10:56:11,667 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:11,667 INFO L225 Difference]: With dead ends: 48 [2025-04-29 10:56:11,667 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 10:56:11,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:56:11,668 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:11,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 67 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 10:56:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-04-29 10:56:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-04-29 10:56:11,677 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 34 [2025-04-29 10:56:11,677 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:11,677 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-04-29 10:56:11,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:56:11,678 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-04-29 10:56:11,678 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:56:11,678 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:11,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 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:11,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:56:11,678 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:11,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:11,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1765039956, now seen corresponding path program 1 times [2025-04-29 10:56:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:11,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239069307] [2025-04-29 10:56:11,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:11,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:11,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:56:11,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:56:11,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:11,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:12,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:12,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239069307] [2025-04-29 10:56:12,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239069307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:12,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847886233] [2025-04-29 10:56:12,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:12,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:12,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:12,127 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:12,128 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:12,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:56:12,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:56:12,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:12,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:12,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-29 10:56:12,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:12,236 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:12,333 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:12,333 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:56:12,362 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:12,397 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:12,397 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 34 treesize of output 33 [2025-04-29 10:56:12,461 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 38 treesize of output 14 [2025-04-29 10:56:12,466 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:12,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:12,562 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 46 treesize of output 35 [2025-04-29 10:56:12,574 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-29 10:56:12,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-04-29 10:56:12,656 INFO L325 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-04-29 10:56:12,656 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2025-04-29 10:56:12,672 INFO L325 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2025-04-29 10:56:12,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2025-04-29 10:56:12,687 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 22 treesize of output 16 [2025-04-29 10:56:12,708 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 28 treesize of output 20 [2025-04-29 10:56:12,736 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 35 treesize of output 19 [2025-04-29 10:56:12,737 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 16 treesize of output 8 [2025-04-29 10:56:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:12,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:12,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847886233] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:12,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:12,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 31 [2025-04-29 10:56:12,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660087143] [2025-04-29 10:56:12,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:12,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 10:56:12,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:12,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 10:56:12,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1013, Unknown=24, NotChecked=0, Total=1122 [2025-04-29 10:56:12,916 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 10:56:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:13,452 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2025-04-29 10:56:13,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-29 10:56:13,452 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-04-29 10:56:13,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:13,453 INFO L225 Difference]: With dead ends: 60 [2025-04-29 10:56:13,453 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 10:56:13,454 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=2139, Unknown=24, NotChecked=0, Total=2352 [2025-04-29 10:56:13,454 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:13,454 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 293 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:56:13,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 10:56:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2025-04-29 10:56:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-04-29 10:56:13,459 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 35 [2025-04-29 10:56:13,459 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:13,459 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-04-29 10:56:13,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 10:56:13,459 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-04-29 10:56:13,460 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:56:13,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:13,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 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:13,468 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:13,664 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:13,664 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:13,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -110368487, now seen corresponding path program 1 times [2025-04-29 10:56:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:13,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376617276] [2025-04-29 10:56:13,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:13,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:56:13,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:56:13,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:13,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:13,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:13,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376617276] [2025-04-29 10:56:13,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376617276] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:13,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149510068] [2025-04-29 10:56:13,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:13,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:13,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:13,837 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:13,839 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:13,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:56:13,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:56:13,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:13,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:13,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-29 10:56:13,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:14,004 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 10:56:14,096 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 25 treesize of output 13 [2025-04-29 10:56:14,104 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:56:14,109 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:56:14,130 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 25 treesize of output 17 [2025-04-29 10:56:14,132 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:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 10:56:14,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:56:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149510068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:56:14,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:56:14,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2025-04-29 10:56:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919688189] [2025-04-29 10:56:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:56:14,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 10:56:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:14,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 10:56:14,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2025-04-29 10:56:14,171 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 1 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:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:14,322 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-04-29 10:56:14,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 10:56:14,323 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 1 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 35 [2025-04-29 10:56:14,323 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:14,324 INFO L225 Difference]: With dead ends: 51 [2025-04-29 10:56:14,324 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 10:56:14,324 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:56:14,325 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:14,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 141 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:56:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 10:56:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-04-29 10:56:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-04-29 10:56:14,329 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 35 [2025-04-29 10:56:14,329 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:14,329 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-04-29 10:56:14,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 1 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:14,329 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-04-29 10:56:14,330 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:56:14,330 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:14,330 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 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:14,337 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:14,530 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:14,530 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:14,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash -167626789, now seen corresponding path program 1 times [2025-04-29 10:56:14,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:14,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644779563] [2025-04-29 10:56:14,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:14,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:56:14,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:56:14,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:14,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:56:14,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:14,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644779563] [2025-04-29 10:56:14,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644779563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:14,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742751797] [2025-04-29 10:56:14,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:14,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:14,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:14,603 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:14,605 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:14,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:56:14,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:56:14,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:14,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:14,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 10:56:14,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:56:14,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:56:14,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742751797] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:14,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:14,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-29 10:56:14,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211684961] [2025-04-29 10:56:14,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:14,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:56:14,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:14,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:56:14,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:56:14,794 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:56:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:14,853 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-04-29 10:56:14,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:56:14,854 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-04-29 10:56:14,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:14,854 INFO L225 Difference]: With dead ends: 47 [2025-04-29 10:56:14,854 INFO L226 Difference]: Without dead ends: 39 [2025-04-29 10:56:14,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:56:14,855 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:14,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:56:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-29 10:56:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-04-29 10:56:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-04-29 10:56:14,861 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 35 [2025-04-29 10:56:14,862 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:14,862 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-04-29 10:56:14,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:56:14,862 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-04-29 10:56:14,863 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:56:14,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:14,864 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 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:14,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:15,064 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:15,065 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:15,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:15,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1118259406, now seen corresponding path program 1 times [2025-04-29 10:56:15,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:15,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362603119] [2025-04-29 10:56:15,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:15,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:15,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:56:15,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:56:15,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:15,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:15,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:15,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362603119] [2025-04-29 10:56:15,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362603119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:15,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242517906] [2025-04-29 10:56:15,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:15,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:15,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:15,757 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:15,759 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:15,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:56:15,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:56:15,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:15,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:15,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 155 conjuncts are in the unsatisfiable core [2025-04-29 10:56:15,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:15,956 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:15,982 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:16,207 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 10:56:16,207 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 10:56:16,226 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:16,226 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:56:16,277 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:16,285 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,292 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,359 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:16,359 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 88 treesize of output 75 [2025-04-29 10:56:16,362 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 24 treesize of output 11 [2025-04-29 10:56:16,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:16,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-04-29 10:56:16,471 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 45 treesize of output 21 [2025-04-29 10:56:16,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2025-04-29 10:56:16,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:16,481 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-04-29 10:56:16,588 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:56:16,670 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:56:16,670 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 10:56:16,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:16,678 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 53 treesize of output 36 [2025-04-29 10:56:16,691 INFO L325 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-04-29 10:56:16,691 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 1 case distinctions, treesize of input 24 treesize of output 31 [2025-04-29 10:56:16,708 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:16,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-29 10:56:16,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:16,962 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2025-04-29 10:56:16,967 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2025-04-29 10:56:16,972 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 39 [2025-04-29 10:56:16,980 INFO L325 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-04-29 10:56:16,980 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 68 [2025-04-29 10:56:16,983 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 36 treesize of output 15 [2025-04-29 10:56:16,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 19 [2025-04-29 10:56:17,076 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 70 treesize of output 42 [2025-04-29 10:56:17,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 35 treesize of output 19 [2025-04-29 10:56:17,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 10:56:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:17,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:17,472 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1018))) (or (= (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1020) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1024) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1019) .cse1) .cse2) 4))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1020))))) is different from false [2025-04-29 10:56:17,484 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (store |c_#memory_int#1| .cse1 v_ArrVal_1018))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| v_ArrVal_1020) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| v_ArrVal_1024) .cse3) .cse4)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base| v_ArrVal_1019) .cse3) .cse4) 4)))) (not (= v_ArrVal_1020 (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1020 |c_ULTIMATE.start_sll_circular_insert_#t~ret6#1.offset|)))))))) is different from false [2025-04-29 10:56:17,549 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:17,550 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 10:56:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242517906] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:17,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:17,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 40 [2025-04-29 10:56:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042830156] [2025-04-29 10:56:17,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:17,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-29 10:56:17,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:17,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-29 10:56:17,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1815, Unknown=38, NotChecked=174, Total=2162 [2025-04-29 10:56:17,657 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:56:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:18,868 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-04-29 10:56:18,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-29 10:56:18,868 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2025-04-29 10:56:18,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:18,870 INFO L225 Difference]: With dead ends: 77 [2025-04-29 10:56:18,870 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 10:56:18,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=344, Invalid=4720, Unknown=56, NotChecked=282, Total=5402 [2025-04-29 10:56:18,871 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:18,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 309 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 10:56:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 10:56:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 39. [2025-04-29 10:56:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-04-29 10:56:18,880 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 36 [2025-04-29 10:56:18,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:18,880 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-04-29 10:56:18,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 10:56:18,880 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-04-29 10:56:18,880 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:56:18,880 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:18,880 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:56:18,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 10:56:19,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:19,081 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:19,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1310104752, now seen corresponding path program 1 times [2025-04-29 10:56:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:19,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112761237] [2025-04-29 10:56:19,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:19,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:56:19,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:56:19,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:19,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:19,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112761237] [2025-04-29 10:56:19,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112761237] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:19,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830523146] [2025-04-29 10:56:19,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:19,244 INFO L229 MonitoredProcess]: Starting monitored process 8 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:19,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 10:56:19,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:56:19,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:56:19,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:19,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:19,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 10:56:19,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:19,419 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 16 treesize of output 8 [2025-04-29 10:56:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:56:19,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:56:19,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830523146] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:56:19,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:56:19,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 14 [2025-04-29 10:56:19,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043280413] [2025-04-29 10:56:19,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:19,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 10:56:19,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:19,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 10:56:19,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:56:19,456 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 10:56:23,468 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:27,477 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:31,483 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:35,592 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:56:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:35,595 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-04-29 10:56:35,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 10:56:35,595 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2025-04-29 10:56:35,595 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:35,595 INFO L225 Difference]: With dead ends: 49 [2025-04-29 10:56:35,596 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 10:56:35,596 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-04-29 10:56:35,596 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:35,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 248 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-04-29 10:56:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 10:56:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-04-29 10:56:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:56:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-04-29 10:56:35,604 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 37 [2025-04-29 10:56:35,604 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:35,604 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-04-29 10:56:35,604 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 10:56:35,604 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-04-29 10:56:35,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 10:56:35,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:35,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 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:35,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 10:56:35,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:35,805 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:35,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash 905503525, now seen corresponding path program 1 times [2025-04-29 10:56:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:35,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154339947] [2025-04-29 10:56:35,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:35,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 10:56:35,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:56:35,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:35,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:36,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:36,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154339947] [2025-04-29 10:56:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154339947] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:36,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527503513] [2025-04-29 10:56:36,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:56:36,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:36,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:36,434 INFO L229 MonitoredProcess]: Starting monitored process 9 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:36,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 10:56:36,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 10:56:36,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:56:36,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:56:36,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:36,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-04-29 10:56:36,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:36,648 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:36,760 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:36,760 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:56:36,793 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:36,835 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:56:36,835 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 34 treesize of output 33 [2025-04-29 10:56:36,903 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 30 treesize of output 14 [2025-04-29 10:56:36,905 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:37,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:37,021 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 38 treesize of output 27 [2025-04-29 10:56:37,034 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:37,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-29 10:56:37,205 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 0 case distinctions, treesize of input 40 treesize of output 36 [2025-04-29 10:56:37,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 110 [2025-04-29 10:56:37,211 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 128 treesize of output 44 [2025-04-29 10:56:37,341 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 72 treesize of output 48 [2025-04-29 10:56:37,350 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 10:56:37,350 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 15 treesize of output 7 [2025-04-29 10:56:37,396 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 83 treesize of output 51 [2025-04-29 10:56:37,399 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 10:56:37,399 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-04-29 10:56:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:37,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:56:37,419 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:37,419 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 95 treesize of output 96 [2025-04-29 10:56:37,427 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:56:37,427 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 196 treesize of output 188 [2025-04-29 10:56:37,429 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 168 treesize of output 162 [2025-04-29 10:56:37,998 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29| Int)) (or (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_82 Int) (v_ArrVal_1296 (Array Int Int))) (not (= .cse0 (select (let ((.cse21 (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29| v_ArrVal_1296))) (let ((.cse24 (select .cse23 .cse3))) (let ((.cse22 (store .cse24 .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29|))) (store (store |c_#memory_$Pointer$#1.base| .cse3 .cse22) |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29| (store (select (store .cse23 .cse3 .cse22) |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29|) v_arrayElimCell_82 (select .cse24 .cse7)))))))) (select .cse21 (select (select .cse21 .cse0) .cse2))) v_arrayElimCell_83)))) (= .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29|) 0))))) (.cse8 (not (= (select |c_#valid| .cse0) 0)))) (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29| Int)) (or (forall ((v_arrayElimCell_83 Int) (v_ArrVal_1296 (Array Int Int))) (not (= .cse0 (select (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29| v_ArrVal_1296))) (let ((.cse6 (select .cse5 .cse3))) (let ((.cse4 (store .cse6 .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29|))) (store (store |c_#memory_$Pointer$#1.base| .cse3 .cse4) |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29| (store (select (store .cse5 .cse3 .cse4) |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29|) v_arrayElimCell_83 (select .cse6 .cse7)))))))) (select .cse1 (select (select .cse1 .cse0) .cse2))) v_arrayElimCell_83)))) (= .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret6#1.base_29|) 0)))) (or .cse8 (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_84 Int) (v_ArrVal_1296 (Array Int Int))) (not (= .cse0 (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1296))) (let ((.cse12 (select .cse11 .cse3))) (let ((.cse9 (store .cse12 .cse7 .cse0))) (let ((.cse10 (store (select (store .cse11 .cse3 .cse9) .cse0) v_arrayElimCell_83 (select .cse12 .cse7)))) (select (store (store |c_#memory_$Pointer$#1.base| .cse3 .cse9) .cse0 .cse10) (select .cse10 .cse2)))))) v_arrayElimCell_84))))) (or (= .cse0 .cse3) (and (or (forall ((v_arrayElimCell_82 Int) (v_arrayElimCell_84 Int) (v_ArrVal_1296 (Array Int Int))) (not (= .cse0 (select (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse13 (store .cse15 .cse7 .cse0))) (let ((.cse14 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1296) .cse3 .cse13) .cse0) v_arrayElimCell_82 (select .cse15 .cse7)))) (select (store (store |c_#memory_$Pointer$#1.base| .cse3 .cse13) .cse0 .cse14) (select .cse14 .cse2))))) v_arrayElimCell_84)))) .cse8) .cse16)) (or (and .cse16 (or .cse8 (forall ((v_arrayElimCell_82 Int) (v_arrayElimCell_84 Int) (v_ArrVal_1296 (Array Int Int))) (not (= .cse0 (select (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1296))) (let ((.cse20 (select .cse19 .cse3))) (let ((.cse17 (store .cse20 .cse7 .cse0))) (let ((.cse18 (store (select (store .cse19 .cse3 .cse17) .cse0) v_arrayElimCell_82 (select .cse20 .cse7)))) (select (store (store |c_#memory_$Pointer$#1.base| .cse3 .cse17) .cse0 .cse18) (select .cse18 .cse2)))))) v_arrayElimCell_84)))))) (= .cse7 .cse2))))) is different from false [2025-04-29 10:56:38,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527503513] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:38,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:56:38,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2025-04-29 10:56:38,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372084451] [2025-04-29 10:56:38,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:56:38,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 10:56:38,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:56:38,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 10:56:38,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1762, Unknown=1, NotChecked=84, Total=1980 [2025-04-29 10:56:38,005 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 41 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:56:38,631 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-04-29 10:56:38,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 10:56:38,631 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2025-04-29 10:56:38,631 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:56:38,632 INFO L225 Difference]: With dead ends: 68 [2025-04-29 10:56:38,632 INFO L226 Difference]: Without dead ends: 65 [2025-04-29 10:56:38,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=214, Invalid=2759, Unknown=1, NotChecked=106, Total=3080 [2025-04-29 10:56:38,633 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 59 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:56:38,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 266 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:56:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-29 10:56:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2025-04-29 10:56:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 10:56:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-04-29 10:56:38,641 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 38 [2025-04-29 10:56:38,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:56:38,641 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-04-29 10:56:38,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:56:38,641 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-04-29 10:56:38,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 10:56:38,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:56:38,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:38,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 10:56:38,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 10:56:38,842 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:56:38,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:56:38,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1994238603, now seen corresponding path program 2 times [2025-04-29 10:56:38,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:56:38,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014320531] [2025-04-29 10:56:38,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:38,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:56:38,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-29 10:56:38,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:56:38,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:38,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:56:40,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:56:40,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014320531] [2025-04-29 10:56:40,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014320531] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:56:40,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649015890] [2025-04-29 10:56:40,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:56:40,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:56:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:56:40,363 INFO L229 MonitoredProcess]: Starting monitored process 10 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:40,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 10:56:40,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-29 10:56:40,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 10:56:40,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:56:40,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:56:40,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 161 conjuncts are in the unsatisfiable core [2025-04-29 10:56:40,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:56:40,531 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:40,537 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:56:40,754 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 10:56:40,754 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 10:56:40,775 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:56:40,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:56:40,840 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:40,846 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:40,849 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:40,908 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 10:56:40,909 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 94 treesize of output 60 [2025-04-29 10:56:40,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-04-29 10:56:40,922 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:41,044 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 10:56:41,044 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2025-04-29 10:56:41,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:56:41,055 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-29 10:56:41,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-04-29 10:56:41,210 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:56:41,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:56:41,320 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 10:56:41,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 64 [2025-04-29 10:56:41,346 INFO L325 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-04-29 10:56:41,346 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2025-04-29 10:56:41,372 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:56:41,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-04-29 10:56:41,385 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-04-29 10:56:41,744 INFO L325 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-04-29 10:56:41,745 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 62 [2025-04-29 10:56:41,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2025-04-29 10:56:41,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2025-04-29 10:56:41,764 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 12 treesize of output 1 [2025-04-29 10:56:41,864 INFO L325 Elim1Store]: treesize reduction 150, result has 35.6 percent of original size [2025-04-29 10:56:41,864 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 161 treesize of output 142 [2025-04-29 10:56:41,922 INFO L325 Elim1Store]: treesize reduction 108, result has 44.3 percent of original size [2025-04-29 10:56:41,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 107 [2025-04-29 10:56:41,964 INFO L325 Elim1Store]: treesize reduction 95, result has 31.7 percent of original size [2025-04-29 10:56:41,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 171 [2025-04-29 10:56:41,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 46 [2025-04-29 10:56:42,018 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:42,019 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 28 treesize of output 1 [2025-04-29 10:56:42,028 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:56:42,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 23 [2025-04-29 10:56:42,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-04-29 10:57:01,816 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 3674 treesize of output 3074 Killed by 15