./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:02:41,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:02:41,677 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:02:41,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:02:41,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:02:41,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:02:41,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:02:41,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:02:41,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:02:41,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:02:41,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:02:41,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:02:41,748 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:02:41,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:02:41,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:02:41,751 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:02:41,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:02:41,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:02:41,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:02:41,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:02:41,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:02:41,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:02:41,755 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:02:41,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:02:41,756 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:02:41,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:02:41,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:02:41,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:02:41,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:41,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:02:41,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:02:41,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:02:41,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:02:41,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:02:41,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:02:41,761 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:02:41,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:02:41,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:02:41,762 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:02:41,762 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-11-06 22:02:42,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:02:42,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:02:42,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:02:42,103 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:02:42,104 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:02:42,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-06 22:02:45,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:02:45,632 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:02:45,633 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-06 22:02:45,662 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/data/bcb56384d/a6ca17dddd6c42079fda00e00060e1b8/FLAGf6a085076 [2023-11-06 22:02:45,681 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/data/bcb56384d/a6ca17dddd6c42079fda00e00060e1b8 [2023-11-06 22:02:45,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:02:45,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:02:45,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:45,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:02:45,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:02:45,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:45" (1/1) ... [2023-11-06 22:02:45,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b2a4382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:45, skipping insertion in model container [2023-11-06 22:02:45,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:45" (1/1) ... [2023-11-06 22:02:45,746 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:02:46,097 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-11-06 22:02:46,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:46,119 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:02:46,207 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-11-06 22:02:46,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:46,247 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:02:46,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46 WrapperNode [2023-11-06 22:02:46,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:46,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:46,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:02:46,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:02:46,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,331 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-11-06 22:02:46,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:46,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:02:46,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:02:46,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:02:46,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:02:46,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:02:46,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:02:46,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:02:46,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (1/1) ... [2023-11-06 22:02:46,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:46,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:46,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:02:46,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:02:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:02:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:02:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 22:02:46,482 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 22:02:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:02:46,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:02:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:02:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:02:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:02:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:02:46,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:02:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:02:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:02:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:02:46,613 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:02:46,615 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:02:46,925 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:02:46,933 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:02:46,933 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:02:46,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:46 BoogieIcfgContainer [2023-11-06 22:02:46,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:02:46,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:02:46,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:02:46,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:02:46,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:02:45" (1/3) ... [2023-11-06 22:02:46,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec687fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:46, skipping insertion in model container [2023-11-06 22:02:46,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:46" (2/3) ... [2023-11-06 22:02:46,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec687fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:46, skipping insertion in model container [2023-11-06 22:02:46,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:46" (3/3) ... [2023-11-06 22:02:46,947 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-11-06 22:02:46,965 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:02:46,965 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:02:47,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:02:47,031 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@172c8754, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:02:47,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:02:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:02:47,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:47,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:47,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:47,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2023-11-06 22:02:47,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:47,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317181588] [2023-11-06 22:02:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:47,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:02:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:47,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:47,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317181588] [2023-11-06 22:02:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317181588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:47,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:02:47,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376600790] [2023-11-06 22:02:47,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:47,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:47,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:47,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:47,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:47,504 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:02:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:47,586 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2023-11-06 22:02:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:47,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-06 22:02:47,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:47,596 INFO L225 Difference]: With dead ends: 65 [2023-11-06 22:02:47,596 INFO L226 Difference]: Without dead ends: 28 [2023-11-06 22:02:47,599 INFO L412 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 [2023-11-06 22:02:47,603 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:47,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:02:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-06 22:02:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-06 22:02:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-06 22:02:47,646 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-11-06 22:02:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:47,648 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-06 22:02:47,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:02:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-06 22:02:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:02:47,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:47,651 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:47,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:02:47,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:47,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:47,652 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2023-11-06 22:02:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:47,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131570459] [2023-11-06 22:02:47,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:47,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:47,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:47,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:02:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:02:48,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:48,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131570459] [2023-11-06 22:02:48,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131570459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:48,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:48,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:48,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649923277] [2023-11-06 22:02:48,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:48,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:48,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:48,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:48,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:48,025 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:02:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:48,110 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-11-06 22:02:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:02:48,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-06 22:02:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:48,113 INFO L225 Difference]: With dead ends: 52 [2023-11-06 22:02:48,113 INFO L226 Difference]: Without dead ends: 31 [2023-11-06 22:02:48,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:48,122 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:48,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:02:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-06 22:02:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-06 22:02:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2023-11-06 22:02:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-06 22:02:48,142 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2023-11-06 22:02:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:48,143 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-06 22:02:48,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:02:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-11-06 22:02:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:02:48,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:48,147 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:48,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:02:48,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:48,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2023-11-06 22:02:48,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:48,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226178791] [2023-11-06 22:02:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:02:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:02:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:49,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226178791] [2023-11-06 22:02:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226178791] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:49,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271926310] [2023-11-06 22:02:49,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:49,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:49,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:49,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:49,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:02:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:49,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 22:02:49,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:49,501 INFO L351 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 8 treesize of output 4 [2023-11-06 22:02:49,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:49,621 INFO L351 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 17 treesize of output 12 [2023-11-06 22:02:49,692 INFO L351 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 [2023-11-06 22:02:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:02:49,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271926310] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:49,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:02:49,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-11-06 22:02:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732764835] [2023-11-06 22:02:49,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:49,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 22:02:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:49,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:02:49,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=523, Unknown=2, NotChecked=0, Total=600 [2023-11-06 22:02:49,961 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:02:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:50,486 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-11-06 22:02:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:02:50,487 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2023-11-06 22:02:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:50,488 INFO L225 Difference]: With dead ends: 39 [2023-11-06 22:02:50,488 INFO L226 Difference]: Without dead ends: 31 [2023-11-06 22:02:50,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=849, Unknown=2, NotChecked=0, Total=992 [2023-11-06 22:02:50,490 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 68 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:50,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 186 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:02:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-06 22:02:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-06 22:02:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:02:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-06 22:02:50,499 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2023-11-06 22:02:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:50,500 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-06 22:02:50,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:02:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-06 22:02:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:02:50,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:50,502 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:50,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:50,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:50,708 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:50,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2023-11-06 22:02:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:50,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48853215] [2023-11-06 22:02:50,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:02:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:52,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:02:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:02:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48853215] [2023-11-06 22:02:52,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48853215] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:52,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831274523] [2023-11-06 22:02:52,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:52,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:02:52,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:52,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:02:52,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:02:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:52,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-06 22:02:52,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:52,872 INFO L351 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 [2023-11-06 22:02:53,137 INFO L351 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 [2023-11-06 22:02:53,374 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:02:53,375 INFO L351 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 [2023-11-06 22:02:53,518 INFO L351 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 [2023-11-06 22:02:53,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:02:54,044 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-06 22:02:54,052 INFO L351 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 7 treesize of output 3 [2023-11-06 22:02:54,061 INFO L351 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 [2023-11-06 22:02:54,069 INFO L351 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 11 treesize of output 7 [2023-11-06 22:02:54,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:54,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:02:54,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:54,375 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2023-11-06 22:02:54,397 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:02:54,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-06 22:02:54,434 INFO L322 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-06 22:02:54,434 INFO L351 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 [2023-11-06 22:02:54,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:54,905 INFO L322 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2023-11-06 22:02:54,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 70 [2023-11-06 22:02:54,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:54,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-06 22:02:54,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:54,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:54,934 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2023-11-06 22:02:54,942 INFO L351 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 [2023-11-06 22:02:55,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-06 22:02:55,032 INFO L351 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 7 treesize of output 3 [2023-11-06 22:02:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:55,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:02:55,359 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 Int) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_475)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_474) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_471) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_470) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-11-06 22:02:56,068 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 Int) (v_ArrVal_470 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| v_ArrVal_475)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_474) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_471) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_470) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2023-11-06 22:02:56,236 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| Int) (v_ArrVal_475 Int) (v_ArrVal_470 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14|) 0)) (< (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_485) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_486) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_484) .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| v_ArrVal_475)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_474) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_471) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_470) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_473) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2023-11-06 22:02:56,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831274523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:02:56,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:02:56,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 38 [2023-11-06 22:02:56,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115816101] [2023-11-06 22:02:56,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:02:56,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-06 22:02:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:56,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-06 22:02:56,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1575, Unknown=28, NotChecked=246, Total=1980 [2023-11-06 22:02:56,244 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 38 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 30 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:02:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:58,434 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-06 22:02:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:02:58,437 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 30 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2023-11-06 22:02:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:58,439 INFO L225 Difference]: With dead ends: 42 [2023-11-06 22:02:58,439 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 22:02:58,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=260, Invalid=2586, Unknown=28, NotChecked=318, Total=3192 [2023-11-06 22:02:58,442 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 55 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:58,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 303 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:02:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 22:02:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-06 22:02:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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) [2023-11-06 22:02:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-06 22:02:58,457 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 35 [2023-11-06 22:02:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:58,457 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-06 22:02:58,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 30 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:02:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-06 22:02:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:02:58,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:58,465 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:58,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:58,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-06 22:02:58,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:58,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:58,669 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2023-11-06 22:02:58,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:58,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974245176] [2023-11-06 22:02:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:58,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:01,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:03:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:03:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:03:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:03:01,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974245176] [2023-11-06 22:03:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974245176] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575470925] [2023-11-06 22:03:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:01,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:03:01,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:03:02,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:03:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:02,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 142 conjunts are in the unsatisfiable core [2023-11-06 22:03:02,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:02,372 INFO L351 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 [2023-11-06 22:03:02,593 INFO L351 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 5 treesize of output 3 [2023-11-06 22:03:02,714 INFO L351 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 [2023-11-06 22:03:02,821 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:03:02,821 INFO L351 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 [2023-11-06 22:03:02,943 INFO L351 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 [2023-11-06 22:03:02,954 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:03:03,134 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:03:03,134 INFO L351 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 59 treesize of output 52 [2023-11-06 22:03:03,148 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:03:03,508 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:03:03,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2023-11-06 22:03:03,517 INFO L351 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 [2023-11-06 22:03:03,525 INFO L351 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 11 treesize of output 7 [2023-11-06 22:03:03,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-06 22:03:03,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:03,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:03:03,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:03,912 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:03:03,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 54 [2023-11-06 22:03:03,941 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:03:03,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-06 22:03:03,986 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:03:03,986 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-06 22:03:04,853 INFO L322 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-11-06 22:03:04,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 97 [2023-11-06 22:03:04,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:04,877 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:03:04,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 97 [2023-11-06 22:03:04,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:04,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 22:03:04,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:04,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-11-06 22:03:04,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:04,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:04,925 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-11-06 22:03:04,937 INFO L351 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 18 treesize of output 11 [2023-11-06 22:03:05,132 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:03:05,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2023-11-06 22:03:05,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:05,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2023-11-06 22:03:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:05,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:05,486 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_660 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_667 Int) (v_ArrVal_664 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_666))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_667))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_660)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-11-06 22:03:05,530 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_660 Int) (v_ArrVal_663 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| Int) (v_ArrVal_667 Int) (v_ArrVal_664 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_666))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_667))) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| v_ArrVal_660)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-06 22:03:05,562 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_660 Int) (v_ArrVal_663 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| Int) (v_ArrVal_667 Int) (v_ArrVal_664 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_666))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_667))) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| v_ArrVal_660)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-11-06 22:03:05,625 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_660 Int) (v_ArrVal_663 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| Int) (v_ArrVal_667 Int) (v_ArrVal_664 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_666))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_667))) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| v_ArrVal_660)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-11-06 22:03:05,889 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:03:05,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 195 [2023-11-06 22:03:05,923 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_660 Int) (v_ArrVal_663 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| Int) (v_ArrVal_667 Int) (v_ArrVal_664 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| 1)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| v_ArrVal_677)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| v_ArrVal_678))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_666) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| (store (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| v_arrayElimArr_5) .cse0 v_ArrVal_666) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18|) 0 v_ArrVal_667)) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| v_ArrVal_660)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| v_ArrVal_664) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select .cse2 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_18| v_ArrVal_663) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2023-11-06 22:03:05,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575470925] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:05,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:03:05,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 43 [2023-11-06 22:03:05,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051840472] [2023-11-06 22:03:05,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:03:05,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-06 22:03:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:05,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-06 22:03:05,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1854, Unknown=5, NotChecked=450, Total=2450 [2023-11-06 22:03:05,932 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 43 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:09,055 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2023-11-06 22:03:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:03:09,057 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2023-11-06 22:03:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:09,059 INFO L225 Difference]: With dead ends: 61 [2023-11-06 22:03:09,059 INFO L226 Difference]: Without dead ends: 59 [2023-11-06 22:03:09,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=289, Invalid=3386, Unknown=5, NotChecked=610, Total=4290 [2023-11-06 22:03:09,063 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 77 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:09,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 377 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:03:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-06 22:03:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2023-11-06 22:03:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 22:03:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2023-11-06 22:03:09,085 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 37 [2023-11-06 22:03:09,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:09,086 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2023-11-06 22:03:09,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2023-11-06 22:03:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 22:03:09,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:09,088 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:09,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:09,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:09,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:09,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:09,297 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2023-11-06 22:03:09,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:09,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494852080] [2023-11-06 22:03:09,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:09,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:03:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:10,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:03:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:10,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:03:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:03:10,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:10,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494852080] [2023-11-06 22:03:10,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494852080] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:10,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113629682] [2023-11-06 22:03:10,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:03:10,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:10,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:03:10,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:03:10,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:03:11,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:03:11,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:03:11,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 170 conjunts are in the unsatisfiable core [2023-11-06 22:03:11,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:11,207 INFO L351 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 [2023-11-06 22:03:11,263 INFO L351 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 5 treesize of output 3 [2023-11-06 22:03:11,396 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:03:11,396 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 22:03:11,592 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:03:11,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:03:11,660 INFO L351 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 [2023-11-06 22:03:11,788 INFO L322 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-06 22:03:11,789 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-06 22:03:11,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-11-06 22:03:11,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-11-06 22:03:11,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:03:12,252 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:03:12,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 46 [2023-11-06 22:03:12,266 INFO L351 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 27 treesize of output 22 [2023-11-06 22:03:12,278 INFO L351 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 24 treesize of output 11 [2023-11-06 22:03:12,614 INFO L322 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-11-06 22:03:12,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 49 [2023-11-06 22:03:12,628 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:03:12,629 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:03:12,639 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:03:12,640 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:03:12,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:12,943 INFO L322 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-06 22:03:12,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 82 [2023-11-06 22:03:12,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:12,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:12,981 INFO L322 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-11-06 22:03:12,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 22:03:12,994 INFO L351 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 20 treesize of output 15 [2023-11-06 22:03:13,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:13,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:13,012 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 22:03:13,013 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-11-06 22:03:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:03:14,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:16,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113629682] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:16,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:03:16,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2023-11-06 22:03:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945473268] [2023-11-06 22:03:16,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:03:16,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-06 22:03:16,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-06 22:03:16,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2431, Unknown=30, NotChecked=0, Total=2652 [2023-11-06 22:03:16,423 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:18,571 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2023-11-06 22:03:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:03:18,572 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 3 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 39 [2023-11-06 22:03:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:18,573 INFO L225 Difference]: With dead ends: 60 [2023-11-06 22:03:18,573 INFO L226 Difference]: Without dead ends: 49 [2023-11-06 22:03:18,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=335, Invalid=3537, Unknown=34, NotChecked=0, Total=3906 [2023-11-06 22:03:18,576 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:18,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 207 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:03:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-06 22:03:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2023-11-06 22:03:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 22:03:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2023-11-06 22:03:18,595 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 39 [2023-11-06 22:03:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:18,596 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2023-11-06 22:03:18,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2023-11-06 22:03:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 22:03:18,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:18,598 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:18,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:18,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:18,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:18,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2023-11-06 22:03:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:18,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877493872] [2023-11-06 22:03:18,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:18,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:03:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:20,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:03:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:20,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:03:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:03:21,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877493872] [2023-11-06 22:03:21,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877493872] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:21,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555026902] [2023-11-06 22:03:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:21,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:21,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:03:21,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:03:21,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:03:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:21,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-06 22:03:21,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:21,403 INFO L351 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 [2023-11-06 22:03:21,466 INFO L351 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 5 treesize of output 3 [2023-11-06 22:03:21,649 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:03:21,650 INFO L351 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 [2023-11-06 22:03:21,837 INFO L351 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 11 treesize of output 7 [2023-11-06 22:03:21,902 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-06 22:03:21,902 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-06 22:03:22,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2023-11-06 22:03:22,175 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:03:22,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2023-11-06 22:03:22,433 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 22:03:22,433 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 26 [2023-11-06 22:03:22,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:03:22,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:22,622 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:03:22,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 62 [2023-11-06 22:03:22,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:22,633 INFO L351 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 62 treesize of output 53 [2023-11-06 22:03:22,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:22,658 INFO L322 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-06 22:03:22,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2023-11-06 22:03:23,261 INFO L322 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2023-11-06 22:03:23,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 73 [2023-11-06 22:03:23,300 INFO L322 Elim1Store]: treesize reduction 78, result has 17.0 percent of original size [2023-11-06 22:03:23,300 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 231 treesize of output 128 [2023-11-06 22:03:23,321 INFO L322 Elim1Store]: treesize reduction 106, result has 4.5 percent of original size [2023-11-06 22:03:23,321 INFO L351 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 158 [2023-11-06 22:03:23,464 INFO L351 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 121 treesize of output 93 [2023-11-06 22:03:23,752 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-06 22:03:23,752 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 38 [2023-11-06 22:03:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:03:23,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:23,781 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1043))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1046) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2023-11-06 22:03:23,804 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_27| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_27| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1043))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1046) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2023-11-06 22:03:23,820 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_27| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_27| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1043))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1046) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-11-06 22:03:23,833 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_27| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_27| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1043))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1046) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-11-06 22:03:23,930 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_27| Int) (v_ArrVal_1051 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| 1)) (not (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| v_ArrVal_1052))) (let ((.cse2 (select (select .cse3 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| v_ArrVal_1051) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_27| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| v_ArrVal_1043))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1046) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26| v_ArrVal_1044) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_26|) 0)))) is different from false [2023-11-06 22:03:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555026902] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:23,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:03:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 44 [2023-11-06 22:03:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007208867] [2023-11-06 22:03:23,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:03:23,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-06 22:03:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:23,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-06 22:03:23,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1780, Unknown=5, NotChecked=440, Total=2352 [2023-11-06 22:03:23,936 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 44 states, 40 states have (on average 1.475) internal successors, (59), 35 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:27,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:03:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:29,559 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2023-11-06 22:03:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:03:29,564 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.475) internal successors, (59), 35 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2023-11-06 22:03:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:29,565 INFO L225 Difference]: With dead ends: 65 [2023-11-06 22:03:29,565 INFO L226 Difference]: Without dead ends: 62 [2023-11-06 22:03:29,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=305, Invalid=3492, Unknown=5, NotChecked=620, Total=4422 [2023-11-06 22:03:29,567 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 105 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:29,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 380 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1074 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2023-11-06 22:03:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-06 22:03:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2023-11-06 22:03:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 22:03:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-11-06 22:03:29,603 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 40 [2023-11-06 22:03:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:29,605 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-11-06 22:03:29,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.475) internal successors, (59), 35 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-11-06 22:03:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:03:29,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:29,610 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:29,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-06 22:03:29,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:29,817 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:29,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2023-11-06 22:03:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:29,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658367707] [2023-11-06 22:03:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:03:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:32,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:03:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:32,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:03:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:03:32,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658367707] [2023-11-06 22:03:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658367707] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050251593] [2023-11-06 22:03:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:32,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:03:32,878 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:03:32,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:03:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:33,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 174 conjunts are in the unsatisfiable core [2023-11-06 22:03:33,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:33,369 INFO L351 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 [2023-11-06 22:03:33,391 INFO L351 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 [2023-11-06 22:03:33,668 INFO L351 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 7 treesize of output 3 [2023-11-06 22:03:33,672 INFO L351 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 5 treesize of output 3 [2023-11-06 22:03:33,941 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:03:33,941 INFO L351 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 [2023-11-06 22:03:33,977 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:03:34,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:03:34,121 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:03:34,138 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:03:34,401 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:03:34,402 INFO L351 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 97 treesize of output 82 [2023-11-06 22:03:34,410 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-06 22:03:34,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:03:34,792 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:03:34,793 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 42 [2023-11-06 22:03:34,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:34,802 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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 [2023-11-06 22:03:34,811 INFO L351 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 11 treesize of output 7 [2023-11-06 22:03:34,816 INFO L351 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 7 treesize of output 3 [2023-11-06 22:03:35,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-06 22:03:35,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:35,206 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:03:35,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 70 [2023-11-06 22:03:35,234 INFO L322 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-11-06 22:03:35,235 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-11-06 22:03:35,273 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:03:35,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-06 22:03:35,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:35,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:35,293 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-06 22:03:36,373 INFO L322 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-06 22:03:36,373 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 236 treesize of output 127 [2023-11-06 22:03:36,424 INFO L322 Elim1Store]: treesize reduction 78, result has 17.0 percent of original size [2023-11-06 22:03:36,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 356 treesize of output 193 [2023-11-06 22:03:36,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:36,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:36,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:36,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 72 [2023-11-06 22:03:36,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:36,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:36,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:36,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:36,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 43 [2023-11-06 22:03:36,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 41 [2023-11-06 22:03:37,197 INFO L322 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-11-06 22:03:37,198 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 68 [2023-11-06 22:03:37,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:37,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:37,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:03:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:37,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:38,016 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1238 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1238)))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_ArrVal_1233 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) v_ArrVal_1233)) (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1234)) (.cse5 (store .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1232))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse5 .cse1) .cse4))) (or (= .cse1 .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1233) .cse2) (+ 4 (select (select .cse3 .cse1) .cse4)))))))))))) (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1238 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1238)))) (or (not (= (store (select .cse9 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_ArrVal_1233 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) v_ArrVal_1233)) (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse14 (store .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1234)) (.cse10 (store .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1232))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (select (select .cse14 .cse11) .cse12))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1233) (select (select .cse10 .cse11) .cse12)) (+ 4 .cse13))) (= .cse12 .cse13))))))))))) is different from false [2023-11-06 22:03:38,164 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) .cse10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (.cse7 (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) .cse10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (.cse9 (select |c_#memory_int| .cse8))) (and (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1238 Int)) (let ((.cse0 (store |c_#memory_int| .cse8 (store .cse9 .cse10 v_ArrVal_1238)))) (or (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1234)) (.cse1 (store .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1232))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse5 .cse2) .cse3))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1233) (select (select .cse1 .cse2) .cse3)) (+ .cse4 4))) (= .cse4 .cse3)))))) (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_ArrVal_1233 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) v_ArrVal_1233))))) (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1238 Int)) (let ((.cse11 (store |c_#memory_int| .cse8 (store .cse9 .cse10 v_ArrVal_1238)))) (or (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse13 (store .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1234)) (.cse16 (store .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1232))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select (select .cse16 .cse14) .cse15))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1233) .cse12) (+ (select (select .cse13 .cse14) .cse15) 4))) (= .cse12 .cse14)))))) (not (= (store (select .cse11 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_ArrVal_1233 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) v_ArrVal_1233)))))))) is different from false [2023-11-06 22:03:38,279 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse18 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse17) .cse18)) (.cse10 (select (select |c_#memory_$Pointer$.offset| .cse17) .cse18))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) .cse10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (.cse7 (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) .cse10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (.cse9 (select |c_#memory_int| .cse8))) (and (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1238 Int)) (let ((.cse0 (store |c_#memory_int| .cse8 (store .cse9 .cse10 v_ArrVal_1238)))) (or (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1234)) (.cse5 (store .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1232))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse5 .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1233) .cse1) (+ (select (select .cse2 .cse3) .cse4) 4))) (= .cse1 .cse3)))))) (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_ArrVal_1233 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) v_ArrVal_1233))))) (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1238 Int)) (let ((.cse13 (store |c_#memory_int| .cse8 (store .cse9 .cse10 v_ArrVal_1238)))) (or (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse16 (store .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1234)) (.cse14 (store .cse6 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1232))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select (select .cse16 .cse15) .cse11))) (or (= .cse11 .cse12) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1233) (select (select .cse14 .cse15) .cse11)) (+ .cse12 4)))))))) (not (= (store (select .cse13 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_ArrVal_1233 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) v_ArrVal_1233))))))))) is different from false [2023-11-06 22:03:38,362 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse18 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse17) .cse18)) (.cse10 (select (select |c_#memory_$Pointer$.offset| .cse17) .cse18))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) .cse10 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) (.cse7 (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) .cse10 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))) (.cse9 (select |c_#memory_int| .cse8))) (and (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1238 Int)) (let ((.cse0 (store |c_#memory_int| .cse8 (store .cse9 .cse10 v_ArrVal_1238)))) (or (not (= v_ArrVal_1233 (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| (select v_ArrVal_1233 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)))) (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1234)) (.cse5 (store .cse6 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1232))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse5 .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1233) .cse1) (+ (select (select .cse2 .cse3) .cse4) 4))) (= .cse1 .cse3))))))))) (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1238 Int)) (let ((.cse11 (store |c_#memory_int| .cse8 (store .cse9 .cse10 v_ArrVal_1238)))) (or (not (= v_ArrVal_1233 (store (select .cse11 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| (select v_ArrVal_1233 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)))) (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (let ((.cse16 (store .cse7 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1234)) (.cse12 (store .cse6 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1232))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (select (select .cse16 .cse13) .cse14))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1233) (select (select .cse12 .cse13) .cse14)) (+ .cse15 4))) (= .cse15 .cse14))))))))))))) is different from false [2023-11-06 22:03:38,596 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:03:38,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1995 treesize of output 1984 [2023-11-06 22:03:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050251593] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:39,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:03:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 47 [2023-11-06 22:03:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245673061] [2023-11-06 22:03:39,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:03:39,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-06 22:03:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:39,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-06 22:03:39,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2580, Unknown=4, NotChecked=420, Total=3192 [2023-11-06 22:03:39,501 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 47 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 38 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:43,535 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2023-11-06 22:03:43,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:03:43,539 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 38 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2023-11-06 22:03:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:43,541 INFO L225 Difference]: With dead ends: 69 [2023-11-06 22:03:43,541 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 22:03:43,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=377, Invalid=4605, Unknown=4, NotChecked=564, Total=5550 [2023-11-06 22:03:43,544 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 85 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:43,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 272 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:03:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 22:03:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-11-06 22:03:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 22:03:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2023-11-06 22:03:43,566 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 41 [2023-11-06 22:03:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:43,566 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2023-11-06 22:03:43,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 38 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:03:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2023-11-06 22:03:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 22:03:43,568 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:43,570 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:43,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:43,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:43,771 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:43,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:43,771 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2023-11-06 22:03:43,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:43,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159152168] [2023-11-06 22:03:43,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:47,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:03:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:47,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:03:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:47,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:03:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:03:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159152168] [2023-11-06 22:03:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159152168] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229324888] [2023-11-06 22:03:47,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:47,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:03:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:03:47,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:03:47,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61e032c6-5070-452b-bedd-1b2b30eff96b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:03:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:47,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 131 conjunts are in the unsatisfiable core [2023-11-06 22:03:47,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:47,877 INFO L351 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 [2023-11-06 22:03:48,298 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 22:03:48,299 INFO L351 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 [2023-11-06 22:03:48,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:03:48,565 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:03:48,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:03:48,800 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:03:48,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2023-11-06 22:03:48,804 INFO L351 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 7 treesize of output 3 [2023-11-06 22:03:48,820 INFO L351 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 11 treesize of output 7 [2023-11-06 22:03:49,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:49,019 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:03:49,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:49,037 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:03:49,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2023-11-06 22:03:49,060 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:03:49,061 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-06 22:03:49,991 INFO L322 Elim1Store]: treesize reduction 262, result has 22.7 percent of original size [2023-11-06 22:03:49,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 671 treesize of output 310 [2023-11-06 22:03:50,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:50,110 INFO L322 Elim1Store]: treesize reduction 279, result has 16.7 percent of original size [2023-11-06 22:03:50,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 734 treesize of output 506 [2023-11-06 22:03:50,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:50,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:50,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:03:50,218 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 11 [2023-11-06 22:03:50,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:03:50,290 INFO L322 Elim1Store]: treesize reduction 28, result has 54.8 percent of original size [2023-11-06 22:03:50,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 125 [2023-11-06 22:03:50,306 INFO L351 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 33 treesize of output 23 [2023-11-06 22:03:50,333 INFO L351 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 25 treesize of output 23 [2023-11-06 22:04:17,006 WARN L293 SmtUtils]: Spent 22.97s on a formula simplification. DAG size of input: 1089 DAG size of output: 1001 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:04:17,007 INFO L322 Elim1Store]: treesize reduction 586, result has 91.5 percent of original size [2023-11-06 22:04:17,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 32 new quantified variables, introduced 276 case distinctions, treesize of input 6591 treesize of output 11921 [2023-11-06 22:04:19,118 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:19,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3294 treesize of output 3205 [2023-11-06 22:04:19,863 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:19,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3254 treesize of output 3186 [2023-11-06 22:04:20,306 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:20,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3238 treesize of output 3170 [2023-11-06 22:04:20,741 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:20,742 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3238 treesize of output 3141