./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/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_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:49:02,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:49:02,739 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:49:02,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:49:02,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:49:02,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:49:02,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:49:02,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:49:02,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:49:02,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:49:02,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:49:02,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:49:02,797 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:49:02,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:49:02,799 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:49:02,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:49:02,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:49:02,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:49:02,801 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:49:02,802 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:49:02,802 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:49:02,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:49:02,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:49:02,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:49:02,804 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:49:02,805 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:49:02,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:49:02,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:49:02,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:49:02,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:49:02,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:49:02,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:49:02,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:49:02,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:49:02,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:49:02,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:49:02,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:49:02,810 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:49:02,810 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_30b78095-9df7-465e-93c5-abef9fbe7ae9/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_30b78095-9df7-465e-93c5-abef9fbe7ae9/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-11-06 22:49:03,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:49:03,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:49:03,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:49:03,176 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:49:03,177 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:49:03,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-06 22:49:06,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:49:06,713 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:49:06,714 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-06 22:49:06,750 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/data/a45f0b30e/377a81d423e0443b9a13b6fd4849b074/FLAG3d66c6a65 [2023-11-06 22:49:06,766 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/data/a45f0b30e/377a81d423e0443b9a13b6fd4849b074 [2023-11-06 22:49:06,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:49:06,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:49:06,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:06,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:49:06,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:49:06,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:06" (1/1) ... [2023-11-06 22:49:06,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61106bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:06, skipping insertion in model container [2023-11-06 22:49:06,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:06" (1/1) ... [2023-11-06 22:49:06,845 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:49:07,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:07,159 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:49:07,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:07,241 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:49:07,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07 WrapperNode [2023-11-06 22:49:07,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:07,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:07,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:49:07,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:49:07,252 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:49:07" (1/1) ... [2023-11-06 22:49:07,284 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:49:07" (1/1) ... [2023-11-06 22:49:07,320 INFO L138 Inliner]: procedures = 122, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2023-11-06 22:49:07,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:07,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:49:07,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:49:07,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:49:07,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07" (1/1) ... [2023-11-06 22:49:07,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07" (1/1) ... [2023-11-06 22:49:07,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07" (1/1) ... [2023-11-06 22:49:07,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07" (1/1) ... [2023-11-06 22:49:07,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07" (1/1) ... [2023-11-06 22:49:07,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07" (1/1) ... [2023-11-06 22:49:07,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07" (1/1) ... [2023-11-06 22:49:07,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07" (1/1) ... [2023-11-06 22:49:07,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:49:07,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:49:07,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:49:07,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:49:07,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07" (1/1) ... [2023-11-06 22:49:07,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:49:07,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:07,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/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:49:07,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/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:49:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-06 22:49:07,470 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-06 22:49:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:49:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:49:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:49:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:49:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:49:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:49:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:49:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:49:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:49:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:49:07,616 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:49:07,618 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:49:07,668 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-06 22:49:07,981 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:49:07,989 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:49:07,989 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:49:07,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:07 BoogieIcfgContainer [2023-11-06 22:49:07,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:49:07,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:49:07,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:49:07,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:49:07,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:49:06" (1/3) ... [2023-11-06 22:49:07,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afe9e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:07, skipping insertion in model container [2023-11-06 22:49:07,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:07" (2/3) ... [2023-11-06 22:49:07,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afe9e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:07, skipping insertion in model container [2023-11-06 22:49:07,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:07" (3/3) ... [2023-11-06 22:49:08,001 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-11-06 22:49:08,021 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:49:08,021 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-11-06 22:49:08,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:49:08,076 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@780df4bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:49:08,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-11-06 22:49:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 71 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 22:49:08,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:08,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 22:49:08,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:08,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-11-06 22:49:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828809026] [2023-11-06 22:49:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:08,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:08,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:08,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828809026] [2023-11-06 22:49:08,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828809026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:08,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:08,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:49:08,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181009354] [2023-11-06 22:49:08,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:08,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:08,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:08,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:08,387 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 71 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:08,491 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2023-11-06 22:49:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:08,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-06 22:49:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:08,502 INFO L225 Difference]: With dead ends: 69 [2023-11-06 22:49:08,502 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 22:49:08,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:08,512 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 19 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:08,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 94 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:49:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 22:49:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-06 22:49:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.763157894736842) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2023-11-06 22:49:08,555 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 4 [2023-11-06 22:49:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:08,556 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2023-11-06 22:49:08,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2023-11-06 22:49:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 22:49:08,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:08,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 22:49:08,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:49:08,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:08,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-11-06 22:49:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908509288] [2023-11-06 22:49:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:08,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:08,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:08,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908509288] [2023-11-06 22:49:08,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908509288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:08,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:08,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:49:08,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993200672] [2023-11-06 22:49:08,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:08,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:08,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:08,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:08,691 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:08,742 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2023-11-06 22:49:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:08,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-06 22:49:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:08,744 INFO L225 Difference]: With dead ends: 60 [2023-11-06 22:49:08,744 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 22:49:08,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:08,746 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 14 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:08,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 89 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:49:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 22:49:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-06 22:49:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-11-06 22:49:08,754 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 4 [2023-11-06 22:49:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:08,755 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-11-06 22:49:08,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-11-06 22:49:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:49:08,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:08,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:08,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:49:08,757 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:08,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2023-11-06 22:49:08,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:08,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486180130] [2023-11-06 22:49:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:08,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:08,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:08,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486180130] [2023-11-06 22:49:08,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486180130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:08,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:08,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:49:08,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039766750] [2023-11-06 22:49:08,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:08,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:08,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:08,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:08,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:08,882 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:08,935 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2023-11-06 22:49:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:08,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:49:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:08,936 INFO L225 Difference]: With dead ends: 58 [2023-11-06 22:49:08,937 INFO L226 Difference]: Without dead ends: 58 [2023-11-06 22:49:08,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:08,939 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:08,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:49:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-06 22:49:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-06 22:49:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.631578947368421) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2023-11-06 22:49:08,946 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 9 [2023-11-06 22:49:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:08,947 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2023-11-06 22:49:08,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2023-11-06 22:49:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:49:08,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:08,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:08,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:49:08,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:08,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2023-11-06 22:49:08,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:08,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669550417] [2023-11-06 22:49:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:09,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:09,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669550417] [2023-11-06 22:49:09,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669550417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:09,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:09,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:49:09,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311739629] [2023-11-06 22:49:09,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:09,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:09,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:09,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:09,124 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:09,168 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2023-11-06 22:49:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:09,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:49:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:09,170 INFO L225 Difference]: With dead ends: 56 [2023-11-06 22:49:09,170 INFO L226 Difference]: Without dead ends: 56 [2023-11-06 22:49:09,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:49:09,172 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:09,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:49:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-06 22:49:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-06 22:49:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-11-06 22:49:09,180 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9 [2023-11-06 22:49:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:09,181 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-11-06 22:49:09,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-11-06 22:49:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:49:09,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:09,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:09,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:49:09,183 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:09,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2023-11-06 22:49:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:09,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879948805] [2023-11-06 22:49:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:09,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:09,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879948805] [2023-11-06 22:49:09,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879948805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:09,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:09,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:49:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554936219] [2023-11-06 22:49:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:09,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:09,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:09,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:09,298 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:09,317 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-06 22:49:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:09,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 22:49:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:09,319 INFO L225 Difference]: With dead ends: 61 [2023-11-06 22:49:09,320 INFO L226 Difference]: Without dead ends: 61 [2023-11-06 22:49:09,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:09,322 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:09,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:49:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-06 22:49:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2023-11-06 22:49:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.564102564102564) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-11-06 22:49:09,340 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 11 [2023-11-06 22:49:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:09,340 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-11-06 22:49:09,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-11-06 22:49:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:49:09,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:09,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:09,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:49:09,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:09,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:09,345 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2023-11-06 22:49:09,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:09,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793641062] [2023-11-06 22:49:09,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:09,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793641062] [2023-11-06 22:49:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793641062] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:09,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848380055] [2023-11-06 22:49:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:09,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:09,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:09,544 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:09,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:49:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:09,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:49:09,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:09,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848380055] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:49:09,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:49:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-06 22:49:09,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432188287] [2023-11-06 22:49:09,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:09,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:49:09,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:09,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:49:09,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:49:09,842 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:09,896 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-11-06 22:49:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:49:09,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:49:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:09,899 INFO L225 Difference]: With dead ends: 72 [2023-11-06 22:49:09,899 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 22:49:09,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:49:09,900 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:09,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 214 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:49:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 22:49:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-06 22:49:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2023-11-06 22:49:09,906 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 16 [2023-11-06 22:49:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:09,907 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2023-11-06 22:49:09,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2023-11-06 22:49:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:49:09,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:09,908 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:09,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:10,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:10,114 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:10,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2023-11-06 22:49:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:10,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360762397] [2023-11-06 22:49:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:49:10,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:10,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360762397] [2023-11-06 22:49:10,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360762397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:49:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399785994] [2023-11-06 22:49:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:10,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:49:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:10,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:49:10,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:49:10,349 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:10,551 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2023-11-06 22:49:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:49:10,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-06 22:49:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:10,553 INFO L225 Difference]: With dead ends: 96 [2023-11-06 22:49:10,553 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 22:49:10,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:49:10,555 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 82 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:10,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 107 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:49:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 22:49:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 69. [2023-11-06 22:49:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2023-11-06 22:49:10,578 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 31 [2023-11-06 22:49:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:10,579 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2023-11-06 22:49:10,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:10,579 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2023-11-06 22:49:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:49:10,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:10,581 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:10,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:49:10,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:10,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2023-11-06 22:49:10,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:10,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23514527] [2023-11-06 22:49:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:49:11,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:11,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23514527] [2023-11-06 22:49:11,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23514527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:11,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:11,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:49:11,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425945387] [2023-11-06 22:49:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:11,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:49:11,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:11,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:49:11,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:49:11,009 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:11,175 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-11-06 22:49:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:49:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-06 22:49:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:11,177 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:49:11,177 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:49:11,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:49:11,178 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 63 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:11,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 127 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:49:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:49:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2023-11-06 22:49:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2023-11-06 22:49:11,183 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 31 [2023-11-06 22:49:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:11,183 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2023-11-06 22:49:11,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2023-11-06 22:49:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:49:11,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:11,185 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:11,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:49:11,186 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:11,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash -453739556, now seen corresponding path program 1 times [2023-11-06 22:49:11,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:11,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903182852] [2023-11-06 22:49:11,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:11,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:49:12,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903182852] [2023-11-06 22:49:12,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903182852] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179032117] [2023-11-06 22:49:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:12,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:12,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:12,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:12,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:49:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:12,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-06 22:49:12,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:12,638 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:49:12,728 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 23 treesize of output 11 [2023-11-06 22:49:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:49:12,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:13,147 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:13,148 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2023-11-06 22:49:13,166 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:13,166 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2023-11-06 22:49:13,249 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 41 treesize of output 29 [2023-11-06 22:49:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:49:13,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179032117] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:49:13,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:49:13,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-11-06 22:49:13,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025678743] [2023-11-06 22:49:13,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:13,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 22:49:13,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:13,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:49:13,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=507, Unknown=14, NotChecked=0, Total=600 [2023-11-06 22:49:13,427 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:13,858 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-11-06 22:49:13,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:49:13,859 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-06 22:49:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:13,860 INFO L225 Difference]: With dead ends: 72 [2023-11-06 22:49:13,860 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 22:49:13,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=808, Unknown=14, NotChecked=0, Total=992 [2023-11-06 22:49:13,861 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 25 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:13,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 448 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:49:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 22:49:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-06 22:49:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2023-11-06 22:49:13,865 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 35 [2023-11-06 22:49:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:13,866 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2023-11-06 22:49:13,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2023-11-06 22:49:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:49:13,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:13,868 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:13,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:14,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 22:49:14,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:14,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2023-11-06 22:49:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:14,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425484718] [2023-11-06 22:49:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:49:15,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425484718] [2023-11-06 22:49:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425484718] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314816787] [2023-11-06 22:49:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:15,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:15,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:15,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:15,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:49:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:15,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-06 22:49:15,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:15,718 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:49:15,780 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:49:15,780 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:49:15,848 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 15 treesize of output 1 [2023-11-06 22:49:15,855 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:49:15,910 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 23 treesize of output 11 [2023-11-06 22:49:15,922 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 25 treesize of output 13 [2023-11-06 22:49:16,024 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:49:16,025 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 21 treesize of output 24 [2023-11-06 22:49:16,044 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:49:16,045 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 16 treesize of output 15 [2023-11-06 22:49:16,399 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:49:16,399 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2023-11-06 22:49:16,407 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 39 treesize of output 27 [2023-11-06 22:49:16,448 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 31 treesize of output 23 [2023-11-06 22:49:16,458 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:16,458 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2023-11-06 22:49:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:49:16,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:17,099 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_600 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_600 .cse1)) v_ArrVal_600)) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_602 Int)) (or (forall ((v_ArrVal_603 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_602)) |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_603) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_600))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1))))) (forall ((v_ArrVal_600 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_600 .cse1)) v_ArrVal_600)) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_600))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse3) (= (select |c_#valid| .cse3) 1)))))))) is different from false [2023-11-06 22:49:17,141 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:17,142 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 143 [2023-11-06 22:49:17,202 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:17,203 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-06 22:49:17,221 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:17,221 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2023-11-06 22:49:17,237 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 30 treesize of output 22 [2023-11-06 22:49:17,245 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 9 treesize of output 7 [2023-11-06 22:49:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 4 refuted. 1 times theorem prover too weak. 7 trivial. 1 not checked. [2023-11-06 22:49:17,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314816787] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:49:17,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:49:17,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2023-11-06 22:49:17,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519972898] [2023-11-06 22:49:17,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:17,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-06 22:49:17,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:17,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:49:17,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=704, Unknown=11, NotChecked=54, Total=870 [2023-11-06 22:49:17,470 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:18,655 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2023-11-06 22:49:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:49:18,656 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-06 22:49:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:18,657 INFO L225 Difference]: With dead ends: 129 [2023-11-06 22:49:18,657 INFO L226 Difference]: Without dead ends: 129 [2023-11-06 22:49:18,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=238, Invalid=1315, Unknown=11, NotChecked=76, Total=1640 [2023-11-06 22:49:18,659 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 271 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:18,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 183 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 694 Invalid, 0 Unknown, 123 Unchecked, 0.6s Time] [2023-11-06 22:49:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-06 22:49:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 77. [2023-11-06 22:49:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 76 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2023-11-06 22:49:18,663 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 37 [2023-11-06 22:49:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:18,664 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2023-11-06 22:49:18,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2023-11-06 22:49:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:49:18,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:18,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:18,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:18,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:49:18,867 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:18,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2023-11-06 22:49:18,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:18,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563012703] [2023-11-06 22:49:18,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:49:20,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563012703] [2023-11-06 22:49:20,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563012703] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807868131] [2023-11-06 22:49:20,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:20,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:20,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:20,195 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:20,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:49:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:20,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-06 22:49:20,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:20,421 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 8 treesize of output 1 [2023-11-06 22:49:20,514 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:49:20,514 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 14 treesize of output 13 [2023-11-06 22:49:20,611 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 15 treesize of output 1 [2023-11-06 22:49:20,616 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:49:20,667 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 23 treesize of output 11 [2023-11-06 22:49:20,674 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 33 treesize of output 17 [2023-11-06 22:49:20,774 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:49:20,774 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 29 treesize of output 28 [2023-11-06 22:49:20,788 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:49:20,788 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 19 treesize of output 18 [2023-11-06 22:49:21,157 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:49:21,157 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2023-11-06 22:49:21,165 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:49:21,165 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2023-11-06 22:49:21,211 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:21,212 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2023-11-06 22:49:21,222 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:21,222 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2023-11-06 22:49:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:49:21,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:49:22,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807868131] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:49:22,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:49:22,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34 [2023-11-06 22:49:22,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74435463] [2023-11-06 22:49:22,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:22,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 22:49:22,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:22,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 22:49:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:49:22,456 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:24,922 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2023-11-06 22:49:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:49:24,923 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-06 22:49:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:24,925 INFO L225 Difference]: With dead ends: 168 [2023-11-06 22:49:24,926 INFO L226 Difference]: Without dead ends: 168 [2023-11-06 22:49:24,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=413, Invalid=2779, Unknown=0, NotChecked=0, Total=3192 [2023-11-06 22:49:24,928 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 445 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:24,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 379 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:49:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-06 22:49:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 87. [2023-11-06 22:49:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.337837837837838) internal successors, (99), 86 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2023-11-06 22:49:24,934 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 37 [2023-11-06 22:49:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:24,934 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-11-06 22:49:24,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2023-11-06 22:49:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:49:24,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:24,936 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:24,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:25,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:25,142 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:25,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:25,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1642850412, now seen corresponding path program 1 times [2023-11-06 22:49:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:25,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763291033] [2023-11-06 22:49:25,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:25,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:49:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763291033] [2023-11-06 22:49:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763291033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317915461] [2023-11-06 22:49:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:27,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:27,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:27,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:27,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:49:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:27,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-06 22:49:27,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:27,859 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:49:28,027 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:49:28,048 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:49:28,050 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:49:28,063 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 15 treesize of output 1 [2023-11-06 22:49:28,152 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:49:28,153 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 28 treesize of output 31 [2023-11-06 22:49:28,157 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 26 [2023-11-06 22:49:28,174 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 23 treesize of output 11 [2023-11-06 22:49:28,314 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:49:28,315 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 31 treesize of output 30 [2023-11-06 22:49:28,335 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:49:28,335 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 19 treesize of output 18 [2023-11-06 22:49:28,346 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 27 treesize of output 15 [2023-11-06 22:49:28,800 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:49:28,800 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2023-11-06 22:49:28,818 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:49:28,819 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2023-11-06 22:49:28,837 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:49:28,837 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 43 treesize of output 46 [2023-11-06 22:49:28,980 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:28,980 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2023-11-06 22:49:28,991 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:28,991 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2023-11-06 22:49:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:49:29,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:29,780 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_963) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse0 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_961 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_963) .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_961 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1))))) is different from false [2023-11-06 22:49:29,849 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ .cse0 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_961 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_961 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) is different from false [2023-11-06 22:49:30,411 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:30,411 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 335 [2023-11-06 22:49:31,395 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:31,396 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 280 [2023-11-06 22:49:31,435 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:31,514 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse4 (not .cse3)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28))))) .cse3) (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (or (not (= v_ArrVal_961 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_963 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse4) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)))) .cse4) (forall ((v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse1)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse5 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse2)) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28))))))))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (or (not (= v_ArrVal_961 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (or (not (= v_ArrVal_961 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse3))) (or (and (forall ((v_prenex_32 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) (forall ((v_prenex_32 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_34) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_34 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_33) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_34 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))))))) .cse3) (or (and (forall ((v_prenex_20 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_prenex_20 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_20) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_29 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse6 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse6 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse6 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_prenex_29 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_29 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse7 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse7 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_29 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_prenex_29 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_29 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse8 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse8 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_20 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_20) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse3) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 .cse2)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)))))) .cse3) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (= (select .cse11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse3) (or (and (forall ((v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_27 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse12 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 .cse2)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28))))))) (forall ((v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse13 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse13 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))))) .cse3) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_25 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_25)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_23) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) is different from false [2023-11-06 22:49:32,378 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (let ((.cse5 (not .cse0)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_prenex_29 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse1 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse1 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse1 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_29 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_prenex_29 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_20 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_prenex_20 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_20) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_29 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse3 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse3 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_prenex_29 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_29 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse4 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse4 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_20 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_20) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (or (not (= v_ArrVal_961 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_ArrVal_961 0)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_963 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse5) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse6 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (= (select .cse6 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse0) (or (and (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (or (not (= v_ArrVal_961 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse0) (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (or (not (= v_ArrVal_961 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (or (and (forall ((v_prenex_32 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) (forall ((v_prenex_32 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_34) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_34 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_33) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_34 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))))))) .cse0) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_prenex_28 0)) v_prenex_28)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse5) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse2)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= (select .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_26 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) .cse0) (or .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse2)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (forall ((v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse10 (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) (forall ((v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_27 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 .cse2)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= (select .cse11 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse0) (forall ((v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse2)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 .cse2)) (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= (select .cse12 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_24) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_25 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_25)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_25) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_23) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) is different from false [2023-11-06 22:49:32,805 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (let ((.cse6 (not .cse4)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or (and (forall ((v_subst_16 Int) (v_prenex_29 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| v_subst_16 v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse0 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_29 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_16)))) (forall ((v_subst_13 Int) (v_prenex_29 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| v_subst_13 v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse2 .cse1)) (= (select v_prenex_29 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_29 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse2 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_13)))) (forall ((v_subst_15 Int) (v_prenex_29 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| v_subst_15 v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 4)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_15)))) (forall ((v_subst_14 Int) (v_prenex_20 (Array Int Int))) (or (= (select (select (store |c_#memory_int| v_subst_14 v_prenex_20) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_14))) (forall ((v_prenex_20 (Array Int Int)) (v_subst_17 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_20 .cse1)) (= (select (select (store |c_#memory_int| v_subst_17 v_prenex_20) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_17)))) .cse4) (forall ((v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (forall ((v_subst_9 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_9) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) v_subst_9 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_9) (not (= (store (select (store |c_#memory_int| v_subst_9 v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= (select .cse5 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse1))))))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse1)))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (and (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_20 Int) (v_ArrVal_961 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_20) (not (= (store (select (store |c_#memory_int| v_subst_20 v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_ArrVal_961)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) v_subst_20 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_21 Int) (v_ArrVal_961 (Array Int Int))) (or (not (= v_ArrVal_961 (store (select (store |c_#memory_int| v_subst_21 v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) v_subst_21 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse4))) (or (forall ((v_ArrVal_963 (Array Int Int)) (v_subst_12 Int) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_12) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_12) (= (select v_ArrVal_963 4) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_961 (store (select (store |c_#memory_int| v_subst_12 v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_ArrVal_961 0)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) v_subst_12 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse6) (or (forall ((v_subst_5 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_5) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) v_subst_5 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse1)) (not (= (store (select (store |c_#memory_int| v_subst_5 v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_prenex_28 0)) v_prenex_28)))) .cse6) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_10 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_10) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int))) (or (not (= v_prenex_25 (store (select (store |c_#memory_int| v_subst_10 v_prenex_24) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_25 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_25) v_subst_10 v_prenex_23) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_10))) (or .cse4 (forall ((v_subst_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) v_subst_8 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_8) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (not (= (store (select (store |c_#memory_int| v_subst_8 v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse1)) (= (select .cse7 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 4)))))) (or (and (forall ((v_prenex_32 (Array Int Int)) (v_subst_7 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_7) (not (= (store (select (store |c_#memory_int| v_subst_7 v_prenex_33) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_34 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_34)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_34) v_subst_7 v_prenex_32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_32 (Array Int Int)) (v_subst_6 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_6) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| v_subst_6 v_prenex_32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1))))) .cse4) (or .cse4 (forall ((v_subst_11 Int) (v_prenex_26 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| v_subst_11 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse1)) (= (select .cse8 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_11))))) (or .cse4 (and (forall ((v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse1)) (forall ((v_subst_19 Int)) (let ((.cse9 (select (store |c_#memory_int| v_subst_19 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse1)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_19) (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_prenex_26 (Array Int Int))) (or (forall ((v_subst_18 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) v_subst_18 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (not (= (store (select (store |c_#memory_int| v_subst_18 v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= (select .cse10 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_18)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse1)))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_22 Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) v_subst_22 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| v_subst_22 v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22)))) (forall ((v_subst_23 Int) (v_prenex_26 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| v_subst_23 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_23) (= (select .cse12 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 4) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse4)))) is different from false [2023-11-06 22:49:32,963 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:32,963 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 53 [2023-11-06 22:49:32,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:32,980 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:32,981 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2023-11-06 22:49:32,990 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:32,991 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 13 treesize of output 15 [2023-11-06 22:49:33,008 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:33,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2023-11-06 22:49:33,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 6 [2023-11-06 22:49:33,108 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:33,109 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 89 treesize of output 77 [2023-11-06 22:49:33,150 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:33,150 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 53 [2023-11-06 22:49:33,156 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:33,157 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:33,167 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:33,168 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 1 case distinctions, treesize of input 68 treesize of output 68 [2023-11-06 22:49:33,179 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:33,179 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 13 treesize of output 15 [2023-11-06 22:49:33,249 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:33,250 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 64 treesize of output 56 [2023-11-06 22:49:33,293 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,294 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2023-11-06 22:49:33,307 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,308 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-06 22:49:33,319 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,319 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 1 [2023-11-06 22:49:33,331 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,331 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-06 22:49:33,340 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,341 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 1 [2023-11-06 22:49:33,353 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,353 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2023-11-06 22:49:33,362 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,362 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-11-06 22:49:33,374 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,374 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-06 22:49:33,384 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,385 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-06 22:49:33,393 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,394 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-11-06 22:49:33,403 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,403 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-06 22:49:33,412 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,412 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-06 22:49:33,420 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,420 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-11-06 22:49:33,430 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:49:33,431 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2023-11-06 22:49:33,441 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:33,442 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2023-11-06 22:49:33,454 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:33,454 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 102 [2023-11-06 22:49:33,462 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 58 treesize of output 50 [2023-11-06 22:49:33,476 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:33,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2023-11-06 22:49:33,490 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 6 [2023-11-06 22:49:33,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 1 [2023-11-06 22:49:33,540 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 8 treesize of output 4 [2023-11-06 22:49:33,549 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:33,550 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2023-11-06 22:49:33,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:33,563 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:49:33,564 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 78 [2023-11-06 22:49:33,573 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 21 treesize of output 13 [2023-11-06 22:49:33,578 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 7 treesize of output 3 [2023-11-06 22:49:33,592 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:49:33,592 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 1 [2023-11-06 22:49:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 18 not checked. [2023-11-06 22:49:33,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317915461] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:49:33,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:49:33,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 18] total 50 [2023-11-06 22:49:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254086184] [2023-11-06 22:49:33,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:33,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 22:49:33,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:33,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 22:49:33,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1833, Unknown=11, NotChecked=450, Total=2450 [2023-11-06 22:49:33,778 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 50 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:38,951 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse11 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (let ((.cse0 (= (select (select |c_#memory_int| .cse1) 4) 1)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)) (.cse4 (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (.cse17 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0) 0)) (.cse18 (not .cse11)) (.cse13 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse6 (not .cse5)) (.cse16 (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1)) (.cse2 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse22 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse15 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse8 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse19 (= (select (select |c_#memory_int| .cse20) 4) 1)) (.cse21 (= .cse20 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (and (or (and (or (and .cse0 (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1)) .cse2) .cse3) .cse4) .cse5) (or (and .cse0 (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) 0)))) .cse3) .cse6 (or (and (forall ((v_subst_16 Int) (v_prenex_29 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| v_subst_16 v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_29 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse8)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_16)))) (forall ((v_subst_13 Int) (v_prenex_29 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| v_subst_13 v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse8)) (= (select v_prenex_29 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_29 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_13)))) (forall ((v_subst_15 Int) (v_prenex_29 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| v_subst_15 v_prenex_29) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 .cse8)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 4)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_15)))) (forall ((v_subst_14 Int) (v_prenex_20 (Array Int Int))) (or (= (select (select (store |c_#memory_int| v_subst_14 v_prenex_20) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_14))) (forall ((v_prenex_20 (Array Int Int)) (v_subst_17 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_20 .cse8)) (= (select (select (store |c_#memory_int| v_subst_17 v_prenex_20) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_17)))) .cse11) (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ .cse12 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_961 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= .cse12 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (not .cse13) (forall ((v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (forall ((v_subst_9 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_9) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) v_subst_9 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_9) (not (= (store (select (store |c_#memory_int| v_subst_9 v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 .cse8))))))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse8)))) (or .cse15 (and (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_20 Int) (v_ArrVal_961 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_20) (not (= (store (select (store |c_#memory_int| v_subst_20 v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_ArrVal_961)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) v_subst_20 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8)))) (or (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_21 Int) (v_ArrVal_961 (Array Int Int))) (or (not (= v_ArrVal_961 (store (select (store |c_#memory_int| v_subst_21 v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) v_subst_21 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse11))) .cse16 .cse17 (or (forall ((v_ArrVal_963 (Array Int Int)) (v_subst_12 Int) (v_ArrVal_956 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_12) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_12) (= (select v_ArrVal_963 4) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_961 (store (select (store |c_#memory_int| v_subst_12 v_ArrVal_956) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_ArrVal_961 0)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) v_subst_12 v_ArrVal_963) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse18) (or .cse0 .cse3) .cse4 (or (and (or (and .cse19 .cse2 (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse20))) .cse21) .cse17) .cse13) (or (forall ((v_subst_5 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_5) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) v_subst_5 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse8)) (not (= (store (select (store |c_#memory_int| v_subst_5 v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select v_prenex_28 0)) v_prenex_28)))) .cse18) (or .cse13 (and .cse22 (or (and .cse6 .cse16 .cse2) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_10 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_10) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int))) (or (not (= v_prenex_25 (store (select (store |c_#memory_int| v_subst_10 v_prenex_24) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_25 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_25) v_subst_10 v_prenex_23) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_10))) (or .cse11 (forall ((v_subst_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) v_subst_8 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_8) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (not (= (store (select (store |c_#memory_int| v_subst_8 v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse8)) (= (select .cse23 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 4)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (forall ((v_ArrVal_963 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_963) .cse24) (+ (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_961 (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_961 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) (= .cse24 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) .cse2 .cse11 (or (and (forall ((v_prenex_32 (Array Int Int)) (v_subst_7 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_7) (not (= (store (select (store |c_#memory_int| v_subst_7 v_prenex_33) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_34 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_34)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_34) v_subst_7 v_prenex_32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_32 (Array Int Int)) (v_subst_6 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_6) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| v_subst_6 v_prenex_32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8))))) .cse11) (or .cse11 (forall ((v_subst_11 Int) (v_prenex_26 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| v_subst_11 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 4)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse8)) (= (select .cse25 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse25 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_11))))) .cse22 (or .cse11 (and (forall ((v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse8)) (forall ((v_subst_19 Int)) (let ((.cse26 (select (store |c_#memory_int| v_subst_19 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse26 .cse8)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_19) (= (select .cse26 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_prenex_26 (Array Int Int))) (or (forall ((v_subst_18 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) v_subst_18 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (not (= (store (select (store |c_#memory_int| v_subst_18 v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= (select .cse27 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse27 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_18)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_26 .cse8)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4) 1) .cse15 (or (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_22 Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_28) v_subst_22 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse28 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse28 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store |c_#memory_int| v_subst_22 v_prenex_27) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_28)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22)))) (forall ((v_subst_23 Int) (v_prenex_26 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| v_subst_23 v_prenex_26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_23) (= (select .cse29 .cse8) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse29 4) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse11) (or .cse19 .cse21)))) is different from true [2023-11-06 22:49:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:41,192 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2023-11-06 22:49:41,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-06 22:49:41,193 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 50 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-06 22:49:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:41,194 INFO L225 Difference]: With dead ends: 111 [2023-11-06 22:49:41,194 INFO L226 Difference]: Without dead ends: 111 [2023-11-06 22:49:41,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=448, Invalid=3596, Unknown=12, NotChecked=774, Total=4830 [2023-11-06 22:49:41,198 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 132 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 446 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:41,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 587 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1452 Invalid, 0 Unknown, 446 Unchecked, 1.8s Time] [2023-11-06 22:49:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-06 22:49:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2023-11-06 22:49:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 86 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2023-11-06 22:49:41,202 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 41 [2023-11-06 22:49:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:41,203 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2023-11-06 22:49:41,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 50 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2023-11-06 22:49:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:49:41,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:41,204 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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:49:41,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:41,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:41,411 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:41,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1678988715, now seen corresponding path program 1 times [2023-11-06 22:49:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303133180] [2023-11-06 22:49:41,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:49:42,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:42,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303133180] [2023-11-06 22:49:42,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303133180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:42,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091472149] [2023-11-06 22:49:42,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:42,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:42,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:42,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:42,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:49:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:42,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-06 22:49:42,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:42,404 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:49:42,433 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:49:42,433 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 19 treesize of output 16 [2023-11-06 22:49:42,465 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:49:42,465 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 19 treesize of output 16 [2023-11-06 22:49:42,488 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:49:42,489 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:49:42,550 INFO L322 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-06 22:49:42,551 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 24 treesize of output 28 [2023-11-06 22:49:42,621 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 15 treesize of output 1 [2023-11-06 22:49:42,661 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 33 treesize of output 17 [2023-11-06 22:49:42,769 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 26 treesize of output 19 [2023-11-06 22:49:42,952 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 22:49:42,952 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 20 treesize of output 10 [2023-11-06 22:49:43,007 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 12 [2023-11-06 22:49:43,019 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:49:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:49:43,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:43,350 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 41 treesize of output 39 [2023-11-06 22:49:43,355 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 22 treesize of output 20 [2023-11-06 22:49:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:49:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091472149] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:49:43,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:49:43,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 34 [2023-11-06 22:49:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855407104] [2023-11-06 22:49:43,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:43,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-06 22:49:43,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:43,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-06 22:49:43,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=997, Unknown=2, NotChecked=0, Total=1122 [2023-11-06 22:49:43,724 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 34 states, 34 states have (on average 2.5) internal successors, (85), 34 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:44,579 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2023-11-06 22:49:44,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:49:44,580 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5) internal successors, (85), 34 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-11-06 22:49:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:44,581 INFO L225 Difference]: With dead ends: 85 [2023-11-06 22:49:44,581 INFO L226 Difference]: Without dead ends: 85 [2023-11-06 22:49:44,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=1544, Unknown=2, NotChecked=0, Total=1806 [2023-11-06 22:49:44,583 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 41 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:44,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 516 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:49:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-06 22:49:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2023-11-06 22:49:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 82 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2023-11-06 22:49:44,586 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 42 [2023-11-06 22:49:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:44,587 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2023-11-06 22:49:44,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5) internal successors, (85), 34 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2023-11-06 22:49:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:49:44,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:44,588 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:44,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:44,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:49:44,795 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:49:44,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:44,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2023-11-06 22:49:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:44,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491307845] [2023-11-06 22:49:44,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:49:47,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491307845] [2023-11-06 22:49:47,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491307845] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454515262] [2023-11-06 22:49:47,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:49:47,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:47,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:47,271 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:47,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30b78095-9df7-465e-93c5-abef9fbe7ae9/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:49:47,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:49:47,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:49:47,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-06 22:49:47,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:47,540 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:49:47,640 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:49:47,641 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 14 treesize of output 13 [2023-11-06 22:49:47,699 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 15 treesize of output 1 [2023-11-06 22:49:47,761 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 33 treesize of output 17 [2023-11-06 22:49:47,837 INFO L322 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-11-06 22:49:47,837 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 24 treesize of output 34 [2023-11-06 22:49:47,920 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:49:47,943 INFO L322 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-06 22:49:47,943 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 45 treesize of output 33 [2023-11-06 22:49:48,048 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:49:48,049 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 1 case distinctions, treesize of input 45 treesize of output 27 [2023-11-06 22:49:48,060 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 23 treesize of output 11 [2023-11-06 22:49:48,209 INFO L322 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-11-06 22:49:48,209 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 50 [2023-11-06 22:49:48,227 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:49:48,228 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 19 treesize of output 18 [2023-11-06 22:49:49,218 INFO L322 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-11-06 22:49:49,219 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 137 treesize of output 100 [2023-11-06 22:49:49,233 INFO L322 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2023-11-06 22:49:49,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 144 [2023-11-06 22:49:49,453 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:49,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 129 treesize of output 201 [2023-11-06 22:49:51,703 INFO L322 Elim1Store]: treesize reduction 440, result has 0.2 percent of original size [2023-11-06 22:49:51,703 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 18 new quantified variables, introduced 55 case distinctions, treesize of input 195 treesize of output 166 [2023-11-06 22:49:52,785 INFO L322 Elim1Store]: treesize reduction 56, result has 89.4 percent of original size [2023-11-06 22:49:52,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 19 new quantified variables, introduced 66 case distinctions, treesize of input 187 treesize of output 564