./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/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_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/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_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/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 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:25,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:25,821 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 21:53:25,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:25,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:25,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:25,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:25,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:25,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:25,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:25,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:25,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:25,878 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:25,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:25,880 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:53:25,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:25,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:53:25,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:25,882 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:53:25,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:53:25,883 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:53:25,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:25,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:53:25,885 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:53:25,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:53:25,886 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:25,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:25,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:25,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:25,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:25,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:25,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:25,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:25,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:53:25,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:25,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:25,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:25,892 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:25,893 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_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/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_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2023-11-06 21:53:26,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:26,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:26,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:26,269 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:26,270 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:26,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2023-11-06 21:53:29,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:29,715 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:29,715 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2023-11-06 21:53:29,729 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/data/73272e062/7fea5d9a88794e458ce812bc87c820bb/FLAG5e10aff21 [2023-11-06 21:53:29,752 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/data/73272e062/7fea5d9a88794e458ce812bc87c820bb [2023-11-06 21:53:29,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:29,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:29,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:29,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:29,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:29,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69826f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29, skipping insertion in model container [2023-11-06 21:53:29,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,831 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:30,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:30,240 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:30,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:30,357 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:30,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30 WrapperNode [2023-11-06 21:53:30,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:30,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:30,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:30,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:30,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,446 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 155 [2023-11-06 21:53:30,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:30,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:30,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:30,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:30,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:30,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:30,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:30,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:30,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:30,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:30,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:30,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:53:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:53:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 21:53:30,635 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 21:53:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:53:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:53:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:53:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:53:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:53:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 21:53:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:53:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:30,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:30,819 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:30,821 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:31,494 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:31,502 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:31,502 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 21:53:31,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:31 BoogieIcfgContainer [2023-11-06 21:53:31,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:31,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:31,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:31,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:31,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:29" (1/3) ... [2023-11-06 21:53:31,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ce8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:31, skipping insertion in model container [2023-11-06 21:53:31,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (2/3) ... [2023-11-06 21:53:31,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ce8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:31, skipping insertion in model container [2023-11-06 21:53:31,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:31" (3/3) ... [2023-11-06 21:53:31,515 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2023-11-06 21:53:31,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:31,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-11-06 21:53:31,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:31,611 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;@4d5eb7de, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:31,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-11-06 21:53:31,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 137 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:31,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 21:53:31,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:31,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 21:53:31,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:31,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash 895949618, now seen corresponding path program 1 times [2023-11-06 21:53:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905467340] [2023-11-06 21:53:31,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,909 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 21:53:31,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905467340] [2023-11-06 21:53:31,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905467340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:53:31,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312312740] [2023-11-06 21:53:31,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:53:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:31,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:31,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:31,966 INFO L87 Difference]: Start difference. First operand has 142 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 137 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:32,149 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2023-11-06 21:53:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:32,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 21:53:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:32,165 INFO L225 Difference]: With dead ends: 138 [2023-11-06 21:53:32,166 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 21:53:32,169 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 21:53:32,174 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:32,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 213 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:53:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 21:53:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-06 21:53:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 130 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2023-11-06 21:53:32,226 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 6 [2023-11-06 21:53:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:32,227 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2023-11-06 21:53:32,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2023-11-06 21:53:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 21:53:32,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:32,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 21:53:32,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:53:32,229 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:32,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash 895949619, now seen corresponding path program 1 times [2023-11-06 21:53:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:32,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101961976] [2023-11-06 21:53:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,367 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 21:53:32,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:32,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101961976] [2023-11-06 21:53:32,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101961976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:32,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:32,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:53:32,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286659559] [2023-11-06 21:53:32,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:32,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:53:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:32,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:32,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:32,372 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:32,565 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2023-11-06 21:53:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:32,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 21:53:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:32,572 INFO L225 Difference]: With dead ends: 132 [2023-11-06 21:53:32,572 INFO L226 Difference]: Without dead ends: 132 [2023-11-06 21:53:32,576 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 21:53:32,577 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:32,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 215 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:53:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-06 21:53:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-11-06 21:53:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 70 states have (on average 1.9285714285714286) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2023-11-06 21:53:32,597 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2023-11-06 21:53:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:32,597 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2023-11-06 21:53:32,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2023-11-06 21:53:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 21:53:32,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:32,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:32,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:53:32,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:32,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1271068585, now seen corresponding path program 1 times [2023-11-06 21:53:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190751673] [2023-11-06 21:53:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,791 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 21:53:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:32,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190751673] [2023-11-06 21:53:32,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190751673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:32,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:32,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:32,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943567673] [2023-11-06 21:53:32,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:32,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:53:32,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:32,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:32,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:32,795 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:53:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:32,970 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2023-11-06 21:53:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:53:32,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-06 21:53:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:32,972 INFO L225 Difference]: With dead ends: 143 [2023-11-06 21:53:32,972 INFO L226 Difference]: Without dead ends: 143 [2023-11-06 21:53:32,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:32,974 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 10 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:32,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 319 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:53:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-06 21:53:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2023-11-06 21:53:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 128 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2023-11-06 21:53:32,988 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 14 [2023-11-06 21:53:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:32,988 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2023-11-06 21:53:32,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 21:53:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2023-11-06 21:53:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 21:53:32,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:32,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:32,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:53:32,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:32,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash -29197696, now seen corresponding path program 1 times [2023-11-06 21:53:32,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:32,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010099145] [2023-11-06 21:53:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:32,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:53:33,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:33,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010099145] [2023-11-06 21:53:33,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010099145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:33,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:33,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:53:33,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783194532] [2023-11-06 21:53:33,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:33,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:53:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:53:33,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:53:33,379 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 21:53:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:33,737 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2023-11-06 21:53:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-06 21:53:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:33,739 INFO L225 Difference]: With dead ends: 132 [2023-11-06 21:53:33,739 INFO L226 Difference]: Without dead ends: 132 [2023-11-06 21:53:33,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:53:33,741 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:33,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 448 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:53:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-06 21:53:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-11-06 21:53:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2023-11-06 21:53:33,752 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 24 [2023-11-06 21:53:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:33,753 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2023-11-06 21:53:33,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 21:53:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2023-11-06 21:53:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 21:53:33,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:33,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:33,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:53:33,755 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:33,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash -29197695, now seen corresponding path program 1 times [2023-11-06 21:53:33,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:33,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165321330] [2023-11-06 21:53:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:33,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:53:34,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:34,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165321330] [2023-11-06 21:53:34,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165321330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:34,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:34,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:53:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161361128] [2023-11-06 21:53:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:34,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:53:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:53:34,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:53:34,104 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 21:53:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:34,458 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2023-11-06 21:53:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:34,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-06 21:53:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:34,460 INFO L225 Difference]: With dead ends: 131 [2023-11-06 21:53:34,460 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 21:53:34,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:53:34,462 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:34,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 472 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:53:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 21:53:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-11-06 21:53:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 71 states have (on average 1.8873239436619718) internal successors, (134), 126 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2023-11-06 21:53:34,471 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 24 [2023-11-06 21:53:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:34,471 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2023-11-06 21:53:34,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 21:53:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2023-11-06 21:53:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 21:53:34,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:34,473 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:34,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:53:34,474 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:34,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:34,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2005784929, now seen corresponding path program 1 times [2023-11-06 21:53:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703812388] [2023-11-06 21:53:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:53:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:34,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703812388] [2023-11-06 21:53:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703812388] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:34,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278616373] [2023-11-06 21:53:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:34,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:34,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:34,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:34,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:53:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:35,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 21:53:35,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:35,169 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 21:53:35,244 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 21:53:35,365 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 21:53:35,365 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 21:53:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-06 21:53:35,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:35,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278616373] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:35,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:53:35,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-11-06 21:53:35,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461521941] [2023-11-06 21:53:35,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:53:35,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:53:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:35,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:53:35,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-11-06 21:53:35,469 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:53:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:35,986 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2023-11-06 21:53:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:35,987 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-11-06 21:53:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:35,988 INFO L225 Difference]: With dead ends: 138 [2023-11-06 21:53:35,988 INFO L226 Difference]: Without dead ends: 138 [2023-11-06 21:53:35,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-06 21:53:35,989 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 8 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:35,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 517 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 439 Invalid, 0 Unknown, 142 Unchecked, 0.4s Time] [2023-11-06 21:53:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-06 21:53:35,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2023-11-06 21:53:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 21:53:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2023-11-06 21:53:35,997 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 26 [2023-11-06 21:53:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:35,997 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2023-11-06 21:53:35,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:53:35,998 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2023-11-06 21:53:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 21:53:35,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:35,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:36,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 21:53:36,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:36,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:36,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:36,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2005784930, now seen corresponding path program 1 times [2023-11-06 21:53:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067009789] [2023-11-06 21:53:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:36,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:36,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:53:36,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:36,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067009789] [2023-11-06 21:53:36,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067009789] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:36,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476676140] [2023-11-06 21:53:36,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:36,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:36,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:36,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:36,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:53:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:36,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-06 21:53:36,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:36,952 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 21:53:37,291 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 21:53:37,291 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 21:53:37,311 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 21:53:37,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 21:53:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:37,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:37,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476676140] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:37,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:53:37,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2023-11-06 21:53:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139001855] [2023-11-06 21:53:37,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:53:37,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 21:53:37,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:37,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 21:53:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2023-11-06 21:53:37,580 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 21:53:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:38,338 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2023-11-06 21:53:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:53:38,339 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-11-06 21:53:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:38,340 INFO L225 Difference]: With dead ends: 138 [2023-11-06 21:53:38,340 INFO L226 Difference]: Without dead ends: 138 [2023-11-06 21:53:38,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2023-11-06 21:53:38,341 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 15 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:38,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 838 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:53:38,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-06 21:53:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2023-11-06 21:53:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 21:53:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2023-11-06 21:53:38,348 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 26 [2023-11-06 21:53:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:38,348 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2023-11-06 21:53:38,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 21:53:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2023-11-06 21:53:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 21:53:38,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:38,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:38,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:38,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:38,561 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:38,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash -880845001, now seen corresponding path program 1 times [2023-11-06 21:53:38,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:38,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826930190] [2023-11-06 21:53:38,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:38,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:53:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826930190] [2023-11-06 21:53:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826930190] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:38,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045090715] [2023-11-06 21:53:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:38,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:38,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:53:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 21:53:38,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:53:38,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:53:39,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045090715] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:53:39,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:53:39,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-06 21:53:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093776162] [2023-11-06 21:53:39,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:53:39,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:53:39,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:39,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:53:39,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:53:39,016 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:53:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:39,181 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2023-11-06 21:53:39,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:39,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-06 21:53:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:39,183 INFO L225 Difference]: With dead ends: 137 [2023-11-06 21:53:39,183 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 21:53:39,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:53:39,184 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 4 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:39,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 675 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:53:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 21:53:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2023-11-06 21:53:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.84) internal successors, (138), 130 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 21:53:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2023-11-06 21:53:39,189 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 28 [2023-11-06 21:53:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:39,190 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2023-11-06 21:53:39,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:53:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2023-11-06 21:53:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 21:53:39,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:39,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:39,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 21:53:39,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:39,398 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:39,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1541171918, now seen corresponding path program 1 times [2023-11-06 21:53:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962800375] [2023-11-06 21:53:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 21:53:39,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:39,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962800375] [2023-11-06 21:53:39,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962800375] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:39,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403056984] [2023-11-06 21:53:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:39,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:39,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:39,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:39,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 21:53:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:39,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 21:53:39,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 21:53:39,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:39,732 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 21:53:39,733 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 12 treesize of output 11 [2023-11-06 21:53:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 21:53:39,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403056984] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:53:39,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:53:39,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-11-06 21:53:39,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844680197] [2023-11-06 21:53:39,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:53:39,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:53:39,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:53:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:53:39,757 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:53:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:40,018 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2023-11-06 21:53:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:40,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-06 21:53:40,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:40,021 INFO L225 Difference]: With dead ends: 141 [2023-11-06 21:53:40,021 INFO L226 Difference]: Without dead ends: 141 [2023-11-06 21:53:40,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:53:40,022 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 9 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:40,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 443 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:53:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-06 21:53:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2023-11-06 21:53:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 133 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 21:53:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2023-11-06 21:53:40,029 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 29 [2023-11-06 21:53:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:40,030 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2023-11-06 21:53:40,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:53:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2023-11-06 21:53:40,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 21:53:40,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:40,033 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:40,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-06 21:53:40,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 21:53:40,240 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:40,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1541171917, now seen corresponding path program 1 times [2023-11-06 21:53:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:40,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101818254] [2023-11-06 21:53:40,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:40,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:53:40,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:40,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101818254] [2023-11-06 21:53:40,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101818254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483109163] [2023-11-06 21:53:40,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:40,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:40,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:40,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:40,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 21:53:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 21:53:40,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:53:40,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:40,882 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:53:40,883 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 19 treesize of output 23 [2023-11-06 21:53:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:53:41,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483109163] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:53:41,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:53:41,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-06 21:53:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364672391] [2023-11-06 21:53:41,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:53:41,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 21:53:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:41,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 21:53:41,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:53:41,080 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 21:53:41,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:41,524 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2023-11-06 21:53:41,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:53:41,525 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-11-06 21:53:41,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:41,526 INFO L225 Difference]: With dead ends: 145 [2023-11-06 21:53:41,526 INFO L226 Difference]: Without dead ends: 145 [2023-11-06 21:53:41,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:53:41,528 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 17 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:41,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1232 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:53:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-06 21:53:41,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2023-11-06 21:53:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 133 states have internal predecessors, (142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 21:53:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2023-11-06 21:53:41,533 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 29 [2023-11-06 21:53:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:41,533 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2023-11-06 21:53:41,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 21:53:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2023-11-06 21:53:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 21:53:41,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:41,534 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:41,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:41,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 21:53:41,735 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:41,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash -531689197, now seen corresponding path program 1 times [2023-11-06 21:53:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:41,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673171045] [2023-11-06 21:53:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:53:41,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:41,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673171045] [2023-11-06 21:53:41,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673171045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:41,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:41,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:53:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452156891] [2023-11-06 21:53:41,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:41,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:53:41,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:41,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:53:41,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:53:41,913 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 21:53:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:42,295 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2023-11-06 21:53:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:53:42,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-06 21:53:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:42,296 INFO L225 Difference]: With dead ends: 139 [2023-11-06 21:53:42,297 INFO L226 Difference]: Without dead ends: 139 [2023-11-06 21:53:42,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:53:42,298 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 12 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:42,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 503 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:53:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-06 21:53:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2023-11-06 21:53:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 78 states have (on average 1.8076923076923077) internal successors, (141), 132 states have internal predecessors, (141), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 21:53:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2023-11-06 21:53:42,306 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 30 [2023-11-06 21:53:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:42,307 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2023-11-06 21:53:42,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 21:53:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2023-11-06 21:53:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 21:53:42,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:42,309 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:42,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:53:42,309 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:42,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -531689196, now seen corresponding path program 1 times [2023-11-06 21:53:42,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:42,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948428935] [2023-11-06 21:53:42,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:42,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:53:42,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:42,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948428935] [2023-11-06 21:53:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948428935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:42,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:42,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:53:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529585818] [2023-11-06 21:53:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:42,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:53:42,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:42,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:53:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:53:42,734 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 21:53:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:43,119 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2023-11-06 21:53:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:53:43,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-06 21:53:43,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:43,121 INFO L225 Difference]: With dead ends: 137 [2023-11-06 21:53:43,121 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 21:53:43,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:53:43,122 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 13 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:43,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 657 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:53:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 21:53:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2023-11-06 21:53:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 78 states have (on average 1.794871794871795) internal successors, (140), 131 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 21:53:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2023-11-06 21:53:43,127 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 30 [2023-11-06 21:53:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:43,128 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2023-11-06 21:53:43,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 21:53:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2023-11-06 21:53:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 21:53:43,129 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:43,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:43,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:53:43,129 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:43,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1880683964, now seen corresponding path program 1 times [2023-11-06 21:53:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:43,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464116346] [2023-11-06 21:53:43,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:43,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 21:53:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 21:53:43,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:43,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464116346] [2023-11-06 21:53:43,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464116346] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:43,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956786476] [2023-11-06 21:53:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:43,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:43,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:43,355 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:43,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 21:53:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:53:43,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 21:53:43,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:53:43,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956786476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:43,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:53:43,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-06 21:53:43,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250709254] [2023-11-06 21:53:43,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:43,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:53:43,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:43,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:43,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:53:43,598 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:53:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:43,616 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2023-11-06 21:53:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:53:43,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-11-06 21:53:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:43,618 INFO L225 Difference]: With dead ends: 125 [2023-11-06 21:53:43,618 INFO L226 Difference]: Without dead ends: 125 [2023-11-06 21:53:43,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:53:43,619 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:43,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 251 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-06 21:53:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-06 21:53:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 120 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2023-11-06 21:53:43,625 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 41 [2023-11-06 21:53:43,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:43,625 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2023-11-06 21:53:43,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:53:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2023-11-06 21:53:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 21:53:43,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:43,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:43,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-06 21:53:43,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 21:53:43,833 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:43,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash -837194340, now seen corresponding path program 1 times [2023-11-06 21:53:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194621000] [2023-11-06 21:53:43,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 21:53:44,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:44,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194621000] [2023-11-06 21:53:44,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194621000] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:44,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376489361] [2023-11-06 21:53:44,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:44,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:44,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:44,633 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:44,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 21:53:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 21:53:44,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:44,934 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 21:53:44,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:53:44,978 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-06 21:53:45,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:53:45,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 21:53:45,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:53:45,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:53:45,146 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 21:53:45,175 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-06 21:53:45,218 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 21:53:45,218 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 21:53:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2023-11-06 21:53:45,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:45,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376489361] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:45,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:53:45,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2023-11-06 21:53:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988688848] [2023-11-06 21:53:45,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:53:45,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:53:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:45,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:53:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2023-11-06 21:53:45,483 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 21:53:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:46,042 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2023-11-06 21:53:46,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:53:46,043 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2023-11-06 21:53:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:46,045 INFO L225 Difference]: With dead ends: 135 [2023-11-06 21:53:46,045 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 21:53:46,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=162, Unknown=2, NotChecked=54, Total=272 [2023-11-06 21:53:46,046 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 237 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:46,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 372 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 451 Invalid, 0 Unknown, 272 Unchecked, 0.5s Time] [2023-11-06 21:53:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 21:53:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2023-11-06 21:53:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 112 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2023-11-06 21:53:46,052 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 43 [2023-11-06 21:53:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:46,052 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2023-11-06 21:53:46,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 21:53:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2023-11-06 21:53:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 21:53:46,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:46,054 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:46,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:46,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 21:53:46,255 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:46,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash -837194339, now seen corresponding path program 1 times [2023-11-06 21:53:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:46,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384545281] [2023-11-06 21:53:46,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:46,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 21:53:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384545281] [2023-11-06 21:53:47,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384545281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548154513] [2023-11-06 21:53:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:47,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:47,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:47,151 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:47,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 21:53:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 21:53:47,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:47,426 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 21:53:47,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:53:47,480 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-06 21:53:47,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:53:47,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 21:53:47,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 5 treesize of output 3 [2023-11-06 21:53:47,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:53:47,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 21:53:47,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:53:47,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:53:47,821 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 21:53:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 21:53:47,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:53:47,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548154513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:47,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:53:47,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2023-11-06 21:53:47,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370447066] [2023-11-06 21:53:47,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:47,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:53:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:47,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:53:47,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2023-11-06 21:53:47,849 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:53:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:48,114 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2023-11-06 21:53:48,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:48,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2023-11-06 21:53:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:48,116 INFO L225 Difference]: With dead ends: 112 [2023-11-06 21:53:48,116 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 21:53:48,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2023-11-06 21:53:48,118 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 32 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:48,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 305 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 151 Unchecked, 0.2s Time] [2023-11-06 21:53:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 21:53:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-06 21:53:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.591549295774648) internal successors, (113), 107 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2023-11-06 21:53:48,123 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 43 [2023-11-06 21:53:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:48,124 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2023-11-06 21:53:48,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:53:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2023-11-06 21:53:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 21:53:48,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:48,126 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:48,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:48,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 21:53:48,338 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:48,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 18522841, now seen corresponding path program 1 times [2023-11-06 21:53:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:48,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483075801] [2023-11-06 21:53:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:48,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 21:53:48,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:48,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483075801] [2023-11-06 21:53:48,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483075801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:48,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:48,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:53:48,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464889086] [2023-11-06 21:53:48,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:48,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:53:48,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:48,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:53:48,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:53:48,612 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 21:53:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:48,879 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-11-06 21:53:48,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:48,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2023-11-06 21:53:48,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:48,880 INFO L225 Difference]: With dead ends: 108 [2023-11-06 21:53:48,881 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 21:53:48,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:53:48,881 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 27 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:48,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 354 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:53:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 21:53:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-06 21:53:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 103 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2023-11-06 21:53:48,886 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 46 [2023-11-06 21:53:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:48,886 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2023-11-06 21:53:48,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 21:53:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2023-11-06 21:53:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 21:53:48,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:48,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:48,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 21:53:48,888 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:48,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:48,888 INFO L85 PathProgramCache]: Analyzing trace with hash 18522842, now seen corresponding path program 1 times [2023-11-06 21:53:48,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:48,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085083729] [2023-11-06 21:53:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:49,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:49,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:49,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 21:53:49,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:49,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085083729] [2023-11-06 21:53:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085083729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:49,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:49,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:53:49,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832703215] [2023-11-06 21:53:49,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:49,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:53:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:53:49,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:53:49,290 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 21:53:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:49,582 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2023-11-06 21:53:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:49,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2023-11-06 21:53:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:49,584 INFO L225 Difference]: With dead ends: 104 [2023-11-06 21:53:49,584 INFO L226 Difference]: Without dead ends: 104 [2023-11-06 21:53:49,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:53:49,585 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 22 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:49,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 366 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:53:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-06 21:53:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-06 21:53:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 99 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2023-11-06 21:53:49,590 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 46 [2023-11-06 21:53:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:49,591 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2023-11-06 21:53:49,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 21:53:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2023-11-06 21:53:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 21:53:49,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:49,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:49,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 21:53:49,593 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:49,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash 18533764, now seen corresponding path program 1 times [2023-11-06 21:53:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276132043] [2023-11-06 21:53:49,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 21:53:50,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:50,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276132043] [2023-11-06 21:53:50,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276132043] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216587456] [2023-11-06 21:53:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:50,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:50,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:50,744 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:50,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 21:53:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-06 21:53:51,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:51,152 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 21:53:51,443 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 9 treesize of output 5 [2023-11-06 21:53:51,615 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-11-06 21:53:51,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:53:51,651 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 18 treesize of output 13 [2023-11-06 21:53:51,665 INFO L322 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-06 21:53:51,665 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 16 treesize of output 18 [2023-11-06 21:53:51,778 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 17 treesize of output 9 [2023-11-06 21:53:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-06 21:53:51,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:53,882 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_49| Int) (v_ArrVal_2371 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_49| 1)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_49| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_49| v_ArrVal_2371) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) 1))) is different from false [2023-11-06 21:53:53,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216587456] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:53,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:53:53,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-11-06 21:53:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085477681] [2023-11-06 21:53:53,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:53:53,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 21:53:53,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:53,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 21:53:53,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=573, Unknown=2, NotChecked=98, Total=756 [2023-11-06 21:53:53,887 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 21:53:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:54,876 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2023-11-06 21:53:54,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 21:53:54,876 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-11-06 21:53:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:54,877 INFO L225 Difference]: With dead ends: 121 [2023-11-06 21:53:54,878 INFO L226 Difference]: Without dead ends: 121 [2023-11-06 21:53:54,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=155, Invalid=973, Unknown=2, NotChecked=130, Total=1260 [2023-11-06 21:53:54,879 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 303 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:54,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 554 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 792 Invalid, 0 Unknown, 126 Unchecked, 0.7s Time] [2023-11-06 21:53:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-06 21:53:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2023-11-06 21:53:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 98 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:53:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2023-11-06 21:53:54,884 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 46 [2023-11-06 21:53:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:54,884 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2023-11-06 21:53:54,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 21:53:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2023-11-06 21:53:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 21:53:54,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:54,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:54,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:55,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 21:53:55,086 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:53:55,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:55,086 INFO L85 PathProgramCache]: Analyzing trace with hash 18533765, now seen corresponding path program 1 times [2023-11-06 21:53:55,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:55,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898464253] [2023-11-06 21:53:55,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:55,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:53:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:56,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:53:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898464253] [2023-11-06 21:53:57,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898464253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095482343] [2023-11-06 21:53:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:57,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:53:57,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:57,350 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:53:57,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 21:53:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:57,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-06 21:53:57,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:57,747 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 21:53:58,209 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 19 treesize of output 11 [2023-11-06 21:53:58,216 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 21:53:58,375 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 21:53:58,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:53:58,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:53:58,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:53:58,447 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 20 [2023-11-06 21:53:58,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:53:58,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 21:53:58,470 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 21:53:58,471 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 15 treesize of output 15 [2023-11-06 21:53:58,544 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 17 treesize of output 9 [2023-11-06 21:53:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-06 21:53:58,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:53:58,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095482343] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:53:58,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:53:58,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2023-11-06 21:53:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400577839] [2023-11-06 21:53:58,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:53:58,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 21:53:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 21:53:59,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=720, Unknown=1, NotChecked=54, Total=870 [2023-11-06 21:53:59,002 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 27 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 23 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 21:54:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:00,781 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2023-11-06 21:54:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:54:00,782 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 23 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-11-06 21:54:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:00,783 INFO L225 Difference]: With dead ends: 102 [2023-11-06 21:54:00,783 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 21:54:00,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=158, Invalid=1105, Unknown=1, NotChecked=68, Total=1332 [2023-11-06 21:54:00,785 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 98 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:00,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 767 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1035 Invalid, 0 Unknown, 106 Unchecked, 1.4s Time] [2023-11-06 21:54:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 21:54:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-06 21:54:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 97 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:54:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2023-11-06 21:54:00,790 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 46 [2023-11-06 21:54:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:00,791 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2023-11-06 21:54:00,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 23 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 21:54:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2023-11-06 21:54:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-06 21:54:00,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:00,792 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:00,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:01,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:01,000 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:54:01,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2058168226, now seen corresponding path program 1 times [2023-11-06 21:54:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:01,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505173874] [2023-11-06 21:54:01,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:54:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:01,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:54:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:01,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 21:54:01,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:01,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505173874] [2023-11-06 21:54:01,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505173874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:01,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:01,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524257916] [2023-11-06 21:54:01,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:01,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:54:01,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:01,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:54:01,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:01,363 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:54:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:01,595 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2023-11-06 21:54:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:01,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2023-11-06 21:54:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:01,597 INFO L225 Difference]: With dead ends: 99 [2023-11-06 21:54:01,597 INFO L226 Difference]: Without dead ends: 99 [2023-11-06 21:54:01,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:01,598 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 165 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:01,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 235 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:54:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-06 21:54:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-06 21:54:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.408450704225352) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:54:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2023-11-06 21:54:01,602 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 49 [2023-11-06 21:54:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:01,603 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2023-11-06 21:54:01,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:54:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2023-11-06 21:54:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 21:54:01,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:01,604 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:01,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 21:54:01,604 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:54:01,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:01,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2080257246, now seen corresponding path program 1 times [2023-11-06 21:54:01,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:01,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898470855] [2023-11-06 21:54:01,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:01,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:02,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:54:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:02,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:54:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:54:02,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:02,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898470855] [2023-11-06 21:54:02,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898470855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:02,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055474912] [2023-11-06 21:54:02,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:02,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:02,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:02,428 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:54:02,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 21:54:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:02,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 21:54:02,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:03,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-06 21:54:03,250 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-06 21:54:03,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:03,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 21:54:03,322 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 21:54:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-06 21:54:03,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:03,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055474912] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:03,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:54:03,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-11-06 21:54:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82209020] [2023-11-06 21:54:03,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:03,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 21:54:03,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:03,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 21:54:03,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=4, NotChecked=50, Total=756 [2023-11-06 21:54:03,496 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 21:54:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:04,228 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2023-11-06 21:54:04,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:54:04,229 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-11-06 21:54:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:04,230 INFO L225 Difference]: With dead ends: 96 [2023-11-06 21:54:04,230 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 21:54:04,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=4, NotChecked=62, Total=1122 [2023-11-06 21:54:04,232 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 257 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:04,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 859 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 502 Invalid, 0 Unknown, 99 Unchecked, 0.5s Time] [2023-11-06 21:54:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 21:54:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-06 21:54:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.411764705882353) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:54:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2023-11-06 21:54:04,238 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 51 [2023-11-06 21:54:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:04,239 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2023-11-06 21:54:04,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 21:54:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2023-11-06 21:54:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-06 21:54:04,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:04,240 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:04,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:04,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:04,454 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:54:04,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash 692995273, now seen corresponding path program 1 times [2023-11-06 21:54:04,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:04,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462931391] [2023-11-06 21:54:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:04,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:54:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:04,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:54:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:04,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 21:54:04,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462931391] [2023-11-06 21:54:04,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462931391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:04,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:04,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:54:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771168928] [2023-11-06 21:54:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:04,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:54:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:04,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:54:04,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:04,675 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 21:54:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:04,894 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2023-11-06 21:54:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:54:04,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2023-11-06 21:54:04,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:04,896 INFO L225 Difference]: With dead ends: 95 [2023-11-06 21:54:04,896 INFO L226 Difference]: Without dead ends: 95 [2023-11-06 21:54:04,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:54:04,897 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 9 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:04,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 373 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:54:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-06 21:54:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-06 21:54:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:54:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2023-11-06 21:54:04,903 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 52 [2023-11-06 21:54:04,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:04,903 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2023-11-06 21:54:04,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 21:54:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2023-11-06 21:54:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-06 21:54:04,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:04,905 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:04,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 21:54:04,905 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:54:04,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash 692995274, now seen corresponding path program 1 times [2023-11-06 21:54:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:04,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172185898] [2023-11-06 21:54:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:05,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:54:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:54:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:05,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:54:06,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:06,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172185898] [2023-11-06 21:54:06,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172185898] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:06,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394061155] [2023-11-06 21:54:06,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:06,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:06,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:06,025 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:54:06,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 21:54:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:06,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 21:54:06,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:06,553 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 23 treesize of output 15 [2023-11-06 21:54:06,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-06 21:54:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 21:54:06,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:06,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394061155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:06,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:54:06,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2023-11-06 21:54:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948797714] [2023-11-06 21:54:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:06,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:06,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2023-11-06 21:54:06,639 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 21:54:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:06,872 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2023-11-06 21:54:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:54:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2023-11-06 21:54:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:06,874 INFO L225 Difference]: With dead ends: 94 [2023-11-06 21:54:06,874 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 21:54:06,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2023-11-06 21:54:06,875 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:06,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 346 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:54:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 21:54:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-06 21:54:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:54:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2023-11-06 21:54:06,880 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 52 [2023-11-06 21:54:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:06,880 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2023-11-06 21:54:06,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 21:54:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2023-11-06 21:54:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 21:54:06,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:06,881 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:06,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:07,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-06 21:54:07,082 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:54:07,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash 8017033, now seen corresponding path program 1 times [2023-11-06 21:54:07,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:07,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332419228] [2023-11-06 21:54:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:07,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:54:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:08,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:54:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:08,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:54:09,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:09,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332419228] [2023-11-06 21:54:09,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332419228] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:09,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280649060] [2023-11-06 21:54:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:09,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:09,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:09,542 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:54:09,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 21:54:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:09,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-06 21:54:09,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:09,999 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 21:54:10,476 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 21:54:10,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:10,691 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 14 [2023-11-06 21:54:10,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 21:54:10,934 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-11-06 21:54:11,022 INFO L322 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2023-11-06 21:54:11,022 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 34 treesize of output 57 [2023-11-06 21:54:11,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:11,045 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 21:54:11,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 42 [2023-11-06 21:54:11,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:11,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:54:11,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 21:54:11,414 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:11,414 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2023-11-06 21:54:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-06 21:54:11,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:11,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280649060] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:11,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:54:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2023-11-06 21:54:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732054117] [2023-11-06 21:54:11,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:11,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-06 21:54:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-06 21:54:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1739, Unknown=1, NotChecked=84, Total=1980 [2023-11-06 21:54:11,991 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 42 states, 39 states have (on average 2.230769230769231) internal successors, (87), 38 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:54:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:14,067 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2023-11-06 21:54:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 21:54:14,068 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.230769230769231) internal successors, (87), 38 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-11-06 21:54:14,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:14,069 INFO L225 Difference]: With dead ends: 93 [2023-11-06 21:54:14,069 INFO L226 Difference]: Without dead ends: 93 [2023-11-06 21:54:14,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=318, Invalid=2991, Unknown=1, NotChecked=112, Total=3422 [2023-11-06 21:54:14,071 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 188 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:14,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1014 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1172 Invalid, 0 Unknown, 96 Unchecked, 1.3s Time] [2023-11-06 21:54:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-06 21:54:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-06 21:54:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 88 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:54:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2023-11-06 21:54:14,075 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 53 [2023-11-06 21:54:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:14,075 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2023-11-06 21:54:14,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.230769230769231) internal successors, (87), 38 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:54:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2023-11-06 21:54:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 21:54:14,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:14,076 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:14,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:14,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:14,283 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:54:14,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:14,284 INFO L85 PathProgramCache]: Analyzing trace with hash 8017034, now seen corresponding path program 1 times [2023-11-06 21:54:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:14,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542650193] [2023-11-06 21:54:14,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:14,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:54:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:16,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:54:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:16,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:54:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:17,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542650193] [2023-11-06 21:54:17,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542650193] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:17,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496487609] [2023-11-06 21:54:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:17,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:17,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:17,565 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:54:17,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 21:54:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:17,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-06 21:54:17,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:17,997 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 21:54:18,550 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 21:54:18,550 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 21:54:18,576 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:54:18,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 21:54:19,164 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 21:54:19,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 21:54:19,490 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:19,491 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2023-11-06 21:54:19,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:54:19,503 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 5 treesize of output 3 [2023-11-06 21:54:19,512 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:19,512 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 15 treesize of output 7 [2023-11-06 21:54:19,759 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 21:54:19,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:19,826 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 21:54:19,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 54 [2023-11-06 21:54:19,849 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 21:54:19,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-06 21:54:19,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:19,860 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 21:54:19,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2023-11-06 21:54:19,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-06 21:54:20,099 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:20,100 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-11-06 21:54:20,105 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:20,106 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 15 treesize of output 7 [2023-11-06 21:54:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-06 21:54:20,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:20,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496487609] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:20,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:54:20,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 49 [2023-11-06 21:54:20,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189917285] [2023-11-06 21:54:20,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:20,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 21:54:20,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:20,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 21:54:20,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2684, Unknown=1, NotChecked=104, Total=2970 [2023-11-06 21:54:20,780 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 50 states, 45 states have (on average 2.066666666666667) internal successors, (93), 43 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:54:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:23,520 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2023-11-06 21:54:23,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 21:54:23,521 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 2.066666666666667) internal successors, (93), 43 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-11-06 21:54:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:23,522 INFO L225 Difference]: With dead ends: 92 [2023-11-06 21:54:23,523 INFO L226 Difference]: Without dead ends: 92 [2023-11-06 21:54:23,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=370, Invalid=4463, Unknown=1, NotChecked=136, Total=4970 [2023-11-06 21:54:23,525 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 132 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:23,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1063 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1562 Invalid, 0 Unknown, 95 Unchecked, 1.4s Time] [2023-11-06 21:54:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-06 21:54:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-06 21:54:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:54:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2023-11-06 21:54:23,529 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 53 [2023-11-06 21:54:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:23,530 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2023-11-06 21:54:23,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 2.066666666666667) internal successors, (93), 43 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:54:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2023-11-06 21:54:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 21:54:23,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:23,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:23,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-06 21:54:23,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:23,738 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:54:23,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:23,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1967278510, now seen corresponding path program 1 times [2023-11-06 21:54:23,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:23,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154486629] [2023-11-06 21:54:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:23,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:54:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:54:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:54:25,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:25,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154486629] [2023-11-06 21:54:25,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154486629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:25,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:25,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-11-06 21:54:25,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692422936] [2023-11-06 21:54:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:25,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 21:54:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:25,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 21:54:25,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2023-11-06 21:54:25,282 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:54:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:26,503 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2023-11-06 21:54:26,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 21:54:26,504 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-11-06 21:54:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:26,507 INFO L225 Difference]: With dead ends: 111 [2023-11-06 21:54:26,507 INFO L226 Difference]: Without dead ends: 111 [2023-11-06 21:54:26,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2023-11-06 21:54:26,508 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 264 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:26,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 617 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:54:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-06 21:54:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2023-11-06 21:54:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:54:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-11-06 21:54:26,512 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 59 [2023-11-06 21:54:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:26,512 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-11-06 21:54:26,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:54:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-11-06 21:54:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 21:54:26,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:26,514 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:26,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 21:54:26,514 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:54:26,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1967278511, now seen corresponding path program 1 times [2023-11-06 21:54:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:26,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725683582] [2023-11-06 21:54:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:54:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:54:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:54:29,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:29,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725683582] [2023-11-06 21:54:29,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725683582] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:29,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130658743] [2023-11-06 21:54:29,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:29,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:29,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:29,531 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:54:29,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 21:54:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-06 21:54:29,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:30,374 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 9 treesize of output 5 [2023-11-06 21:54:30,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:30,695 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 18 treesize of output 13 [2023-11-06 21:54:31,224 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 21:54:31,231 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 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-06 21:54:31,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:31,345 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:54:31,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:31,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:54:31,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:31,383 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:54:31,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:31,390 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:54:31,504 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-06 21:54:31,504 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 34 treesize of output 25 [2023-11-06 21:54:31,528 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-06 21:54:31,528 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 21:54:31,697 INFO L322 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-06 21:54:31,697 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 68 treesize of output 68 [2023-11-06 21:54:31,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:31,721 INFO L322 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2023-11-06 21:54:31,721 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 2 case distinctions, treesize of input 50 treesize of output 44 [2023-11-06 21:54:31,732 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 21:54:31,742 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 21:54:31,856 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 32 treesize of output 20 [2023-11-06 21:54:31,861 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 26 treesize of output 14 [2023-11-06 21:54:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:54:31,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:31,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130658743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:31,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:54:31,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [31] total 52 [2023-11-06 21:54:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542388957] [2023-11-06 21:54:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:31,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 21:54:31,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 21:54:31,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2587, Unknown=0, NotChecked=0, Total=2756 [2023-11-06 21:54:31,990 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:54:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:33,485 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2023-11-06 21:54:33,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 21:54:33,485 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-11-06 21:54:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:33,486 INFO L225 Difference]: With dead ends: 91 [2023-11-06 21:54:33,486 INFO L226 Difference]: Without dead ends: 91 [2023-11-06 21:54:33,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=296, Invalid=3994, Unknown=0, NotChecked=0, Total=4290 [2023-11-06 21:54:33,489 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 211 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:33,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 702 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 21:54:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-06 21:54:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-11-06 21:54:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:54:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-11-06 21:54:33,493 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 59 [2023-11-06 21:54:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:33,494 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-11-06 21:54:33,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 21:54:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-11-06 21:54:33,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 21:54:33,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:33,495 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:33,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:33,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:33,702 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:54:33,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash 313194049, now seen corresponding path program 1 times [2023-11-06 21:54:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532259423] [2023-11-06 21:54:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:33,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:54:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:54:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:54:40,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:40,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532259423] [2023-11-06 21:54:40,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532259423] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:40,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518046621] [2023-11-06 21:54:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:40,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:40,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:40,085 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:54:40,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 21:54:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:40,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 153 conjunts are in the unsatisfiable core [2023-11-06 21:54:40,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:40,561 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 21:54:40,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:54:40,889 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:54:40,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 21:54:41,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:54:41,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:41,367 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:54:41,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-11-06 21:54:42,023 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 21:54:42,477 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:42,478 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2023-11-06 21:54:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:42,486 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 21:54:42,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 21:54:42,858 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 13 treesize of output 9 [2023-11-06 21:54:43,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:43,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:54:43,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:43,227 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 21:54:43,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2023-11-06 21:54:43,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:43,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:43,253 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 21:54:43,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 21:54:45,152 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-06 21:54:45,162 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:45,163 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 87 treesize of output 45 [2023-11-06 21:54:45,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:45,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 21:54:45,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:45,418 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 25 treesize of output 13 [2023-11-06 21:54:45,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:45,430 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 16 treesize of output 11 [2023-11-06 21:54:45,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:45,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:45,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2023-11-06 21:54:45,697 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 18 treesize of output 13 [2023-11-06 21:54:45,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:45,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:54:45,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:45,724 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2023-11-06 21:54:45,729 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 18 treesize of output 12 [2023-11-06 21:54:45,938 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 19 treesize of output 18 [2023-11-06 21:54:45,953 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 18 treesize of output 13 [2023-11-06 21:54:45,967 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 16 treesize of output 11 [2023-11-06 21:54:46,206 INFO L322 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-06 21:54:46,206 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 101 [2023-11-06 21:54:46,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:46,215 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 70 treesize of output 51 [2023-11-06 21:54:46,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:46,223 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 53 treesize of output 17 [2023-11-06 21:54:46,502 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 0 case distinctions, treesize of input 49 treesize of output 25 [2023-11-06 21:54:46,508 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 22 treesize of output 10 [2023-11-06 21:54:46,690 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 15 treesize of output 7 [2023-11-06 21:54:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:54:46,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:46,903 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4862) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4864) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_4862 (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 (select v_ArrVal_4862 .cse0))))))) is different from false [2023-11-06 21:54:46,921 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4861 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4860))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4862) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4861) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4864) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_4862 (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_4862 .cse1)))))))) is different from false [2023-11-06 21:54:46,944 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4861 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4856 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4857 (Array Int Int)) (v_ArrVal_4858 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4857) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4860))) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_4862 .cse1))) v_ArrVal_4862)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4862) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4856))) (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4858) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4861) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4864) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2023-11-06 21:54:50,018 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int) (v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4861 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4853 (Array Int Int)) (v_ArrVal_4854 (Array Int Int)) (v_ArrVal_4856 (Array Int Int)) (v_ArrVal_4857 (Array Int Int)) (v_ArrVal_4858 (Array Int Int)) (v_ArrVal_4849 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_25| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4849)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (< |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_25|) (not (= v_ArrVal_4853 (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_25| (select v_ArrVal_4853 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_25|)))) (< |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_25| 0) (not (= (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_25| 4))) (store (select (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4853) .cse1 v_ArrVal_4857) .cse2 v_ArrVal_4860) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse3 (select v_ArrVal_4862 .cse3))) v_ArrVal_4862)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store .cse0 .cse1 v_ArrVal_4857) .cse2 v_ArrVal_4860) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4862) (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))) (store (store .cse4 .cse1 v_ArrVal_4856) .cse2 (store (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4854) .cse1 v_ArrVal_4856) .cse2) |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_25|)) .cse1 v_ArrVal_4858) .cse2 v_ArrVal_4861) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4864) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))))) is different from false [2023-11-06 21:54:50,364 INFO L322 Elim1Store]: treesize reduction 337, result has 51.0 percent of original size [2023-11-06 21:54:50,365 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39814 treesize of output 38826 [2023-11-06 21:54:50,502 INFO L322 Elim1Store]: treesize reduction 126, result has 51.9 percent of original size [2023-11-06 21:54:50,503 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2432 treesize of output 2442 [2023-11-06 21:54:50,620 INFO L322 Elim1Store]: treesize reduction 126, result has 51.9 percent of original size [2023-11-06 21:54:50,621 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2307 treesize of output 2192 [2023-11-06 21:54:50,738 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:50,739 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 543 treesize of output 545 [2023-11-06 21:54:50,878 INFO L322 Elim1Store]: treesize reduction 308, result has 39.6 percent of original size [2023-11-06 21:54:50,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 2086 treesize of output 2217 [2023-11-06 21:54:51,070 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 62 treesize of output 4 [2023-11-06 21:54:51,771 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:51,771 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 136 treesize of output 138 [2023-11-06 21:54:51,925 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:51,926 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 136 treesize of output 138 [2023-11-06 21:54:53,172 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:53,173 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:53,198 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:53,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 3200 treesize of output 3210 [2023-11-06 21:54:53,461 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:53,462 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:53,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-11-06 21:54:53,660 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:53,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:53,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-11-06 21:54:53,711 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:53,712 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:53,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-11-06 21:54:54,353 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:54,354 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 1149 treesize of output 1151 [2023-11-06 21:54:54,697 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 12 treesize of output 8 [2023-11-06 21:54:54,824 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:54,825 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1149 treesize of output 1087 [2023-11-06 21:54:54,939 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 12 treesize of output 8 [2023-11-06 21:54:54,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-06 21:54:55,003 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:55,004 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 554 treesize of output 556 [2023-11-06 21:54:55,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:55,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 494 treesize of output 432 [2023-11-06 21:54:55,085 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:54:55,104 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:55,104 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 1296 treesize of output 1296 [2023-11-06 21:54:55,493 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:55,494 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 223 treesize of output 223 [2023-11-06 21:54:56,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518046621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:56,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:54:56,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 69 [2023-11-06 21:54:56,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209116416] [2023-11-06 21:54:56,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:56,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-06 21:54:56,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:56,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-06 21:54:56,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=5905, Unknown=32, NotChecked=628, Total=6806 [2023-11-06 21:54:56,420 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 69 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:55:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:05,572 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2023-11-06 21:55:05,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 21:55:05,572 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2023-11-06 21:55:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:05,573 INFO L225 Difference]: With dead ends: 105 [2023-11-06 21:55:05,573 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 21:55:05,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2136 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=570, Invalid=10334, Unknown=32, NotChecked=836, Total=11772 [2023-11-06 21:55:05,579 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 217 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 3010 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:05,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1433 Invalid, 3042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3010 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-06 21:55:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 21:55:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2023-11-06 21:55:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:55:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2023-11-06 21:55:05,583 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 63 [2023-11-06 21:55:05,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:05,583 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2023-11-06 21:55:05,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:55:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2023-11-06 21:55:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 21:55:05,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:05,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:05,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 21:55:05,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:05,792 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:55:05,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:05,792 INFO L85 PathProgramCache]: Analyzing trace with hash 313174131, now seen corresponding path program 1 times [2023-11-06 21:55:05,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:05,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69850360] [2023-11-06 21:55:05,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:05,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:09,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:55:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:55:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:09,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 21:55:10,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:10,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69850360] [2023-11-06 21:55:10,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69850360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:10,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:10,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2023-11-06 21:55:10,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534388244] [2023-11-06 21:55:10,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:10,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 21:55:10,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:10,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 21:55:10,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2023-11-06 21:55:10,302 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 33 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:55:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:12,819 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2023-11-06 21:55:12,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 21:55:12,819 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2023-11-06 21:55:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:12,820 INFO L225 Difference]: With dead ends: 111 [2023-11-06 21:55:12,821 INFO L226 Difference]: Without dead ends: 111 [2023-11-06 21:55:12,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=256, Invalid=2606, Unknown=0, NotChecked=0, Total=2862 [2023-11-06 21:55:12,823 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 233 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:12,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 615 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:55:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-06 21:55:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2023-11-06 21:55:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:55:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-11-06 21:55:12,827 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 63 [2023-11-06 21:55:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:12,827 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-11-06 21:55:12,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:55:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-11-06 21:55:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 21:55:12,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:12,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:12,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 21:55:12,829 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:55:12,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash 313174132, now seen corresponding path program 1 times [2023-11-06 21:55:12,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:12,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350561305] [2023-11-06 21:55:12,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:16,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:55:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:55:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:55:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350561305] [2023-11-06 21:55:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350561305] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301732285] [2023-11-06 21:55:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:18,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:18,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:18,300 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:55:18,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 21:55:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 153 conjunts are in the unsatisfiable core [2023-11-06 21:55:18,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:19,116 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 21:55:19,899 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 21:55:19,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 15 treesize of output 1 [2023-11-06 21:55:20,320 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:20,321 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 36 [2023-11-06 21:55:20,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:55:20,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:20,335 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 21:55:20,344 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 21:55:20,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:55:20,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:20,811 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 21:55:20,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 60 [2023-11-06 21:55:20,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:20,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:20,831 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 21:55:20,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 33 [2023-11-06 21:55:20,858 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 21:55:20,858 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 18 treesize of output 21 [2023-11-06 21:55:20,892 INFO L322 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2023-11-06 21:55:20,893 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2023-11-06 21:55:22,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:22,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-11-06 21:55:22,371 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:22,372 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 92 treesize of output 54 [2023-11-06 21:55:22,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:22,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:22,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 21:55:22,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:22,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:22,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 21:55:22,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:22,854 INFO L322 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-11-06 21:55:22,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 76 [2023-11-06 21:55:22,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:55:22,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:22,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:22,876 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2023-11-06 21:55:23,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:23,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:23,045 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-11-06 21:55:23,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:23,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:23,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-06 21:55:23,227 INFO L322 Elim1Store]: treesize reduction 63, result has 10.0 percent of original size [2023-11-06 21:55:23,227 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 2 case distinctions, treesize of input 143 treesize of output 92 [2023-11-06 21:55:23,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:23,242 INFO L322 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-06 21:55:23,243 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 83 [2023-11-06 21:55:23,962 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 21:55:23,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 50 [2023-11-06 21:55:23,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:23,973 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 21:55:23,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-11-06 21:55:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:55:24,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:55:26,788 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|)))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (and (forall ((v_ArrVal_5366 Int)) (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse1 .cse2 v_ArrVal_5366)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3) 8))) (forall ((v_ArrVal_5366 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse1 .cse2 v_ArrVal_5366)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse4) .cse3) 12) (select |c_#length| (select (select .cse5 .cse4) .cse3)))))))))) is different from false [2023-11-06 21:55:26,851 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5366 Int)) (<= 0 (+ (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362))) (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))))) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 v_ArrVal_5366))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 8))) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5366 Int)) (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362))) (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|)))) (.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363))) (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 v_ArrVal_5366))))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse4 .cse5) .cse6) 12) (select |c_#length| (select (select .cse7 .cse5) .cse6)))))))) is different from false [2023-11-06 21:55:26,874 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (<= 0 (+ 8 (let ((.cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362))) (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))))) (select (select .cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 v_ArrVal_5366))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (let ((.cse4 (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362))) (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|)))) (.cse7 (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363))) (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 v_ArrVal_5366))))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse4 .cse5) .cse6)) (select |c_#length| (select (select .cse7 .cse5) .cse6)))))))) is different from false [2023-11-06 21:55:26,903 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|))) (.cse5 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) (.cse3 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse5 v_ArrVal_5366)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (<= 0 (+ 8 (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|)))) (select (select .cse7 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse5 v_ArrVal_5366)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-11-06 21:55:26,935 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (<= 0 (+ (let ((.cse3 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))))) (select (select .cse0 (select (select (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_ArrVal_5366)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 8))) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (let ((.cse10 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse6 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|)))) (.cse9 (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse10 v_ArrVal_5366)))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse6 .cse7) .cse8) 12) (select |c_#length| (select (select .cse9 .cse7) .cse8)))))))))) is different from false [2023-11-06 21:55:26,974 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (<= 0 (+ 8 (let ((.cse3 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))))) (select (select .cse0 (select (select (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 v_ArrVal_5366)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (let ((.cse10 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse6 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|)))) (.cse9 (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse10 v_ArrVal_5366)))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse6 .cse7) .cse8)) (select |c_#length| (select (select .cse9 .cse7) .cse8)))))))))) is different from false [2023-11-06 21:55:27,026 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (.cse9 (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse5 (select .cse14 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse8 .cse5 v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse9)) .cse5 v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|)))) (.cse3 (store (store (store .cse4 .cse5 v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse6 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse5)) .cse5 v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse7 v_ArrVal_5366)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 12) (select |c_#length| (select (select .cse3 .cse1) .cse2))))))) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (<= 0 (+ (let ((.cse12 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse13 .cse5 v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse9)) .cse5 v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse12 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))))) (select (select .cse11 (select (select (store (store (store .cse4 .cse5 v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse6 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse5)) .cse5 v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse12 v_ArrVal_5366)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 8))))))) is different from false [2023-11-06 21:55:27,071 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (.cse9 (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse5 (select .cse14 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse8 .cse5 v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse9)) .cse5 v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.offset|)))) (.cse3 (store (store (store .cse4 .cse5 v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse6 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse5)) .cse5 v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse7 v_ArrVal_5366)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2))))))) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (<= 0 (+ 8 (let ((.cse12 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse13 .cse5 v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse9)) .cse5 v_ArrVal_5360) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse12 |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.offset|))))) (select (select .cse11 (select (select (store (store (store .cse4 .cse5 v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse6 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse5)) .cse5 v_ArrVal_5361) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse12 v_ArrVal_5366)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))))) is different from false [2023-11-06 21:55:29,109 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse16 (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4)) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse17 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (let ((.cse7 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (.cse10 (select .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse5 (select .cse17 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) .cse16)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) .cse16))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (let ((.cse8 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse9 .cse5 v_ArrVal_5360) .cse6 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse10)) .cse5 v_ArrVal_5360) .cse6 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse8 .cse11)))) (.cse3 (store (store (store .cse4 .cse5 v_ArrVal_5361) .cse6 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse7 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse5)) .cse5 v_ArrVal_5361) .cse6 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse8 v_ArrVal_5366)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 12) (select |c_#length| (select (select .cse3 .cse1) .cse2))))))) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (<= 0 (+ (let ((.cse14 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse15 .cse5 v_ArrVal_5360) .cse6 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse15 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse10)) .cse5 v_ArrVal_5360) .cse6 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse14 .cse11))))) (select (select .cse13 (select (select (store (store (store .cse4 .cse5 v_ArrVal_5361) .cse6 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse7 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse5)) .cse5 v_ArrVal_5361) .cse6 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse14 v_ArrVal_5366)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 8))))))) is different from false [2023-11-06 21:55:29,181 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse17 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse5 (select .cse17 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse16 (+ .cse10 4)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse17 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (let ((.cse7 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) .cse16)) (.cse11 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse16))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (let ((.cse8 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse9 .cse5 v_ArrVal_5360) .cse6 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse10)) .cse5 v_ArrVal_5360) .cse6 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse8 .cse11)))) (.cse3 (store (store (store .cse4 .cse5 v_ArrVal_5361) .cse6 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse7 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse5)) .cse5 v_ArrVal_5361) .cse6 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse8 v_ArrVal_5366)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 12) (select |c_#length| (select (select .cse3 .cse1) .cse2))))))) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (<= 0 (+ (let ((.cse14 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse15 .cse5 v_ArrVal_5360) .cse6 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse15 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse10)) .cse5 v_ArrVal_5360) .cse6 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse14 .cse11))))) (select (select .cse13 (select (select (store (store (store .cse4 .cse5 v_ArrVal_5361) .cse6 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store .cse7 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse5)) .cse5 v_ArrVal_5361) .cse6 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse14 v_ArrVal_5366)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 8)))))))) is different from false [2023-11-06 21:55:29,301 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse17 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse17 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse16 (+ .cse7 4)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse17 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse16)) (.cse8 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse16))) (and (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (<= 0 (+ (let ((.cse5 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse6 .cse2 v_ArrVal_5360) .cse3 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse7)) .cse2 v_ArrVal_5360) .cse3 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse5 .cse8))))) (select (select .cse0 (select (select (store (store (store .cse1 .cse2 v_ArrVal_5361) .cse3 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store .cse4 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse2 v_ArrVal_5361) .cse3 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse5 v_ArrVal_5366)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 8))) (forall ((v_ArrVal_5363 (Array Int Int)) (v_ArrVal_5362 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5366 Int) (v_ArrVal_5361 (Array Int Int)) (v_ArrVal_5360 (Array Int Int))) (let ((.cse14 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse10 (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse15 .cse2 v_ArrVal_5360) .cse3 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store .cse15 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse7)) .cse2 v_ArrVal_5360) .cse3 v_ArrVal_5362) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse14 .cse8)))) (.cse13 (store (store (store .cse1 .cse2 v_ArrVal_5361) .cse3 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store .cse4 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse2)) .cse2 v_ArrVal_5361) .cse3 v_ArrVal_5363) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse14 v_ArrVal_5366)))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse10 .cse11) .cse12) 12) (select |c_#length| (select (select .cse13 .cse11) .cse12)))))))))))) is different from false [2023-11-06 21:55:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301732285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:30,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:55:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36] total 67 [2023-11-06 21:55:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173468834] [2023-11-06 21:55:30,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:55:30,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-06 21:55:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:30,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-06 21:55:30,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=5175, Unknown=11, NotChecked=1694, Total=7140 [2023-11-06 21:55:30,682 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 68 states, 63 states have (on average 1.7936507936507937) internal successors, (113), 61 states have internal predecessors, (113), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:55:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:39,471 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2023-11-06 21:55:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-06 21:55:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 63 states have (on average 1.7936507936507937) internal successors, (113), 61 states have internal predecessors, (113), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2023-11-06 21:55:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:39,473 INFO L225 Difference]: With dead ends: 113 [2023-11-06 21:55:39,473 INFO L226 Difference]: Without dead ends: 113 [2023-11-06 21:55:39,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2799 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=605, Invalid=10348, Unknown=11, NotChecked=2376, Total=13340 [2023-11-06 21:55:39,475 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 343 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:39,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1184 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-06 21:55:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-06 21:55:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2023-11-06 21:55:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.267605633802817) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:55:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-11-06 21:55:39,479 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 63 [2023-11-06 21:55:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:39,479 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-11-06 21:55:39,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 63 states have (on average 1.7936507936507937) internal successors, (113), 61 states have internal predecessors, (113), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:55:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-11-06 21:55:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 21:55:39,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:39,481 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:39,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 21:55:39,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:39,688 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:55:39,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:39,689 INFO L85 PathProgramCache]: Analyzing trace with hash -208454633, now seen corresponding path program 1 times [2023-11-06 21:55:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:39,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070696466] [2023-11-06 21:55:39,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:39,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:55:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:55:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:55:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070696466] [2023-11-06 21:55:45,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070696466] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:45,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013543421] [2023-11-06 21:55:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:45,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:45,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:45,167 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:55:45,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 21:55:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 180 conjunts are in the unsatisfiable core [2023-11-06 21:55:45,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:45,683 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 21:55:45,776 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:55:46,021 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:55:46,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 21:55:46,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:55:46,436 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 21:55:46,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:46,700 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:55:46,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-11-06 21:55:47,095 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 21:55:47,193 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 16 treesize of output 11 [2023-11-06 21:55:47,604 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 16 treesize of output 11 [2023-11-06 21:55:47,662 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 21:55:47,675 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 21:55:48,204 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:48,205 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 34 [2023-11-06 21:55:48,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:48,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 21:55:48,219 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 21:55:48,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 21:55:48,319 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 21:55:48,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:48,835 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 21:55:48,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 60 [2023-11-06 21:55:48,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:48,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:48,866 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 21:55:48,867 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 21:55:48,880 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:55:48,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:48,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:55:50,686 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-06 21:55:50,707 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:50,708 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 98 treesize of output 52 [2023-11-06 21:55:50,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:50,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:55:50,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:50,960 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 19 treesize of output 18 [2023-11-06 21:55:50,974 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:55:50,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:50,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:50,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2023-11-06 21:55:51,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:51,305 INFO L322 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-11-06 21:55:51,305 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 110 [2023-11-06 21:55:51,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-06 21:55:51,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:51,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:51,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2023-11-06 21:55:51,362 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 28 treesize of output 20 [2023-11-06 21:55:51,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:51,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2023-11-06 21:55:51,645 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 21:55:51,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:51,657 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-06 21:55:51,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:51,884 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 21:55:51,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 117 [2023-11-06 21:55:51,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:51,902 INFO L322 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2023-11-06 21:55:51,902 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 98 [2023-11-06 21:55:51,918 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 36 treesize of output 23 [2023-11-06 21:55:52,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 21:55:52,983 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 21:55:52,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 35 [2023-11-06 21:55:52,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:52,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 21:55:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:55:53,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:55:57,058 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5707 Int) (v_ArrVal_5708 (Array Int Int)) (v_ArrVal_5701 (Array Int Int)) (v_ArrVal_5710 Int) (v_ArrVal_5700 (Array Int Int)) (v_ArrVal_5703 (Array Int Int)) (v_ArrVal_5702 (Array Int Int)) (v_ArrVal_5705 (Array Int Int)) (v_ArrVal_5704 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse3 (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5701) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5704))) (store .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse6 v_ArrVal_5710)))) (.cse0 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5700) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5703))) (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse6 v_ArrVal_5707))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5702) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5705) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5708) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 8))) (< (select |c_#length| .cse1) (+ .cse2 12)) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) .cse4 (select v_ArrVal_5702 .cse4))) v_ArrVal_5702))))))) is different from false [2023-11-06 21:55:57,558 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int)) (or (forall ((v_ArrVal_5707 Int) (v_ArrVal_5693 (Array Int Int)) (v_ArrVal_5708 (Array Int Int)) (v_ArrVal_5699 (Array Int Int)) (v_ArrVal_5701 (Array Int Int)) (v_ArrVal_5710 Int) (v_ArrVal_5700 (Array Int Int)) (v_ArrVal_5703 (Array Int Int)) (v_ArrVal_5702 (Array Int Int)) (v_ArrVal_5705 (Array Int Int)) (v_ArrVal_5704 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5701) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5701) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse7 v_ArrVal_5710)))) (.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (store (store (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5700) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5700) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse7 v_ArrVal_5707))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_5693)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 4))) (store (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5699) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) .cse1 (select v_ArrVal_5702 .cse1))) v_ArrVal_5702)) (< (select |c_#length| .cse2) (+ .cse3 12)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_5702) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5705) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5708) (select (select .cse4 .cse2) .cse3)) (+ (select (select .cse5 .cse2) .cse3) 8)))))))) (< |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0))) is different from false [2023-11-06 21:55:57,622 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5707 Int) (v_ArrVal_5708 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5710 Int) (v_ArrVal_5693 (Array Int Int)) (v_ArrVal_5699 (Array Int Int)) (v_ArrVal_5701 (Array Int Int)) (v_ArrVal_5700 (Array Int Int)) (v_ArrVal_5703 (Array Int Int)) (v_ArrVal_5702 (Array Int Int)) (v_ArrVal_5705 (Array Int Int)) (v_ArrVal_5704 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5701) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5701) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse7 v_ArrVal_5710)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (store (store (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5700) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5700) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse7 v_ArrVal_5707))))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_5693)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.offset| 4))) (store (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5699) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|) .cse1 (select v_ArrVal_5702 .cse1))) v_ArrVal_5702)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_5702) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5705) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5708) (select (select .cse2 .cse3) .cse4)) (+ 8 (select (select .cse5 .cse3) .cse4)))) (< (select |c_#length| .cse3) (+ 12 .cse4)) (< |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0)))))) is different from false [2023-11-06 21:55:57,718 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5707 Int) (v_ArrVal_5708 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5710 Int) (v_ArrVal_5693 (Array Int Int)) (v_ArrVal_5699 (Array Int Int)) (v_ArrVal_5701 (Array Int Int)) (v_ArrVal_5700 (Array Int Int)) (v_ArrVal_5703 (Array Int Int)) (v_ArrVal_5702 (Array Int Int)) (v_ArrVal_5705 (Array Int Int)) (v_ArrVal_5704 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse9 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse5 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse11 .cse1 v_ArrVal_5701) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse7)) .cse1 v_ArrVal_5701) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse9 v_ArrVal_5710)))) (.cse2 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (store (store (store .cse8 .cse1 v_ArrVal_5700) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_ArrVal_5700) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse9 v_ArrVal_5707))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_5693))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse0 .cse1 v_ArrVal_5702) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5705) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5708) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8))) (< (select |c_#length| .cse3) (+ .cse4 12)) (not (= v_ArrVal_5702 (let ((.cse6 (+ .cse7 4))) (store (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5699) .cse1) .cse6 (select v_ArrVal_5702 .cse6))))) (< |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0))))))) is different from false [2023-11-06 21:55:57,799 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5707 Int) (v_ArrVal_5708 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5710 Int) (v_ArrVal_5693 (Array Int Int)) (v_ArrVal_5699 (Array Int Int)) (v_ArrVal_5701 (Array Int Int)) (v_ArrVal_5700 (Array Int Int)) (v_ArrVal_5703 (Array Int Int)) (v_ArrVal_5702 (Array Int Int)) (v_ArrVal_5705 (Array Int Int)) (v_ArrVal_5704 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse9 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse5 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse11 .cse3 v_ArrVal_5701) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse7)) .cse3 v_ArrVal_5701) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse9 v_ArrVal_5710)))) (.cse4 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (store (store (store .cse8 .cse3 v_ArrVal_5700) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse3 v_ArrVal_5700) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse9 v_ArrVal_5707))))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_5693))) (or (< (select |c_#length| .cse0) (+ 12 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse2 .cse3 v_ArrVal_5702) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_5705) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5708) (select (select .cse4 .cse0) .cse1)) (+ (select (select .cse5 .cse0) .cse1) 8))) (not (= v_ArrVal_5702 (let ((.cse6 (+ .cse7 4))) (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5699) .cse3) .cse6 (select v_ArrVal_5702 .cse6))))) (< |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0))))))) is different from false [2023-11-06 21:55:57,898 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5707 Int) (v_ArrVal_5708 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5710 Int) (v_ArrVal_5693 (Array Int Int)) (v_ArrVal_5699 (Array Int Int)) (v_ArrVal_5701 (Array Int Int)) (v_ArrVal_5700 (Array Int Int)) (v_ArrVal_5703 (Array Int Int)) (v_ArrVal_5702 (Array Int Int)) (v_ArrVal_5705 (Array Int Int)) (v_ArrVal_5704 (Array Int Int))) (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse8 (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select .cse11 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4))) (.cse10 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse6 (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse12 .cse3 v_ArrVal_5701) .cse4 v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse8)) .cse3 v_ArrVal_5701) .cse4 v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse10 v_ArrVal_5710)))) (.cse5 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (store (store (store .cse9 .cse3 v_ArrVal_5700) .cse4 v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse3 v_ArrVal_5700) .cse4 v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse10 v_ArrVal_5707))))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_5693))) (or (< (select |c_#length| .cse0) (+ 12 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse2 .cse3 v_ArrVal_5702) .cse4 v_ArrVal_5705) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5708) (select (select .cse5 .cse0) .cse1)) (+ 8 (select (select .cse6 .cse0) .cse1)))) (not (= v_ArrVal_5702 (let ((.cse7 (+ .cse8 4))) (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5699) .cse3) .cse7 (select v_ArrVal_5702 .cse7))))) (< |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0))))))) is different from false [2023-11-06 21:55:57,981 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5707 Int) (v_ArrVal_5708 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5710 Int) (v_ArrVal_5693 (Array Int Int)) (v_ArrVal_5699 (Array Int Int)) (v_ArrVal_5701 (Array Int Int)) (v_ArrVal_5700 (Array Int Int)) (v_ArrVal_5703 (Array Int Int)) (v_ArrVal_5702 (Array Int Int)) (v_ArrVal_5705 (Array Int Int)) (v_ArrVal_5704 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse7 (+ .cse12 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) .cse7)) (.cse9 (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse6 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse11 .cse1 v_ArrVal_5701) .cse2 v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse12)) .cse1 v_ArrVal_5701) .cse2 v_ArrVal_5704) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse9 v_ArrVal_5710)))) (.cse3 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (store (store (store .cse8 .cse1 v_ArrVal_5700) .cse2 v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_ArrVal_5700) .cse2 v_ArrVal_5703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse9 v_ArrVal_5707))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_5693))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse0 .cse1 v_ArrVal_5702) .cse2 v_ArrVal_5705) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5708) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 8))) (< (select |c_#length| .cse4) (+ 12 .cse5)) (not (= v_ArrVal_5702 (store (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_5699) .cse1) .cse7 (select v_ArrVal_5702 .cse7)))) (< |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0))))))))) is different from false [2023-11-06 21:55:59,529 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 707 treesize of output 568 [2023-11-06 21:56:14,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013543421] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:56:14,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:56:14,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 80 [2023-11-06 21:56:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507235142] [2023-11-06 21:56:14,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:56:14,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-11-06 21:56:14,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:14,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-11-06 21:56:14,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=7665, Unknown=74, NotChecked=1274, Total=9312 [2023-11-06 21:56:14,858 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 80 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 71 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:56:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:25,018 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2023-11-06 21:56:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-06 21:56:25,019 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 71 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 67 [2023-11-06 21:56:25,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:25,020 INFO L225 Difference]: With dead ends: 91 [2023-11-06 21:56:25,020 INFO L226 Difference]: Without dead ends: 91 [2023-11-06 21:56:25,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2824 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=620, Invalid=12906, Unknown=74, NotChecked=1652, Total=15252 [2023-11-06 21:56:25,021 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 135 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 3195 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 3224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:25,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1870 Invalid, 3224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3195 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-06 21:56:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-06 21:56:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-11-06 21:56:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:56:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2023-11-06 21:56:25,027 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 67 [2023-11-06 21:56:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:25,027 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2023-11-06 21:56:25,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 71 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 21:56:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2023-11-06 21:56:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 21:56:25,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:25,029 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:25,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-06 21:56:25,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:56:25,239 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-06 21:56:25,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1533734690, now seen corresponding path program 1 times [2023-11-06 21:56:25,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:25,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373858655] [2023-11-06 21:56:25,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:25,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:56:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:31,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 21:56:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:56:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:56:33,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:33,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373858655] [2023-11-06 21:56:33,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373858655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:56:33,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716113794] [2023-11-06 21:56:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:33,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:56:33,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:56:33,705 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:56:33,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2681eeb-5e18-4a66-b8d0-95bbd9df40cd/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 21:56:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:34,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 179 conjunts are in the unsatisfiable core [2023-11-06 21:56:34,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:34,315 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 21:56:34,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:56:35,064 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:56:35,065 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 21:56:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:56:35,613 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 21:56:35,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-06 21:56:36,003 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 21:56:36,003 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 42 treesize of output 31 [2023-11-06 21:56:36,044 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 42 treesize of output 29 [2023-11-06 21:56:36,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 11 treesize of output 7 [2023-11-06 21:56:36,617 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 21:56:36,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 38 [2023-11-06 21:56:36,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:56:36,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:36,634 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 21:56:36,746 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 21:56:37,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:37,261 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 21:56:37,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 68 [2023-11-06 21:56:37,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:37,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:37,287 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 21:56:37,287 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 33 [2023-11-06 21:56:37,336 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 21:56:37,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-06 21:56:39,425 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-06 21:56:39,426 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 63 [2023-11-06 21:56:39,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:39,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-06 21:56:39,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:39,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:39,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2023-11-06 21:56:39,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:39,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:39,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:39,768 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 21:56:40,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:40,074 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-06 21:56:40,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 74 [2023-11-06 21:56:40,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:40,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:40,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:40,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2023-11-06 21:56:40,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:40,403 INFO L322 Elim1Store]: treesize reduction 64, result has 25.6 percent of original size [2023-11-06 21:56:40,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 133 treesize of output 79 [2023-11-06 21:56:40,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:40,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:40,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-11-06 21:56:40,710 INFO L322 Elim1Store]: treesize reduction 69, result has 9.2 percent of original size [2023-11-06 21:56:40,710 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 8 new quantified variables, introduced 11 case distinctions, treesize of input 202 treesize of output 118 [2023-11-06 21:56:40,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:40,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2023-11-06 21:56:41,655 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 21:56:42,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:42,003 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 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-06 21:56:42,631 INFO L322 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2023-11-06 21:56:42,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 143 treesize of output 56 [2023-11-06 21:56:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:42,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:45,649 INFO L322 Elim1Store]: treesize reduction 18, result has 98.5 percent of original size [2023-11-06 21:56:45,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 624 treesize of output 1230 [2023-11-06 21:56:45,696 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6044 (Array Int Int)) (v_ArrVal_6048 Int) (v_ArrVal_6046 Int) (v_ArrVal_6042 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_6042) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_6044) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_6042) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_6044) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse8 v_ArrVal_6046))) (.cse3 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)))) (let ((.cse5 (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse5))) (let ((.cse6 (store (select .cse7 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse5) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse6) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store .cse7 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse6) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse8 v_ArrVal_6048)))))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse3 (select (select .cse3 .cse1) .cse2)) (select (select .cse4 .cse1) .cse2)))) (or (= |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse0) (< (select |c_#length| .cse1) (+ .cse2 12)))))))) is different from false [2023-11-06 21:56:45,765 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6044 (Array Int Int)) (v_ArrVal_6048 Int) (v_ArrVal_6046 Int) (v_ArrVal_6042 (Array Int Int))) (let ((.cse9 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse4 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_6042) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_6044) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_6042) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_6044) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse9 v_ArrVal_6046)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (let ((.cse10 (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)))) (let ((.cse6 (store (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse6))) (let ((.cse7 (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (store (store (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse6) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse7) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse7) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse9 v_ArrVal_6048))))))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse3 (select (select .cse3 .cse1) .cse2)) (select (select .cse4 .cse1) .cse2)))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (< (select |c_#length| .cse1) (+ 12 .cse2)) (= |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse0))))))) is different from false [2023-11-06 21:56:45,837 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6044 (Array Int Int)) (v_ArrVal_6048 Int) (v_ArrVal_6046 Int) (v_ArrVal_6042 (Array Int Int))) (let ((.cse9 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse4 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_6042) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_6044) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_6042) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_6044) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse9 v_ArrVal_6046)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (let ((.cse10 (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)))) (let ((.cse6 (store (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| .cse6))) (let ((.cse7 (store (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (store (store (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| .cse6) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse7) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse7) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse9 v_ArrVal_6048))))))))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse3 (select (select .cse3 .cse0) .cse1)) (select (select .cse4 .cse0) .cse1)))) (or (< (select |c_#length| .cse0) (+ 12 .cse1)) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))))) is different from false [2023-11-06 21:56:45,929 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6044 (Array Int Int)) (v_ArrVal_6048 Int) (v_ArrVal_6046 Int) (v_ArrVal_6042 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse4 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse14 .cse6 v_ArrVal_6042) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_6044) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse14 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse12)) .cse6 v_ArrVal_6042) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_6044) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse10 v_ArrVal_6046)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (let ((.cse11 (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse6)))) (let ((.cse7 (store (select .cse11 .cse6) (+ .cse12 4) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (let ((.cse9 (store .cse11 .cse6 .cse7))) (let ((.cse8 (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (store (store (store .cse5 .cse6 .cse7) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse8) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| .cse8) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse10 v_ArrVal_6048))))))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse3 (select (select .cse3 .cse1) .cse2)) (select (select .cse4 .cse1) .cse2)))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (< (select |c_#length| .cse1) (+ 12 .cse2))))))))) is different from false [2023-11-06 21:56:46,020 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6044 (Array Int Int)) (v_ArrVal_6048 Int) (v_ArrVal_6046 Int) (v_ArrVal_6042 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse15 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse4 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store (store (store .cse14 .cse6 v_ArrVal_6042) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_6044) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse14 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse12)) .cse6 v_ArrVal_6042) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_6044) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse10 v_ArrVal_6046)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (let ((.cse11 (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse6)))) (let ((.cse7 (store (select .cse11 .cse6) (+ .cse12 4) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (let ((.cse9 (store .cse11 .cse6 .cse7))) (let ((.cse8 (store (select .cse9 |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (store (store (store .cse5 .cse6 .cse7) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| .cse8) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store .cse9 |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| .cse8) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse10 v_ArrVal_6048))))))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse3 (select (select .cse3 .cse1) .cse2)) (select (select .cse4 .cse1) .cse2)))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base|) (< (select |c_#length| .cse1) (+ 12 .cse2))))))))) is different from false [2023-11-06 21:56:52,316 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 2035 treesize of output 1452 [2023-11-06 21:57:00,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716113794] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:57:00,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:57:00,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2023-11-06 21:57:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985157270] [2023-11-06 21:57:00,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:57:00,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-11-06 21:57:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:00,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-11-06 21:57:00,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=7720, Unknown=21, NotChecked=900, Total=8930 [2023-11-06 21:57:00,890 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 80 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 71 states have internal predecessors, (125), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)