./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:43:47,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:43:47,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:43:47,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:43:47,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:43:47,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:43:47,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:43:47,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:43:47,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:43:47,369 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:43:47,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:43:47,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:43:47,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:43:47,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:43:47,373 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:43:47,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:43:47,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:43:47,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:43:47,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:43:47,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:43:47,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:43:47,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:43:47,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:43:47,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:43:47,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:43:47,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:43:47,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:43:47,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:43:47,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:43:47,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:43:47,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:43:47,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:43:47,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:43:47,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:43:47,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:43:47,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:43:47,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:43:47,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:43:47,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:43:47,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:43:47,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:43:47,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:43:47,387 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2024-10-11 01:43:47,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:43:47,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:43:47,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:43:47,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:43:47,690 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:43:47,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-10-11 01:43:49,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:43:49,519 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:43:49,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-10-11 01:43:49,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/563386dc5/d53197d5c9a642b0be29159c0f62bedc/FLAG04f7cf89b [2024-10-11 01:43:49,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/563386dc5/d53197d5c9a642b0be29159c0f62bedc [2024-10-11 01:43:49,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:43:49,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:43:49,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:43:49,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:43:49,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:43:49,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:49" (1/1) ... [2024-10-11 01:43:49,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45dd157d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:49, skipping insertion in model container [2024-10-11 01:43:49,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:49" (1/1) ... [2024-10-11 01:43:49,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:43:50,249 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2024-10-11 01:43:50,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:43:50,263 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:43:50,304 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2024-10-11 01:43:50,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:43:50,337 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:43:50,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50 WrapperNode [2024-10-11 01:43:50,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:43:50,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:43:50,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:43:50,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:43:50,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,393 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 174 [2024-10-11 01:43:50,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:43:50,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:43:50,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:43:50,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:43:50,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,450 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 18, 10]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-10-11 01:43:50,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:43:50,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:43:50,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:43:50,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:43:50,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (1/1) ... [2024-10-11 01:43:50,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:43:50,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:50,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:43:50,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:43:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:43:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:43:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 01:43:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:43:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:43:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 01:43:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 01:43:50,572 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 01:43:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:43:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:43:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:43:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:43:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:43:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:43:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:43:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:43:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:43:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:43:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:43:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:43:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:43:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:43:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:43:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:43:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:43:50,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:43:50,743 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:43:50,746 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:43:51,080 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-10-11 01:43:51,080 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:43:51,125 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:43:51,125 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 01:43:51,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:51 BoogieIcfgContainer [2024-10-11 01:43:51,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:43:51,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:43:51,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:43:51,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:43:51,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:43:49" (1/3) ... [2024-10-11 01:43:51,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202a7f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:51, skipping insertion in model container [2024-10-11 01:43:51,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:50" (2/3) ... [2024-10-11 01:43:51,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202a7f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:51, skipping insertion in model container [2024-10-11 01:43:51,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:51" (3/3) ... [2024-10-11 01:43:51,137 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2024-10-11 01:43:51,153 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:43:51,154 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:43:51,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:43:51,208 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68dd529e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:43:51,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:43:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 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) [2024-10-11 01:43:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 01:43:51,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:51,219 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:51,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:51,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash -143673426, now seen corresponding path program 1 times [2024-10-11 01:43:51,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:51,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413420292] [2024-10-11 01:43:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:51,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:51,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:43:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:43:51,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:51,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413420292] [2024-10-11 01:43:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413420292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:51,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:51,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:43:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623768088] [2024-10-11 01:43:51,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:51,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:43:51,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:51,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:43:51,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:43:51,627 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2024-10-11 01:43:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:51,706 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2024-10-11 01:43:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:43:51,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 19 [2024-10-11 01:43:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:51,715 INFO L225 Difference]: With dead ends: 64 [2024-10-11 01:43:51,716 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 01:43:51,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:43:51,721 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:51,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:43:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 01:43:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 01:43:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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) [2024-10-11 01:43:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-11 01:43:51,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 19 [2024-10-11 01:43:51,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:51,765 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-11 01:43:51,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2024-10-11 01:43:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-11 01:43:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 01:43:51,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:51,768 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:51,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:43:51,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:51,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1502228012, now seen corresponding path program 1 times [2024-10-11 01:43:51,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723375549] [2024-10-11 01:43:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:51,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:51,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:43:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:43:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:51,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723375549] [2024-10-11 01:43:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723375549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:51,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:43:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858579456] [2024-10-11 01:43:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:51,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:43:51,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:51,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:43:51,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:43:51,994 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-11 01:43:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:52,063 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2024-10-11 01:43:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:43:52,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 19 [2024-10-11 01:43:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:52,065 INFO L225 Difference]: With dead ends: 51 [2024-10-11 01:43:52,066 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 01:43:52,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:43:52,068 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:52,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:43:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 01:43:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 01:43:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 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) [2024-10-11 01:43:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-10-11 01:43:52,076 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2024-10-11 01:43:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:52,077 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-10-11 01:43:52,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-11 01:43:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-10-11 01:43:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 01:43:52,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:52,078 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:52,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:43:52,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:52,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1969454644, now seen corresponding path program 1 times [2024-10-11 01:43:52,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:52,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210113988] [2024-10-11 01:43:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:52,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:43:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:43:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:43:52,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:52,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210113988] [2024-10-11 01:43:52,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210113988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:52,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:52,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:43:52,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135136502] [2024-10-11 01:43:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:52,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:43:52,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:52,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:43:52,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:43:52,290 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-10-11 01:43:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:52,363 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2024-10-11 01:43:52,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:43:52,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 25 [2024-10-11 01:43:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:52,365 INFO L225 Difference]: With dead ends: 43 [2024-10-11 01:43:52,366 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 01:43:52,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:43:52,368 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:52,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:43:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 01:43:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 01:43:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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) [2024-10-11 01:43:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-10-11 01:43:52,379 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 25 [2024-10-11 01:43:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:52,380 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-10-11 01:43:52,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-10-11 01:43:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2024-10-11 01:43:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:43:52,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:52,382 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:52,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:43:52,383 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:52,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:52,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1835723964, now seen corresponding path program 1 times [2024-10-11 01:43:52,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:52,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579322391] [2024-10-11 01:43:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:54,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:54,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:43:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:43:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:43:54,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579322391] [2024-10-11 01:43:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579322391] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:54,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506117484] [2024-10-11 01:43:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:54,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:54,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:54,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:54,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:43:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:54,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-11 01:43:54,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:54,876 INFO L378 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 [2024-10-11 01:43:55,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:43:55,215 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:43:55,216 INFO L378 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 [2024-10-11 01:43:55,295 INFO L378 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 [2024-10-11 01:43:55,413 INFO L378 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 [2024-10-11 01:43:55,547 INFO L378 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 [2024-10-11 01:43:55,553 INFO L378 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 [2024-10-11 01:43:55,778 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 01:43:55,779 INFO L378 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 [2024-10-11 01:43:55,811 INFO L378 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 [2024-10-11 01:43:56,115 INFO L378 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 28 treesize of output 30 [2024-10-11 01:43:56,122 INFO L378 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 [2024-10-11 01:43:56,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 01:43:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:56,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:58,104 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (v_ArrVal_405 Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int)) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_405)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_404) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-10-11 01:44:00,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (v_ArrVal_405 Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_405)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_404) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-10-11 01:44:00,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506117484] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:00,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:00,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2024-10-11 01:44:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904059132] [2024-10-11 01:44:00,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 01:44:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:00,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 01:44:00,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1823, Unknown=15, NotChecked=174, Total=2162 [2024-10-11 01:44:00,153 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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) [2024-10-11 01:44:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:03,456 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2024-10-11 01:44:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 01:44:03,456 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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 26 [2024-10-11 01:44:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:03,457 INFO L225 Difference]: With dead ends: 56 [2024-10-11 01:44:03,457 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 01:44:03,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=284, Invalid=3248, Unknown=16, NotChecked=234, Total=3782 [2024-10-11 01:44:03,463 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:03,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 434 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 01:44:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 01:44:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2024-10-11 01:44:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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) [2024-10-11 01:44:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-10-11 01:44:03,479 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 26 [2024-10-11 01:44:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-10-11 01:44:03,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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) [2024-10-11 01:44:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-10-11 01:44:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 01:44:03,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:03,483 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:03,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:44:03,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:03,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:03,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 462823476, now seen corresponding path program 2 times [2024-10-11 01:44:03,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:03,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376544123] [2024-10-11 01:44:03,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:03,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:03,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:03,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:03,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:03,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:03,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376544123] [2024-10-11 01:44:03,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376544123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:03,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:03,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:44:03,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983932935] [2024-10-11 01:44:03,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:03,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:44:03,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:03,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:44:03,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:44:03,858 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-10-11 01:44:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:03,935 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-10-11 01:44:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:44:03,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 27 [2024-10-11 01:44:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:03,937 INFO L225 Difference]: With dead ends: 55 [2024-10-11 01:44:03,938 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 01:44:03,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:44:03,939 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:03,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 104 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:44:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 01:44:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-11 01:44:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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) [2024-10-11 01:44:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-10-11 01:44:03,951 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 27 [2024-10-11 01:44:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:03,951 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-10-11 01:44:03,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-10-11 01:44:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-10-11 01:44:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 01:44:03,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:03,952 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:03,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:44:03,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:03,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash 162755610, now seen corresponding path program 1 times [2024-10-11 01:44:03,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:03,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124285489] [2024-10-11 01:44:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:04,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124285489] [2024-10-11 01:44:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124285489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:44:04,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887056996] [2024-10-11 01:44:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:04,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:44:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:44:04,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:44:04,106 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2024-10-11 01:44:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:04,164 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-10-11 01:44:04,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:44:04,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 27 [2024-10-11 01:44:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:04,165 INFO L225 Difference]: With dead ends: 53 [2024-10-11 01:44:04,165 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 01:44:04,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:44:04,166 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:04,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:44:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 01:44:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-11 01:44:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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) [2024-10-11 01:44:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-11 01:44:04,172 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2024-10-11 01:44:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:04,173 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-11 01:44:04,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2024-10-11 01:44:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-11 01:44:04,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:44:04,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:04,174 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:04,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:44:04,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:04,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1596717782, now seen corresponding path program 1 times [2024-10-11 01:44:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:04,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874648691] [2024-10-11 01:44:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:04,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874648691] [2024-10-11 01:44:04,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874648691] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449485466] [2024-10-11 01:44:04,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:04,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:04,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:04,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:04,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:44:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 01:44:04,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:04,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:04,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449485466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:44:04,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:44:04,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-10-11 01:44:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990743030] [2024-10-11 01:44:04,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:04,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 01:44:04,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:04,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 01:44:04,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:44:04,590 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 01:44:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:04,703 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-10-11 01:44:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:44:04,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-10-11 01:44:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:04,704 INFO L225 Difference]: With dead ends: 49 [2024-10-11 01:44:04,705 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 01:44:04,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 01:44:04,705 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:04,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 139 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:44:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 01:44:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 01:44:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 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) [2024-10-11 01:44:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-10-11 01:44:04,714 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 28 [2024-10-11 01:44:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:04,714 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-10-11 01:44:04,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 01:44:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-10-11 01:44:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:44:04,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:04,715 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:04,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:44:04,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:04,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:04,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1539459480, now seen corresponding path program 1 times [2024-10-11 01:44:04,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:04,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684761083] [2024-10-11 01:44:04,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:05,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:44:05,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:05,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684761083] [2024-10-11 01:44:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684761083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:05,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852253114] [2024-10-11 01:44:05,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:05,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:05,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:05,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:05,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:44:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:05,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 01:44:05,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:05,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 01:44:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:44:05,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:44:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852253114] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:44:05,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:44:05,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 14 [2024-10-11 01:44:05,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286660696] [2024-10-11 01:44:05,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:05,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 01:44:05,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:05,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 01:44:05,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 01:44:05,508 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 01:44:09,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:44:13,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:44:17,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:44:21,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:44:25,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:44:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:25,751 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-10-11 01:44:25,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 01:44:25,753 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-10-11 01:44:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:25,753 INFO L225 Difference]: With dead ends: 49 [2024-10-11 01:44:25,754 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 01:44:25,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-10-11 01:44:25,755 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:25,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 265 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2024-10-11 01:44:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 01:44:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-11 01:44:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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) [2024-10-11 01:44:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-11 01:44:25,762 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2024-10-11 01:44:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:25,763 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-11 01:44:25,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 01:44:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-11 01:44:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:44:25,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:25,764 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:25,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:44:25,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:25,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:25,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash -152500382, now seen corresponding path program 1 times [2024-10-11 01:44:25,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:25,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732110575] [2024-10-11 01:44:25,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:25,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:26,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732110575] [2024-10-11 01:44:26,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732110575] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:26,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057113253] [2024-10-11 01:44:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:26,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:26,177 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:26,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:44:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:26,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 01:44:26,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:26,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:26,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057113253] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:44:26,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:44:26,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-10-11 01:44:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710118293] [2024-10-11 01:44:26,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:26,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 01:44:26,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:26,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 01:44:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:44:26,474 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:44:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:26,549 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-11 01:44:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:44:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-10-11 01:44:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:26,550 INFO L225 Difference]: With dead ends: 42 [2024-10-11 01:44:26,550 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 01:44:26,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:44:26,551 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:26,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:44:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 01:44:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 01:44:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2024-10-11 01:44:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-11 01:44:26,557 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2024-10-11 01:44:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:26,557 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-11 01:44:26,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:44:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-11 01:44:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:44:26,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:26,558 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 01:44:26,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 01:44:26,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 01:44:26,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:26,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -152544092, now seen corresponding path program 1 times [2024-10-11 01:44:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501088943] [2024-10-11 01:44:26,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:27,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:27,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 01:44:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:27,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:27,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501088943] [2024-10-11 01:44:27,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501088943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:27,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450465848] [2024-10-11 01:44:27,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:27,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:27,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:27,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:27,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:44:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:28,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-11 01:44:28,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:28,220 INFO L378 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 [2024-10-11 01:44:28,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 01:44:28,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:44:28,564 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 01:44:28,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 01:44:28,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:28,824 INFO L378 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 30 treesize of output 27 [2024-10-11 01:44:28,830 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-11 01:44:28,836 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-11 01:44:28,853 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-11 01:44:28,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 62 [2024-10-11 01:44:28,858 INFO L378 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 [2024-10-11 01:44:28,866 INFO L378 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 [2024-10-11 01:44:28,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-10-11 01:44:28,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-11 01:44:29,007 INFO L378 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 [2024-10-11 01:44:29,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 01:44:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:44:29,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:29,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:29,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 70 [2024-10-11 01:44:29,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:29,167 INFO L378 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 136 treesize of output 139 [2024-10-11 01:44:29,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:29,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 108 [2024-10-11 01:44:29,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-10-11 01:44:29,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:29,203 INFO L378 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 190 treesize of output 181 [2024-10-11 01:44:29,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-11 01:44:29,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse2 (= .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse15)) (.cse1 (and (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 4 v_arrayElimCell_31))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse10) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))) (or .cse2 (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) v_arrayElimCell_28) (+ 4 v_arrayElimCell_31))))) (or .cse2 (forall ((v_ArrVal_1271 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271) (+ 4 v_arrayElimCell_31))))) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse13 (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_28) (+ 4 v_arrayElimCell_31))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))))))) (.cse4 (and (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse9 v_arrayElimCell_28) .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275) v_arrayElimCell_28) .cse3))) .cse2))) (.cse6 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|))) (and (or .cse0 .cse1) (or .cse2 (forall ((v_ArrVal_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse3)))) (or .cse0 .cse4) (or (not .cse2) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))) (or .cse6 .cse1) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))) (or .cse4 .cse6))))) is different from false [2024-10-11 01:44:29,902 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (= .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse8 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (and (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275) v_arrayElimCell_28) .cse8))) .cse3) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (or (= (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_28) .cse8))))))) (.cse0 (= .cse14 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse5 (and (or .cse3 (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= (select (select (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) v_arrayElimCell_28) (+ 4 v_arrayElimCell_31)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) (or (= (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse11) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 4 v_arrayElimCell_31))))))) (or .cse3 (forall ((v_ArrVal_1271 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271) (+ 4 v_arrayElimCell_31))))) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))))) (or (= (select (select .cse12 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select .cse12 v_arrayElimCell_28) (+ 4 v_arrayElimCell_31)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (= (select (select (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)) |c_ULTIMATE.start_main_~uneq~0#1|)) (not .cse3)) (or .cse4 .cse5) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (= (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse7 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse4 .cse1) (or .cse0 .cse5) (or .cse3 (forall ((v_ArrVal_1275 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse8) |c_ULTIMATE.start_main_~uneq~0#1|))))))) is different from false [2024-10-11 01:44:30,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4)) (.cse8 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse16)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (= .cse7 .cse16)) (.cse1 (and (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse11 (let ((.cse12 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= (select (select .cse11 v_arrayElimCell_28) (+ 4 v_arrayElimCell_31)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse13 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (let ((.cse14 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse14) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ 4 v_arrayElimCell_31))))))) (or (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= (select (select (let ((.cse15 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271))) v_arrayElimCell_28) (+ 4 v_arrayElimCell_31)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse8) (or .cse8 (forall ((v_ArrVal_1271 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| .cse7 v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271) (+ 4 v_arrayElimCell_31))))))) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse2 (and (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse10 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse10 v_arrayElimCell_28) .cse6))))) (or .cse8 (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_1275) v_arrayElimCell_28) .cse6))))))) (and (or .cse0 .cse1) (or .cse0 .cse2) (or .cse3 .cse1) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse4 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 .cse6)))))) (or (forall ((v_ArrVal_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse6))) .cse8) (or .cse3 .cse2) (or (not .cse8) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse9 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (store .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))))) is different from false [2024-10-11 01:44:33,369 INFO L349 Elim1Store]: treesize reduction 204, result has 82.7 percent of original size [2024-10-11 01:44:33,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 79 case distinctions, treesize of input 2453 treesize of output 2952 [2024-10-11 01:44:35,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:35,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2276 treesize of output 3270 [2024-10-11 01:44:36,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:36,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2015 treesize of output 2000 [2024-10-11 01:44:37,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:37,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2033 treesize of output 2026 [2024-10-11 01:44:37,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2045 treesize of output 2033 [2024-10-11 01:44:38,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2047 treesize of output 2043 [2024-10-11 01:44:38,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2043 treesize of output 2041 [2024-10-11 01:44:39,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:39,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2069 treesize of output 2064 [2024-10-11 01:44:39,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:39,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2083 treesize of output 2078 [2024-10-11 01:44:40,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2097 treesize of output 2085 [2024-10-11 01:44:40,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:40,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2141 treesize of output 2126 [2024-10-11 01:44:41,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2131 treesize of output 2127 [2024-10-11 01:44:41,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:41,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2169 treesize of output 2162 [2024-10-11 01:44:42,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2181 treesize of output 2169 [2024-10-11 01:44:42,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2169 treesize of output 2167 [2024-10-11 01:44:42,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:42,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2195 treesize of output 2190 [2024-10-11 01:44:43,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2181 treesize of output 2179