./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/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_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/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_96414660-53a2-4feb-9d5d-65edf4cafd31/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 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:08:49,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:08:49,173 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:08:49,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:08:49,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:08:49,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:08:49,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:08:49,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:08:49,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:08:49,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:08:49,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:08:49,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:08:49,234 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:08:49,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:08:49,236 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:08:49,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:08:49,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:08:49,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:08:49,238 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:08:49,239 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:08:49,239 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:08:49,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:08:49,240 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:08:49,241 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:08:49,241 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:08:49,242 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:08:49,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:08:49,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:08:49,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:08:49,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:08:49,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:08:49,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:08:49,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:08:49,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:08:49,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:08:49,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:08:49,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:08:49,248 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:08:49,248 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_96414660-53a2-4feb-9d5d-65edf4cafd31/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_96414660-53a2-4feb-9d5d-65edf4cafd31/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 -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2023-11-06 22:08:49,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:08:49,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:08:49,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:08:49,556 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:08:49,557 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:08:49,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2023-11-06 22:08:52,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:08:52,952 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:08:52,953 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/sv-benchmarks/c/list-simple/sll2n_update_all.i [2023-11-06 22:08:52,969 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/data/5108635f6/e8cf77de5ca74299a73a87ebdc78c444/FLAG222619404 [2023-11-06 22:08:52,985 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/data/5108635f6/e8cf77de5ca74299a73a87ebdc78c444 [2023-11-06 22:08:52,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:08:52,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:08:52,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:08:52,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:08:52,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:08:52,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:08:52" (1/1) ... [2023-11-06 22:08:52,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73507e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:52, skipping insertion in model container [2023-11-06 22:08:52,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:08:52" (1/1) ... [2023-11-06 22:08:53,063 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:08:53,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:08:53,451 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:08:53,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:08:53,538 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:08:53,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53 WrapperNode [2023-11-06 22:08:53,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:08:53,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:08:53,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:08:53,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:08:53,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,610 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 127 [2023-11-06 22:08:53,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:08:53,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:08:53,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:08:53,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:08:53,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:08:53,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:08:53,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:08:53,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:08:53,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:08:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:53,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:08:53,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:08:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:08:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:08:53,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:08:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:08:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:08:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:08:53,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:08:53,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:08:53,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:08:53,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:08:53,882 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:08:53,883 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:08:54,174 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:08:54,181 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:08:54,182 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 22:08:54,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:08:54 BoogieIcfgContainer [2023-11-06 22:08:54,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:08:54,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:08:54,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:08:54,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:08:54,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:08:52" (1/3) ... [2023-11-06 22:08:54,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37323253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:08:54, skipping insertion in model container [2023-11-06 22:08:54,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (2/3) ... [2023-11-06 22:08:54,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37323253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:08:54, skipping insertion in model container [2023-11-06 22:08:54,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:08:54" (3/3) ... [2023-11-06 22:08:54,195 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2023-11-06 22:08:54,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:08:54,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2023-11-06 22:08:54,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:08:54,294 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;@6e8a400, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:08:54,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-11-06 22:08:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 22:08:54,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:54,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:08:54,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:54,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2023-11-06 22:08:54,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:54,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071565450] [2023-11-06 22:08:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:54,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:54,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071565450] [2023-11-06 22:08:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071565450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:54,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:54,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:08:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077526254] [2023-11-06 22:08:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:54,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:08:54,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:54,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:08:54,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:54,752 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.8) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:54,853 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2023-11-06 22:08:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:08:54,856 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-06 22:08:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:54,865 INFO L225 Difference]: With dead ends: 64 [2023-11-06 22:08:54,865 INFO L226 Difference]: Without dead ends: 61 [2023-11-06 22:08:54,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:54,873 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:54,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 105 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-06 22:08:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-06 22:08:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2023-11-06 22:08:54,908 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 5 [2023-11-06 22:08:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:54,908 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2023-11-06 22:08:54,908 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2023-11-06 22:08:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 22:08:54,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:54,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:08:54,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:08:54,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:54,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:54,911 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2023-11-06 22:08:54,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:54,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613891676] [2023-11-06 22:08:54,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:54,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:55,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:55,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613891676] [2023-11-06 22:08:55,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613891676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:55,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:55,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:08:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940389774] [2023-11-06 22:08:55,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:55,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:08:55,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:55,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:08:55,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:55,023 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:55,064 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2023-11-06 22:08:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:08:55,065 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-06 22:08:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:55,066 INFO L225 Difference]: With dead ends: 59 [2023-11-06 22:08:55,066 INFO L226 Difference]: Without dead ends: 59 [2023-11-06 22:08:55,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:55,068 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:55,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-06 22:08:55,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-06 22:08:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2023-11-06 22:08:55,076 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2023-11-06 22:08:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:55,077 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2023-11-06 22:08:55,077 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2023-11-06 22:08:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:08:55,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:55,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:55,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:08:55,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:55,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:55,079 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2023-11-06 22:08:55,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:55,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140294171] [2023-11-06 22:08:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:55,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:55,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:55,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140294171] [2023-11-06 22:08:55,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140294171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:08:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216441338] [2023-11-06 22:08:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:55,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:08:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:08:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:55,136 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:55,151 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2023-11-06 22:08:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:08:55,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 22:08:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:55,153 INFO L225 Difference]: With dead ends: 70 [2023-11-06 22:08:55,153 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 22:08:55,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:55,155 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:55,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 22:08:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2023-11-06 22:08:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2023-11-06 22:08:55,164 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 8 [2023-11-06 22:08:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:55,164 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2023-11-06 22:08:55,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2023-11-06 22:08:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:08:55,165 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:55,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:55,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:08:55,166 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:55,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2023-11-06 22:08:55,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:55,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208770522] [2023-11-06 22:08:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:55,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208770522] [2023-11-06 22:08:55,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208770522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:55,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:08:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835426449] [2023-11-06 22:08:55,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:55,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:08:55,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:55,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:08:55,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:55,272 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:55,467 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-11-06 22:08:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:08:55,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:08:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:55,469 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:08:55,469 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 22:08:55,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:08:55,471 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:55,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 125 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 22:08:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2023-11-06 22:08:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2023-11-06 22:08:55,479 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 9 [2023-11-06 22:08:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:55,479 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2023-11-06 22:08:55,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2023-11-06 22:08:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:08:55,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:55,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:55,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:08:55,481 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:55,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2023-11-06 22:08:55,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:55,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723425336] [2023-11-06 22:08:55,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:55,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723425336] [2023-11-06 22:08:55,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723425336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:55,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:55,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:08:55,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427717768] [2023-11-06 22:08:55,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:55,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:08:55,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:55,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:08:55,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:55,703 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:55,857 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2023-11-06 22:08:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:08:55,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:08:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:55,859 INFO L225 Difference]: With dead ends: 63 [2023-11-06 22:08:55,859 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 22:08:55,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:08:55,864 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 64 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:55,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 127 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 22:08:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2023-11-06 22:08:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2023-11-06 22:08:55,886 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 9 [2023-11-06 22:08:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:55,887 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2023-11-06 22:08:55,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2023-11-06 22:08:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 22:08:55,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:55,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:55,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:08:55,889 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:55,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2023-11-06 22:08:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518200479] [2023-11-06 22:08:55,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:56,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:56,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518200479] [2023-11-06 22:08:56,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518200479] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657867137] [2023-11-06 22:08:56,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:56,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:56,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:56,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:56,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:08:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:08:56,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:56,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:08:56,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657867137] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:56,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:08:56,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 22:08:56,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585763257] [2023-11-06 22:08:56,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:56,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:08:56,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:56,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:08:56,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:56,273 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:56,300 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2023-11-06 22:08:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:08:56,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-06 22:08:56,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:56,305 INFO L225 Difference]: With dead ends: 67 [2023-11-06 22:08:56,306 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 22:08:56,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:56,307 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:56,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 174 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 22:08:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-06 22:08:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2023-11-06 22:08:56,312 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 17 [2023-11-06 22:08:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:56,312 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2023-11-06 22:08:56,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2023-11-06 22:08:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:08:56,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:56,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:56,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:56,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:08:56,515 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:56,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:56,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2023-11-06 22:08:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517669156] [2023-11-06 22:08:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:56,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:08:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:56,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517669156] [2023-11-06 22:08:56,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517669156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:56,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:56,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:08:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849861684] [2023-11-06 22:08:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:56,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:08:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:08:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:08:56,748 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:57,045 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-11-06 22:08:57,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:08:57,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-06 22:08:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:57,047 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:08:57,047 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:08:57,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:08:57,049 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 188 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:57,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 188 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:08:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2023-11-06 22:08:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2023-11-06 22:08:57,055 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 26 [2023-11-06 22:08:57,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:57,056 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2023-11-06 22:08:57,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2023-11-06 22:08:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:08:57,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:57,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:57,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:08:57,059 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:57,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:57,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2023-11-06 22:08:57,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:57,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481274236] [2023-11-06 22:08:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:57,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:57,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481274236] [2023-11-06 22:08:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481274236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:57,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:57,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:08:57,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417982230] [2023-11-06 22:08:57,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:57,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:08:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:57,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:08:57,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:08:57,431 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:57,754 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2023-11-06 22:08:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:08:57,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-06 22:08:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:57,755 INFO L225 Difference]: With dead ends: 72 [2023-11-06 22:08:57,756 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 22:08:57,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:08:57,757 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 188 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:57,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 187 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 22:08:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2023-11-06 22:08:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2023-11-06 22:08:57,761 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 26 [2023-11-06 22:08:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:57,762 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2023-11-06 22:08:57,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2023-11-06 22:08:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:08:57,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:57,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:57,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:08:57,767 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:57,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash -893075880, now seen corresponding path program 1 times [2023-11-06 22:08:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:57,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224406341] [2023-11-06 22:08:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:08:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224406341] [2023-11-06 22:08:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224406341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:08:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206612835] [2023-11-06 22:08:57,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:57,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:08:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:08:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:08:57,974 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:58,247 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-11-06 22:08:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:08:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-06 22:08:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:58,249 INFO L225 Difference]: With dead ends: 89 [2023-11-06 22:08:58,249 INFO L226 Difference]: Without dead ends: 89 [2023-11-06 22:08:58,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:08:58,250 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 187 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:58,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 187 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-06 22:08:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2023-11-06 22:08:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-11-06 22:08:58,256 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2023-11-06 22:08:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:58,257 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-11-06 22:08:58,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-11-06 22:08:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:08:58,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:58,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:58,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:08:58,259 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:58,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:58,260 INFO L85 PathProgramCache]: Analyzing trace with hash -893075879, now seen corresponding path program 1 times [2023-11-06 22:08:58,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:58,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821037512] [2023-11-06 22:08:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:58,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821037512] [2023-11-06 22:08:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821037512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894872375] [2023-11-06 22:08:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:58,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:58,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:58,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:58,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:08:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:58,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:08:58,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:08:58,571 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:08:58,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894872375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:58,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:08:58,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-06 22:08:58,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697700017] [2023-11-06 22:08:58,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:58,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:08:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:08:58,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:08:58,573 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:58,593 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2023-11-06 22:08:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:08:58,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-06 22:08:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:58,596 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:08:58,596 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:08:58,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:08:58,598 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 77 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:58,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:08:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2023-11-06 22:08:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.4) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-06 22:08:58,610 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 28 [2023-11-06 22:08:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:58,611 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-06 22:08:58,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-06 22:08:58,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:08:58,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:58,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:58,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:58,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:08:58,822 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:58,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:58,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2023-11-06 22:08:58,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:58,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554113595] [2023-11-06 22:08:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:58,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:08:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554113595] [2023-11-06 22:08:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554113595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:58,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:08:58,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178094696] [2023-11-06 22:08:58,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:58,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:08:58,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:08:58,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:08:58,907 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:58,936 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2023-11-06 22:08:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:08:58,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-06 22:08:58,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:58,937 INFO L225 Difference]: With dead ends: 98 [2023-11-06 22:08:58,938 INFO L226 Difference]: Without dead ends: 98 [2023-11-06 22:08:58,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:58,939 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 23 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:58,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 164 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-06 22:08:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2023-11-06 22:08:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-06 22:08:58,943 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2023-11-06 22:08:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:58,943 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-06 22:08:58,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-06 22:08:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:08:58,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:58,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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 22:08:58,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:08:58,945 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:58,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:58,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1668563827, now seen corresponding path program 1 times [2023-11-06 22:08:58,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:58,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887730960] [2023-11-06 22:08:58,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:58,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:08:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887730960] [2023-11-06 22:08:59,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887730960] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:59,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312089719] [2023-11-06 22:08:59,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:59,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:59,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:59,112 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:59,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:08:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:59,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:08:59,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:08:59,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:08:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312089719] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:59,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:08:59,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-06 22:08:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957445365] [2023-11-06 22:08:59,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:59,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:08:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:59,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:08:59,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:08:59,417 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:59,479 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2023-11-06 22:08:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:08:59,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-06 22:08:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:59,482 INFO L225 Difference]: With dead ends: 132 [2023-11-06 22:08:59,482 INFO L226 Difference]: Without dead ends: 132 [2023-11-06 22:08:59,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:08:59,483 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 137 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:59,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 260 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-06 22:08:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2023-11-06 22:08:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 91 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2023-11-06 22:08:59,490 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 33 [2023-11-06 22:08:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:59,490 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2023-11-06 22:08:59,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:08:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2023-11-06 22:08:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:08:59,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:59,493 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:59,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:59,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:08:59,700 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:08:59,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:59,701 INFO L85 PathProgramCache]: Analyzing trace with hash -146010198, now seen corresponding path program 1 times [2023-11-06 22:08:59,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:59,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359186085] [2023-11-06 22:08:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:09:00,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:00,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359186085] [2023-11-06 22:09:00,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359186085] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:00,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157195869] [2023-11-06 22:09:00,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:00,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:00,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:00,674 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:00,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:09:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-06 22:09:00,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:00,894 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:09:00,895 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-06 22:09:01,021 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 19 treesize of output 1 [2023-11-06 22:09:01,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:01,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-06 22:09:01,294 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 21 treesize of output 9 [2023-11-06 22:09:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:09:01,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:01,403 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1) (not (= v_ArrVal_500 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_500 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2023-11-06 22:09:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-06 22:09:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157195869] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:01,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 33 [2023-11-06 22:09:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944170743] [2023-11-06 22:09:01,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:01,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-06 22:09:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:01,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-06 22:09:01,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=945, Unknown=1, NotChecked=62, Total=1122 [2023-11-06 22:09:01,739 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:03,047 INFO L93 Difference]: Finished difference Result 180 states and 216 transitions. [2023-11-06 22:09:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:09:03,048 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-06 22:09:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:03,050 INFO L225 Difference]: With dead ends: 180 [2023-11-06 22:09:03,050 INFO L226 Difference]: Without dead ends: 180 [2023-11-06 22:09:03,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=351, Invalid=2102, Unknown=1, NotChecked=96, Total=2550 [2023-11-06 22:09:03,053 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 373 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:03,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 797 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 919 Invalid, 0 Unknown, 139 Unchecked, 0.7s Time] [2023-11-06 22:09:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-06 22:09:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 102. [2023-11-06 22:09:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 101 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2023-11-06 22:09:03,059 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 34 [2023-11-06 22:09:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:03,060 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2023-11-06 22:09:03,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2023-11-06 22:09:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:09:03,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:03,062 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:03,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:03,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:03,269 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:03,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:03,269 INFO L85 PathProgramCache]: Analyzing trace with hash -146010197, now seen corresponding path program 1 times [2023-11-06 22:09:03,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:03,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802173585] [2023-11-06 22:09:03,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:09:04,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:04,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802173585] [2023-11-06 22:09:04,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802173585] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:04,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299199816] [2023-11-06 22:09:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:04,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:04,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:04,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:04,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:09:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:04,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-06 22:09:04,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:04,808 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:09:04,808 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 15 [2023-11-06 22:09:04,827 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:09:04,827 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 22:09:05,014 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 19 treesize of output 1 [2023-11-06 22:09:05,019 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 19 treesize of output 1 [2023-11-06 22:09:05,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:05,384 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 45 treesize of output 27 [2023-11-06 22:09:05,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:05,392 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 44 treesize of output 26 [2023-11-06 22:09:05,493 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 39 treesize of output 21 [2023-11-06 22:09:05,498 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-06 22:09:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:09:05,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:05,865 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_598 (Array Int Int))) (or (forall ((v_ArrVal_597 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_597)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (not (= v_ArrVal_598 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_598 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_597 Int)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_597)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2023-11-06 22:09:06,669 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 49 treesize of output 45 [2023-11-06 22:09:06,698 INFO L322 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-11-06 22:09:06,698 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 36 treesize of output 49 [2023-11-06 22:09:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-06 22:09:06,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299199816] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:06,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:06,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 44 [2023-11-06 22:09:06,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901484102] [2023-11-06 22:09:06,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:06,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-06 22:09:06,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:06,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-06 22:09:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1763, Unknown=1, NotChecked=84, Total=1980 [2023-11-06 22:09:06,807 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 45 states, 44 states have (on average 2.090909090909091) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:09,713 INFO L93 Difference]: Finished difference Result 208 states and 247 transitions. [2023-11-06 22:09:09,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-06 22:09:09,714 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.090909090909091) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-06 22:09:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:09,715 INFO L225 Difference]: With dead ends: 208 [2023-11-06 22:09:09,715 INFO L226 Difference]: Without dead ends: 208 [2023-11-06 22:09:09,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=505, Invalid=3658, Unknown=1, NotChecked=126, Total=4290 [2023-11-06 22:09:09,718 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 510 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:09,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 843 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1231 Invalid, 0 Unknown, 166 Unchecked, 1.0s Time] [2023-11-06 22:09:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-06 22:09:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 110. [2023-11-06 22:09:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 109 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2023-11-06 22:09:09,724 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 34 [2023-11-06 22:09:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:09,725 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2023-11-06 22:09:09,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.090909090909091) internal successors, (92), 45 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2023-11-06 22:09:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:09:09,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:09,731 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:09,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:09,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:09,938 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:09,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:09,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1013729350, now seen corresponding path program 2 times [2023-11-06 22:09:09,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:09,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241123709] [2023-11-06 22:09:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:09,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:09:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241123709] [2023-11-06 22:09:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241123709] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464166115] [2023-11-06 22:09:10,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:09:10,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:10,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:10,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:10,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:09:10,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:09:10,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:09:10,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:09:10,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:09:10,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:09:10,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464166115] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:10,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:10,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-11-06 22:09:10,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237391904] [2023-11-06 22:09:10,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:10,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:09:10,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:09:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:09:10,330 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:10,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:10,394 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2023-11-06 22:09:10,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:09:10,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-06 22:09:10,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:10,396 INFO L225 Difference]: With dead ends: 104 [2023-11-06 22:09:10,396 INFO L226 Difference]: Without dead ends: 104 [2023-11-06 22:09:10,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:09:10,398 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 127 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:10,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:09:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-06 22:09:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2023-11-06 22:09:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.369047619047619) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2023-11-06 22:09:10,402 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 37 [2023-11-06 22:09:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:10,403 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2023-11-06 22:09:10,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2023-11-06 22:09:10,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:09:10,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:10,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:10,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:10,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:09:10,610 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:10,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:10,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1104183591, now seen corresponding path program 2 times [2023-11-06 22:09:10,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:10,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996021013] [2023-11-06 22:09:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:10,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:09:10,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996021013] [2023-11-06 22:09:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996021013] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666135859] [2023-11-06 22:09:10,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:09:10,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:10,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:10,763 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:10,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:09:10,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:09:10,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:09:10,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:09:10,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:09:10,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:09:10,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666135859] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:10,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:10,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2023-11-06 22:09:11,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40934389] [2023-11-06 22:09:11,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:11,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:09:11,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:11,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:09:11,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:09:11,001 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:11,118 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2023-11-06 22:09:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:09:11,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-06 22:09:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:11,120 INFO L225 Difference]: With dead ends: 100 [2023-11-06 22:09:11,120 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 22:09:11,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:09:11,121 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 226 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:11,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 327 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:09:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 22:09:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2023-11-06 22:09:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.35) internal successors, (108), 91 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2023-11-06 22:09:11,124 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 38 [2023-11-06 22:09:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:11,124 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2023-11-06 22:09:11,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2023-11-06 22:09:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:09:11,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:11,125 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:11,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:11,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:09:11,332 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:11,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1861613195, now seen corresponding path program 1 times [2023-11-06 22:09:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401422290] [2023-11-06 22:09:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:11,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:09:11,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401422290] [2023-11-06 22:09:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401422290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:11,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:11,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:09:11,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112384803] [2023-11-06 22:09:11,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:11,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:09:11,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:11,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:09:11,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:09:11,724 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:11,986 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2023-11-06 22:09:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:09:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-06 22:09:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:11,987 INFO L225 Difference]: With dead ends: 98 [2023-11-06 22:09:11,987 INFO L226 Difference]: Without dead ends: 98 [2023-11-06 22:09:11,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:09:11,988 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 173 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:11,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 182 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:09:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-06 22:09:11,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-11-06 22:09:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.3) internal successors, (104), 91 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2023-11-06 22:09:11,992 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 41 [2023-11-06 22:09:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:11,992 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2023-11-06 22:09:11,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2023-11-06 22:09:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:09:11,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:11,993 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:11,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:09:11,994 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:11,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1835573310, now seen corresponding path program 3 times [2023-11-06 22:09:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:11,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552313847] [2023-11-06 22:09:11,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:09:12,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552313847] [2023-11-06 22:09:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552313847] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593038025] [2023-11-06 22:09:12,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:09:12,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:12,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:12,163 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:12,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:09:12,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:09:12,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:09:12,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:09:12,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:09:12,479 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:09:12,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593038025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:12,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:09:12,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2023-11-06 22:09:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731987967] [2023-11-06 22:09:12,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:12,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:09:12,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:12,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:09:12,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:09:12,482 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:12,509 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-11-06 22:09:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:09:12,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-11-06 22:09:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:12,511 INFO L225 Difference]: With dead ends: 94 [2023-11-06 22:09:12,511 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 22:09:12,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:09:12,512 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 121 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:12,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 124 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:09:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 22:09:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2023-11-06 22:09:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.28) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2023-11-06 22:09:12,515 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 42 [2023-11-06 22:09:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:12,516 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2023-11-06 22:09:12,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2023-11-06 22:09:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 22:09:12,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:12,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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 22:09:12,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:12,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:09:12,723 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:12,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1595673087, now seen corresponding path program 1 times [2023-11-06 22:09:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:12,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014759783] [2023-11-06 22:09:12,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:09:12,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:12,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014759783] [2023-11-06 22:09:12,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014759783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:12,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:12,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:09:12,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021964568] [2023-11-06 22:09:12,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:12,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:09:12,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:12,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:09:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:09:12,834 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:12,860 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2023-11-06 22:09:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:09:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-11-06 22:09:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:12,861 INFO L225 Difference]: With dead ends: 85 [2023-11-06 22:09:12,862 INFO L226 Difference]: Without dead ends: 85 [2023-11-06 22:09:12,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:09:12,863 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 17 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:12,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 152 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:09:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-06 22:09:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-11-06 22:09:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2023-11-06 22:09:12,867 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 44 [2023-11-06 22:09:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:12,868 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2023-11-06 22:09:12,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2023-11-06 22:09:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 22:09:12,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:12,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:12,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:09:12,869 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:12,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1354555913, now seen corresponding path program 1 times [2023-11-06 22:09:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:12,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785058502] [2023-11-06 22:09:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:14,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:14,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785058502] [2023-11-06 22:09:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785058502] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:14,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154770225] [2023-11-06 22:09:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:14,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:14,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:14,292 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:14,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:09:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:14,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-06 22:09:14,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:14,619 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:09:14,619 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 22:09:14,766 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 22:09:15,055 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-06 22:09:15,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:09:15,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-06 22:09:15,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:09:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:15,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:15,711 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-11-06 22:09:16,107 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:16,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-11-06 22:09:16,119 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:16,119 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 48 treesize of output 51 [2023-11-06 22:09:16,128 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 16 [2023-11-06 22:09:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-06 22:09:16,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154770225] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:16,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:16,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 22] total 62 [2023-11-06 22:09:16,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607246357] [2023-11-06 22:09:16,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:16,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-06 22:09:16,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:16,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-06 22:09:16,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3409, Unknown=41, NotChecked=118, Total=3782 [2023-11-06 22:09:16,702 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 62 states, 62 states have (on average 2.0) internal successors, (124), 62 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:19,106 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2023-11-06 22:09:19,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-06 22:09:19,107 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 62 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-06 22:09:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:19,108 INFO L225 Difference]: With dead ends: 102 [2023-11-06 22:09:19,108 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 22:09:19,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=783, Invalid=7736, Unknown=41, NotChecked=182, Total=8742 [2023-11-06 22:09:19,115 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 389 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:19,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 870 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1467 Invalid, 0 Unknown, 99 Unchecked, 1.0s Time] [2023-11-06 22:09:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 22:09:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2023-11-06 22:09:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2023-11-06 22:09:19,128 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 47 [2023-11-06 22:09:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:19,129 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2023-11-06 22:09:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0) internal successors, (124), 62 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2023-11-06 22:09:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 22:09:19,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:19,131 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:19,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:19,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:19,338 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:19,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429550, now seen corresponding path program 1 times [2023-11-06 22:09:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:19,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645135860] [2023-11-06 22:09:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:19,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:09:21,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645135860] [2023-11-06 22:09:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645135860] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165502096] [2023-11-06 22:09:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:21,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:21,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:21,490 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:21,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:09:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:21,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-06 22:09:21,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:21,792 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:09:21,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-06 22:09:21,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:09:22,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:22,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-06 22:09:22,574 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:09:22,574 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:09:22,721 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 25 treesize of output 13 [2023-11-06 22:09:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:09:22,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:22,857 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2023-11-06 22:09:22,873 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2023-11-06 22:09:22,882 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2023-11-06 22:09:22,897 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2023-11-06 22:09:22,917 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (or (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1221))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1222)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1) (not (= v_ArrVal_1221 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1221 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2023-11-06 22:09:22,945 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_38| Int)) (or (not (= v_ArrVal_1221 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_38| (select v_ArrVal_1221 |v_ULTIMATE.start_sll_update_at_~head#1.offset_38|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_38|) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1221) (select v_ArrVal_1221 .cse0) v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1))) is different from false [2023-11-06 22:09:22,963 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_38| Int)) (or (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1221) (select v_ArrVal_1221 .cse0) v_ArrVal_1222) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0))) 1) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_38| (select v_ArrVal_1221 |v_ULTIMATE.start_sll_update_at_~head#1.offset_38|)) v_ArrVal_1221)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_38|))) is different from false [2023-11-06 22:09:22,983 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_38| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_38|) (= (select |c_#valid| (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1221) (select v_ArrVal_1221 .cse0) v_ArrVal_1222) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0))) 1) (not (= v_ArrVal_1221 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_38| (select v_ArrVal_1221 |v_ULTIMATE.start_sll_update_at_~head#1.offset_38|)))))) is different from false [2023-11-06 22:09:23,032 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_38| Int)) (or (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1221) (select v_ArrVal_1221 .cse0) v_ArrVal_1222) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) 1) (not (= v_ArrVal_1221 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_38| (select v_ArrVal_1221 |v_ULTIMATE.start_sll_update_at_~head#1.offset_38|)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_38|))) is different from false [2023-11-06 22:09:23,041 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 52 treesize of output 50 [2023-11-06 22:09:23,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:09:23,055 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 5 [2023-11-06 22:09:23,712 INFO L322 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-06 22:09:23,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 1 [2023-11-06 22:09:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-11-06 22:09:23,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165502096] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:23,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 17, 19] total 60 [2023-11-06 22:09:23,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628462581] [2023-11-06 22:09:23,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:23,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-06 22:09:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:23,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-06 22:09:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2463, Unknown=9, NotChecked=972, Total=3660 [2023-11-06 22:09:23,719 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 61 states, 60 states have (on average 2.2666666666666666) internal successors, (136), 61 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:26,439 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2023-11-06 22:09:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:09:26,440 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.2666666666666666) internal successors, (136), 61 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-06 22:09:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:26,441 INFO L225 Difference]: With dead ends: 110 [2023-11-06 22:09:26,441 INFO L226 Difference]: Without dead ends: 110 [2023-11-06 22:09:26,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=654, Invalid=5535, Unknown=9, NotChecked=1458, Total=7656 [2023-11-06 22:09:26,445 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 349 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 941 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:26,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 855 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1564 Invalid, 0 Unknown, 941 Unchecked, 1.1s Time] [2023-11-06 22:09:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-06 22:09:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2023-11-06 22:09:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 84 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-11-06 22:09:26,449 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 51 [2023-11-06 22:09:26,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:26,449 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-11-06 22:09:26,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.2666666666666666) internal successors, (136), 61 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-11-06 22:09:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 22:09:26,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:26,450 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:26,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:26,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 22:09:26,657 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:26,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429551, now seen corresponding path program 1 times [2023-11-06 22:09:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:26,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219149239] [2023-11-06 22:09:26,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:26,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:09:28,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219149239] [2023-11-06 22:09:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219149239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:28,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422802910] [2023-11-06 22:09:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:28,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:28,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:28,884 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:28,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:09:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:29,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 87 conjunts are in the unsatisfiable core [2023-11-06 22:09:29,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:29,329 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:09:29,329 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 22:09:29,336 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 16 treesize of output 11 [2023-11-06 22:09:29,541 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 22:09:29,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:09:29,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:29,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-11-06 22:09:29,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:29,937 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 38 treesize of output 22 [2023-11-06 22:09:30,270 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:09:30,270 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 56 treesize of output 51 [2023-11-06 22:09:30,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 39 treesize of output 24 [2023-11-06 22:09:30,503 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-11-06 22:09:30,507 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-06 22:09:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:09:30,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:31,002 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1335) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2023-11-06 22:09:31,019 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1335) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2023-11-06 22:09:31,034 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1335) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2023-11-06 22:09:31,056 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1335) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))) is different from false [2023-11-06 22:09:31,107 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1331 (Array Int Int))) (or (not (= v_ArrVal_1331 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1331 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1333)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1331) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (forall ((v_ArrVal_1331 (Array Int Int))) (or (not (= v_ArrVal_1331 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1331 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1331))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1333)) .cse3 v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1335) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))))))) is different from false [2023-11-06 22:09:31,182 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (forall ((v_ArrVal_1331 (Array Int Int))) (or (not (= v_ArrVal_1331 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| (select v_ArrVal_1331 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)))) (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 Int)) (let ((.cse2 (select v_ArrVal_1331 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1333)) .cse2 v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1331) .cse2 v_ArrVal_1335) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_DerPreprocessor_9 Int) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1333)) (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_DerPreprocessor_9) .cse3) v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))))) is different from false [2023-11-06 22:09:31,235 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_1331 (Array Int Int))) (or (not (= v_ArrVal_1331 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| (select v_ArrVal_1331 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)))) (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 Int)) (let ((.cse2 (select v_ArrVal_1331 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1333)) .cse2 v_ArrVal_1334) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1331) .cse2 v_ArrVal_1335) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_DerPreprocessor_9 Int) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1333)) (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_DerPreprocessor_9) .cse3) v_ArrVal_1334) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) 1)))))) is different from false [2023-11-06 22:09:31,271 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (forall ((v_ArrVal_1331 (Array Int Int))) (or (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 Int)) (let ((.cse1 (select v_ArrVal_1331 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1333)) .cse1 v_ArrVal_1334) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1331) .cse1 v_ArrVal_1335) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| (select v_ArrVal_1331 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)) v_ArrVal_1331)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_DerPreprocessor_9 Int) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1333)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_DerPreprocessor_9) .cse2) v_ArrVal_1334) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 1)))))) is different from false [2023-11-06 22:09:31,372 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_1331 (Array Int Int))) (or (forall ((v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 Int)) (let ((.cse1 (select v_ArrVal_1331 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1333)) .cse1 v_ArrVal_1334) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1331) .cse1 v_ArrVal_1335) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))))) (not (= v_ArrVal_1331 (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| (select v_ArrVal_1331 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_DerPreprocessor_9 Int) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_1333)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_DerPreprocessor_9) .cse2) v_ArrVal_1334) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 1)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))))) is different from false [2023-11-06 22:09:31,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:09:31,397 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:31,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2023-11-06 22:09:31,404 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 82 treesize of output 80 [2023-11-06 22:09:31,412 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:09:31,416 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 96 treesize of output 78 [2023-11-06 22:09:31,422 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 15 treesize of output 11 [2023-11-06 22:09:31,426 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 11 treesize of output 7 [2023-11-06 22:09:31,434 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:09:31,441 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:31,441 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2023-11-06 22:09:31,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-06 22:09:31,450 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:09:31,453 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:09:31,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:09:31,980 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 49 treesize of output 45 [2023-11-06 22:09:32,006 INFO L322 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-11-06 22:09:32,007 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 36 treesize of output 49 [2023-11-06 22:09:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-11-06 22:09:32,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422802910] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:32,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:32,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20, 22] total 68 [2023-11-06 22:09:32,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961395887] [2023-11-06 22:09:32,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:32,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-06 22:09:32,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:32,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-06 22:09:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3372, Unknown=9, NotChecked=1116, Total=4692 [2023-11-06 22:09:32,167 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 69 states, 68 states have (on average 2.161764705882353) internal successors, (147), 69 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:36,090 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2023-11-06 22:09:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:09:36,091 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 2.161764705882353) internal successors, (147), 69 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-06 22:09:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:36,092 INFO L225 Difference]: With dead ends: 97 [2023-11-06 22:09:36,092 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:09:36,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=710, Invalid=6973, Unknown=9, NotChecked=1620, Total=9312 [2023-11-06 22:09:36,096 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 723 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 824 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:36,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1075 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1450 Invalid, 0 Unknown, 824 Unchecked, 1.1s Time] [2023-11-06 22:09:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:09:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2023-11-06 22:09:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2023-11-06 22:09:36,099 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 51 [2023-11-06 22:09:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:36,100 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2023-11-06 22:09:36,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 2.161764705882353) internal successors, (147), 69 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2023-11-06 22:09:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 22:09:36,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:36,101 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 22:09:36,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:36,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 22:09:36,302 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:36,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1114916376, now seen corresponding path program 1 times [2023-11-06 22:09:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693009122] [2023-11-06 22:09:36,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:36,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:09:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:36,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693009122] [2023-11-06 22:09:36,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693009122] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:36,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337972291] [2023-11-06 22:09:36,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:36,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:36,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:36,445 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:36,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:09:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:36,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:09:36,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:09:36,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:09:36,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337972291] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:36,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-06 22:09:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110965718] [2023-11-06 22:09:36,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:36,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:09:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:36,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:09:36,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:09:36,717 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:36,761 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2023-11-06 22:09:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:09:36,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-06 22:09:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:36,762 INFO L225 Difference]: With dead ends: 84 [2023-11-06 22:09:36,763 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 22:09:36,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:09:36,764 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 90 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:36,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 164 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:09:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 22:09:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-06 22:09:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 83 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2023-11-06 22:09:36,767 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 54 [2023-11-06 22:09:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:36,767 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2023-11-06 22:09:36,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2023-11-06 22:09:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 22:09:36,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:36,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 22:09:36,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:36,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-06 22:09:36,980 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:36,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:36,981 INFO L85 PathProgramCache]: Analyzing trace with hash 240244101, now seen corresponding path program 2 times [2023-11-06 22:09:36,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:36,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598856340] [2023-11-06 22:09:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:36,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:09:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:37,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598856340] [2023-11-06 22:09:37,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598856340] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:37,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293534170] [2023-11-06 22:09:37,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:09:37,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:37,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:37,124 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:37,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:09:37,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:09:37,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:09:37,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:09:37,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:09:37,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:09:37,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293534170] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:37,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:37,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-11-06 22:09:37,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781861710] [2023-11-06 22:09:37,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:37,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:09:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:37,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:09:37,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:09:37,520 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:37,588 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2023-11-06 22:09:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:09:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-06 22:09:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:37,589 INFO L225 Difference]: With dead ends: 75 [2023-11-06 22:09:37,589 INFO L226 Difference]: Without dead ends: 75 [2023-11-06 22:09:37,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:09:37,590 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 57 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:37,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 171 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:09:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-06 22:09:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-06 22:09:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2023-11-06 22:09:37,593 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 54 [2023-11-06 22:09:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:37,593 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2023-11-06 22:09:37,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2023-11-06 22:09:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-06 22:09:37,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:37,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:37,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:37,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 22:09:37,801 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:37,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash 343039153, now seen corresponding path program 1 times [2023-11-06 22:09:37,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:37,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487546876] [2023-11-06 22:09:37,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:37,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487546876] [2023-11-06 22:09:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487546876] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376764899] [2023-11-06 22:09:40,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:40,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:40,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:40,608 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:40,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:09:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:40,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-06 22:09:40,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:41,021 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:09:41,022 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 22:09:41,211 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 22:09:41,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:41,580 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-06 22:09:41,984 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:09:41,985 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 64 treesize of output 57 [2023-11-06 22:09:41,992 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 23 treesize of output 15 [2023-11-06 22:09:41,998 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 32 treesize of output 19 [2023-11-06 22:09:42,426 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-11-06 22:09:42,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-06 22:09:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:09:42,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:43,148 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 86 treesize of output 64 [2023-11-06 22:09:43,366 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1651 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1651) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_1653 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1653) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2023-11-06 22:09:43,383 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:43,384 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 50 treesize of output 43 [2023-11-06 22:09:43,389 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 17 treesize of output 13 [2023-11-06 22:09:43,690 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1650 (Array Int Int))) (or (not (= v_ArrVal_1650 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1650 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1650) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2023-11-06 22:09:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-06 22:09:44,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376764899] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:44,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:44,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 26, 25] total 80 [2023-11-06 22:09:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083882274] [2023-11-06 22:09:44,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:44,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-11-06 22:09:44,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:44,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-11-06 22:09:44,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=5733, Unknown=42, NotChecked=306, Total=6320 [2023-11-06 22:09:44,297 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 80 states, 80 states have (on average 2.0) internal successors, (160), 80 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:49,772 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2023-11-06 22:09:49,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-06 22:09:49,773 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.0) internal successors, (160), 80 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-11-06 22:09:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:49,774 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:09:49,774 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 22:09:49,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3156 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=988, Invalid=13257, Unknown=43, NotChecked=474, Total=14762 [2023-11-06 22:09:49,778 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 391 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:49,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1155 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2672 Invalid, 0 Unknown, 153 Unchecked, 1.7s Time] [2023-11-06 22:09:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 22:09:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2023-11-06 22:09:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2023-11-06 22:09:49,780 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 57 [2023-11-06 22:09:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:49,781 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2023-11-06 22:09:49,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 2.0) internal successors, (160), 80 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2023-11-06 22:09:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:09:49,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:49,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:49,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:49,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 22:09:49,988 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:49,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:49,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341834, now seen corresponding path program 1 times [2023-11-06 22:09:49,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:49,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085103825] [2023-11-06 22:09:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:49,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:09:50,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:50,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085103825] [2023-11-06 22:09:50,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085103825] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:50,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357597307] [2023-11-06 22:09:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:50,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:50,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:50,123 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:50,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 22:09:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:50,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:09:50,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:09:50,450 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:09:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357597307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:50,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:09:50,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2023-11-06 22:09:50,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248564948] [2023-11-06 22:09:50,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:50,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:09:50,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:09:50,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:09:50,453 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:50,584 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2023-11-06 22:09:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:09:50,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-11-06 22:09:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:50,585 INFO L225 Difference]: With dead ends: 82 [2023-11-06 22:09:50,585 INFO L226 Difference]: Without dead ends: 82 [2023-11-06 22:09:50,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:09:50,586 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 73 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:50,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 130 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:09:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-06 22:09:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2023-11-06 22:09:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2023-11-06 22:09:50,588 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 59 [2023-11-06 22:09:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:50,589 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2023-11-06 22:09:50,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2023-11-06 22:09:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:09:50,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:50,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:50,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-06 22:09:50,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-06 22:09:50,797 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:50,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341833, now seen corresponding path program 1 times [2023-11-06 22:09:50,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708173748] [2023-11-06 22:09:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:09:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708173748] [2023-11-06 22:09:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708173748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:51,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:51,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:09:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038390271] [2023-11-06 22:09:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:51,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:09:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:09:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:09:51,148 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:51,400 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2023-11-06 22:09:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:09:51,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-11-06 22:09:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:51,402 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:09:51,402 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 22:09:51,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:09:51,403 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 140 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:51,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 113 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:09:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 22:09:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2023-11-06 22:09:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 73 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2023-11-06 22:09:51,406 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 59 [2023-11-06 22:09:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:51,406 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2023-11-06 22:09:51,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2023-11-06 22:09:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:09:51,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:51,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:51,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 22:09:51,407 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:51,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1658827182, now seen corresponding path program 1 times [2023-11-06 22:09:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:51,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222061770] [2023-11-06 22:09:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:09:51,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:51,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222061770] [2023-11-06 22:09:51,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222061770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:51,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:51,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:09:51,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081682222] [2023-11-06 22:09:51,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:51,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:09:51,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:51,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:09:51,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:09:51,562 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:51,720 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2023-11-06 22:09:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:09:51,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-11-06 22:09:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:51,722 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:09:51,722 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:09:51,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:09:51,722 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 136 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:51,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 163 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:09:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:09:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2023-11-06 22:09:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2023-11-06 22:09:51,725 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 60 [2023-11-06 22:09:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:51,725 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2023-11-06 22:09:51,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2023-11-06 22:09:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:09:51,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:51,726 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:51,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 22:09:51,726 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:51,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash -698613301, now seen corresponding path program 1 times [2023-11-06 22:09:51,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:51,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961131910] [2023-11-06 22:09:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:51,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:09:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:51,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961131910] [2023-11-06 22:09:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961131910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:51,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:51,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:09:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733840212] [2023-11-06 22:09:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:51,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:09:51,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:51,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:09:51,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:09:51,919 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:52,109 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2023-11-06 22:09:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:09:52,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-11-06 22:09:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:52,110 INFO L225 Difference]: With dead ends: 75 [2023-11-06 22:09:52,110 INFO L226 Difference]: Without dead ends: 75 [2023-11-06 22:09:52,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:09:52,111 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 125 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:52,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 147 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:09:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-06 22:09:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-06 22:09:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2023-11-06 22:09:52,120 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 62 [2023-11-06 22:09:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:52,120 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2023-11-06 22:09:52,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2023-11-06 22:09:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:09:52,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:52,121 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:52,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 22:09:52,124 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:52,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827867, now seen corresponding path program 1 times [2023-11-06 22:09:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:52,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122835926] [2023-11-06 22:09:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:09:53,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:53,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122835926] [2023-11-06 22:09:53,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122835926] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:53,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316718036] [2023-11-06 22:09:53,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:53,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:53,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:53,527 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:53,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 22:09:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:53,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-06 22:09:53,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:53,802 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:09:53,802 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 22:09:53,895 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 22:09:54,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:54,083 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-06 22:09:54,232 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:09:54,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:09:54,398 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:54,398 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 27 treesize of output 21 [2023-11-06 22:09:54,566 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 22:09:54,566 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 13 [2023-11-06 22:09:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:09:54,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:54,841 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:54,841 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 31 treesize of output 35 [2023-11-06 22:09:55,047 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2023 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= v_ArrVal_2023 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2023 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_2023 (Array Int Int))) (or (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select .cse1 4))) (not (= v_ArrVal_2023 (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2023 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2023-11-06 22:09:55,672 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 14 [2023-11-06 22:09:55,682 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 106 treesize of output 102 [2023-11-06 22:09:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 3 not checked. [2023-11-06 22:09:55,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316718036] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:55,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:55,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 21] total 49 [2023-11-06 22:09:55,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20841149] [2023-11-06 22:09:55,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:55,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 22:09:55,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:55,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 22:09:55,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2188, Unknown=1, NotChecked=94, Total=2450 [2023-11-06 22:09:55,794 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 50 states, 49 states have (on average 2.6122448979591835) internal successors, (128), 50 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:57,975 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-11-06 22:09:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 22:09:57,976 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.6122448979591835) internal successors, (128), 50 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-11-06 22:09:57,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:57,977 INFO L225 Difference]: With dead ends: 87 [2023-11-06 22:09:57,977 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 22:09:57,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=519, Invalid=5034, Unknown=1, NotChecked=146, Total=5700 [2023-11-06 22:09:57,979 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 165 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:57,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 693 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1478 Invalid, 0 Unknown, 81 Unchecked, 1.0s Time] [2023-11-06 22:09:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 22:09:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2023-11-06 22:09:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2023-11-06 22:09:57,982 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2023-11-06 22:09:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:57,983 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2023-11-06 22:09:57,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.6122448979591835) internal successors, (128), 50 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2023-11-06 22:09:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:09:57,984 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:57,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:57,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:58,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:58,191 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:09:58,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827868, now seen corresponding path program 1 times [2023-11-06 22:09:58,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891278601] [2023-11-06 22:09:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:09:59,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:59,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891278601] [2023-11-06 22:09:59,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891278601] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:59,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400470910] [2023-11-06 22:09:59,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:59,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:59,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:00,000 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:00,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 22:10:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:00,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-06 22:10:00,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:00,376 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:10:00,377 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 22:10:00,382 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 22:10:00,432 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 22:10:00,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 22:10:00,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:00,616 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-06 22:10:00,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:00,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:10:00,834 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:10:00,834 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 22:10:00,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:10:01,102 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:01,103 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 17 treesize of output 15 [2023-11-06 22:10:01,115 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:01,115 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 27 treesize of output 21 [2023-11-06 22:10:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:10:01,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:01,716 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2140 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2139) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2023-11-06 22:10:01,735 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2139) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2140 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2023-11-06 22:10:01,922 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2140) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2139) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2140 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2140) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))))) is different from false [2023-11-06 22:10:01,968 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_ArrVal_2136 Int) (v_ArrVal_2140 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2136)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_2140) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (not (= v_ArrVal_2138 (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2136 Int) (v_ArrVal_2140 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2138))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2136)) .cse3 v_ArrVal_2140) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2139) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (not (= v_ArrVal_2138 (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2023-11-06 22:10:02,028 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_DerPreprocessor_15 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_63| Int) (v_ArrVal_2136 Int) (v_ArrVal_2140 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_ArrVal_2136)) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_DerPreprocessor_15) .cse2) v_ArrVal_2140) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 5)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_63| Int)) (or (forall ((v_ArrVal_2138 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| (select v_ArrVal_2138 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|)) v_ArrVal_2138)) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2136 Int) (v_ArrVal_2140 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2138 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_ArrVal_2136)) .cse3 v_ArrVal_2140) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2138) .cse3 v_ArrVal_2139) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|))))) is different from false [2023-11-06 22:10:02,063 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (and (forall ((v_DerPreprocessor_15 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_63| Int) (v_ArrVal_2136 Int) (v_ArrVal_2140 (Array Int Int))) (or (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_ArrVal_2136)) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_DerPreprocessor_15) .cse2) v_ArrVal_2140) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_63| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|) (forall ((v_ArrVal_2138 (Array Int Int))) (or (not (= v_ArrVal_2138 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| (select v_ArrVal_2138 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|)))) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2136 Int) (v_ArrVal_2140 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2138 .cse2))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_ArrVal_2136)) .cse3 v_ArrVal_2140) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2138) .cse3 v_ArrVal_2139) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))))))))) is different from false [2023-11-06 22:10:02,099 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((v_DerPreprocessor_15 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_63| Int) (v_ArrVal_2136 Int) (v_ArrVal_2140 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_ArrVal_2136)) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_DerPreprocessor_15) .cse2) v_ArrVal_2140) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_63| Int)) (or (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2136 Int) (v_ArrVal_2140 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2138 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_ArrVal_2136)) .cse3 v_ArrVal_2140) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2138) .cse3 v_ArrVal_2139) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (not (= v_ArrVal_2138 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| (select v_ArrVal_2138 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|))))) is different from false [2023-11-06 22:10:02,195 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (forall ((v_DerPreprocessor_15 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_63| Int) (v_ArrVal_2136 Int) (v_ArrVal_2140 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_ArrVal_2136)) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_DerPreprocessor_15) .cse2) v_ArrVal_2140) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_63| Int)) (or (forall ((v_ArrVal_2138 (Array Int Int))) (or (not (= v_ArrVal_2138 (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| (select v_ArrVal_2138 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|)))) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2136 Int) (v_ArrVal_2140 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2138 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| v_ArrVal_2136)) .cse3 v_ArrVal_2140) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2138) .cse3 v_ArrVal_2139) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|))))) is different from false [2023-11-06 22:10:02,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:02,219 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:02,219 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 51 [2023-11-06 22:10:02,224 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 74 treesize of output 72 [2023-11-06 22:10:02,232 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:02,236 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 212 treesize of output 208 [2023-11-06 22:10:02,252 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:02,252 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 204 treesize of output 186 [2023-11-06 22:10:02,261 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 11 treesize of output 9 [2023-11-06 22:10:02,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-06 22:10:02,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:02,357 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:02,358 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2023-11-06 22:10:02,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-06 22:10:02,366 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:02,370 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:02,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-06 22:10:02,860 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 49 treesize of output 45 [2023-11-06 22:10:02,887 INFO L322 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-11-06 22:10:02,887 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 36 treesize of output 49 [2023-11-06 22:10:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2023-11-06 22:10:03,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400470910] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:03,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:03,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 57 [2023-11-06 22:10:03,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027803341] [2023-11-06 22:10:03,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:03,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-06 22:10:03,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:03,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-06 22:10:03,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2266, Unknown=30, NotChecked=824, Total=3306 [2023-11-06 22:10:03,053 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 58 states, 57 states have (on average 2.6140350877192984) internal successors, (149), 58 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:06,682 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2023-11-06 22:10:06,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:10:06,682 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.6140350877192984) internal successors, (149), 58 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-11-06 22:10:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:06,683 INFO L225 Difference]: With dead ends: 88 [2023-11-06 22:10:06,683 INFO L226 Difference]: Without dead ends: 88 [2023-11-06 22:10:06,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=616, Invalid=5392, Unknown=30, NotChecked=1272, Total=7310 [2023-11-06 22:10:06,684 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 303 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 672 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:06,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 627 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1271 Invalid, 0 Unknown, 672 Unchecked, 0.9s Time] [2023-11-06 22:10:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-06 22:10:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2023-11-06 22:10:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2023-11-06 22:10:06,688 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 65 [2023-11-06 22:10:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:06,688 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2023-11-06 22:10:06,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.6140350877192984) internal successors, (149), 58 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2023-11-06 22:10:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:10:06,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:06,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:06,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:06,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-06 22:10:06,892 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:10:06,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1642891405, now seen corresponding path program 1 times [2023-11-06 22:10:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488382828] [2023-11-06 22:10:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:10:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488382828] [2023-11-06 22:10:07,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488382828] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125576246] [2023-11-06 22:10:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:07,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:07,674 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:07,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 22:10:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:07,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-06 22:10:07,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:08,086 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:10:08,086 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 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:10:08,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:10:08,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:08,416 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 32 treesize of output 16 [2023-11-06 22:10:08,605 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:10:08,605 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 33 treesize of output 32 [2023-11-06 22:10:08,792 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:08,792 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 26 treesize of output 20 [2023-11-06 22:10:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:10:08,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:09,116 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2250 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2023-11-06 22:10:09,222 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (or (not (= v_ArrVal_2249 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2249 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2249))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2250)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)))) is different from false [2023-11-06 22:10:09,249 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_ArrVal_2250 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2249) (select v_ArrVal_2249 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (not (= v_ArrVal_2249 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| (select v_ArrVal_2249 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) is different from false [2023-11-06 22:10:09,266 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_ArrVal_2250 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| (select v_ArrVal_2249 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)) v_ArrVal_2249)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2249) (select v_ArrVal_2249 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2250) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) is different from false [2023-11-06 22:10:09,282 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_ArrVal_2250 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|) (not (= v_ArrVal_2249 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| (select v_ArrVal_2249 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2249) (select v_ArrVal_2249 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2250) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from false [2023-11-06 22:10:09,319 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int) (v_ArrVal_2250 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2249) (select v_ArrVal_2249 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2250) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0)) (not (= v_ArrVal_2249 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| (select v_ArrVal_2249 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) is different from false [2023-11-06 22:10:09,327 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 47 treesize of output 45 [2023-11-06 22:10:09,332 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:09,336 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:09,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2023-11-06 22:10:09,346 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:09,346 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 39 treesize of output 33 [2023-11-06 22:10:09,350 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 20 treesize of output 18 [2023-11-06 22:10:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 9 not checked. [2023-11-06 22:10:09,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125576246] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:09,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:09,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 25] total 53 [2023-11-06 22:10:09,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105465652] [2023-11-06 22:10:09,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:09,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-06 22:10:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:09,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-06 22:10:09,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1999, Unknown=43, NotChecked=570, Total=2756 [2023-11-06 22:10:09,535 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:12,270 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2023-11-06 22:10:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-06 22:10:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2023-11-06 22:10:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:12,271 INFO L225 Difference]: With dead ends: 87 [2023-11-06 22:10:12,271 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 22:10:12,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=666, Invalid=5321, Unknown=43, NotChecked=942, Total=6972 [2023-11-06 22:10:12,273 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 428 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 474 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:12,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 770 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1538 Invalid, 0 Unknown, 474 Unchecked, 0.9s Time] [2023-11-06 22:10:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 22:10:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2023-11-06 22:10:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.08) internal successors, (81), 79 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2023-11-06 22:10:12,276 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 66 [2023-11-06 22:10:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:12,277 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2023-11-06 22:10:12,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2023-11-06 22:10:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 22:10:12,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:12,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:12,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:12,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-06 22:10:12,485 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:10:12,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:12,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1727882938, now seen corresponding path program 1 times [2023-11-06 22:10:12,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:12,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277776414] [2023-11-06 22:10:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:10:14,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:14,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277776414] [2023-11-06 22:10:14,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277776414] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:14,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926094008] [2023-11-06 22:10:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:14,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:14,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:14,074 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:14,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 22:10:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:14,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-06 22:10:14,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:14,547 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:10:14,547 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 22:10:14,686 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 22:10:14,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:14,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-06 22:10:15,159 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:10:15,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:10:15,341 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:15,341 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 27 treesize of output 21 [2023-11-06 22:10:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:10:15,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:15,638 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2360 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2360) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:10:15,741 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2360 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2360) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:10:15,750 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2360 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2360) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:10:15,778 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (or (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2359))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2360)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (not (= v_ArrVal_2359 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2359 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2023-11-06 22:10:15,806 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_73| Int) (v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2359) (select v_ArrVal_2359 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2360) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|) (not (= v_ArrVal_2359 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| (select v_ArrVal_2359 |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|)))))) is different from false [2023-11-06 22:10:15,827 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_73| Int) (v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2359) (select v_ArrVal_2359 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2360) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_#StackHeapBarrier|) (not (= v_ArrVal_2359 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| (select v_ArrVal_2359 |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|))) is different from false [2023-11-06 22:10:15,844 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_73| Int) (v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| (select v_ArrVal_2359 |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|)) v_ArrVal_2359)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|) (< (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2359) (select v_ArrVal_2359 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2360) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2023-11-06 22:10:15,881 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_73| Int) (v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|) (not (= (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| (select v_ArrVal_2359 |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|)) v_ArrVal_2359)) (< (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2359) (select v_ArrVal_2359 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2360) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2023-11-06 22:10:15,890 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 44 treesize of output 42 [2023-11-06 22:10:15,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:15,898 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:15,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2023-11-06 22:10:15,905 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:15,906 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 40 treesize of output 34 [2023-11-06 22:10:15,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-06 22:10:16,096 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:10:16,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-11-06 22:10:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2023-11-06 22:10:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926094008] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:16,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 56 [2023-11-06 22:10:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757804895] [2023-11-06 22:10:16,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:16,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-06 22:10:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-06 22:10:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2196, Unknown=27, NotChecked=808, Total=3192 [2023-11-06 22:10:16,178 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 57 states, 56 states have (on average 2.7142857142857144) internal successors, (152), 57 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:19,059 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2023-11-06 22:10:19,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 22:10:19,060 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.7142857142857144) internal successors, (152), 57 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-11-06 22:10:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:19,061 INFO L225 Difference]: With dead ends: 88 [2023-11-06 22:10:19,061 INFO L226 Difference]: Without dead ends: 88 [2023-11-06 22:10:19,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 98 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=598, Invalid=5107, Unknown=27, NotChecked=1240, Total=6972 [2023-11-06 22:10:19,063 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 264 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 633 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:19,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 783 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1237 Invalid, 0 Unknown, 633 Unchecked, 0.8s Time] [2023-11-06 22:10:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-06 22:10:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2023-11-06 22:10:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2023-11-06 22:10:19,066 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 68 [2023-11-06 22:10:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:19,066 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2023-11-06 22:10:19,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.7142857142857144) internal successors, (152), 57 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2023-11-06 22:10:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 22:10:19,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:19,068 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 22:10:19,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:19,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:19,274 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-11-06 22:10:19,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash -177401856, now seen corresponding path program 2 times [2023-11-06 22:10:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:19,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965640038] [2023-11-06 22:10:19,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:10:22,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965640038] [2023-11-06 22:10:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965640038] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534652705] [2023-11-06 22:10:22,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:10:22,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:22,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:22,004 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:22,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96414660-53a2-4feb-9d5d-65edf4cafd31/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-06 22:10:22,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:10:22,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:22,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 131 conjunts are in the unsatisfiable core [2023-11-06 22:10:22,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:22,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:10:22,338 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:10:22,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:10:22,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:10:22,547 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 22:10:22,560 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 22:10:22,602 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:10:22,602 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 22:10:22,629 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:10:22,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:10:22,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:10:22,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:10:22,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-06 22:10:22,716 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 22 [2023-11-06 22:10:23,126 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-06 22:10:23,126 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2023-11-06 22:10:23,160 INFO L322 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2023-11-06 22:10:23,160 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 46 treesize of output 36 [2023-11-06 22:10:23,957 INFO L322 Elim1Store]: treesize reduction 164, result has 40.8 percent of original size [2023-11-06 22:10:23,957 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 145 treesize of output 203 [2023-11-06 22:10:24,097 INFO L322 Elim1Store]: treesize reduction 108, result has 47.3 percent of original size [2023-11-06 22:10:24,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 161 treesize of output 208 [2023-11-06 22:10:43,755 INFO L322 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2023-11-06 22:10:43,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2023-11-06 22:10:43,768 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:43,769 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2023-11-06 22:10:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:10:43,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:47,990 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select .cse7 4))) (and (forall ((v_ArrVal_2484 (Array Int Int))) (or (not (= (store .cse0 0 (select v_ArrVal_2484 0)) v_ArrVal_2484)) (forall ((v_ArrVal_2489 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2484)) (.cse2 (select v_ArrVal_2484 4))) (or (not (= (store (select .cse1 .cse2) .cse3 (select v_ArrVal_2489 .cse3)) v_ArrVal_2489)) (= (select (let ((.cse4 (store .cse1 .cse2 v_ArrVal_2489))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0)))))) (forall ((v_ArrVal_2484 (Array Int Int))) (or (not (= (store .cse0 0 (select v_ArrVal_2484 0)) v_ArrVal_2484)) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2489 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2484)) (.cse6 (select v_ArrVal_2484 4))) (or (forall ((v_ArrVal_2487 Int)) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse7 0 v_ArrVal_2485)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse3 v_ArrVal_2487))) (select (select (store .cse8 .cse6 v_ArrVal_2489) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 4) 0)) (not (= (store (select .cse8 .cse6) .cse3 (select v_ArrVal_2489 .cse3)) v_ArrVal_2489)))))))))) is different from false [2023-11-06 22:10:48,027 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse3 (select .cse5 4))) (and (forall ((v_ArrVal_2484 (Array Int Int))) (or (not (= v_ArrVal_2484 (store .cse0 0 (select v_ArrVal_2484 0)))) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2489 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2484)) (.cse2 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse1 .cse2) .cse3 (select v_ArrVal_2489 .cse3)))) (forall ((v_ArrVal_2487 Int)) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse5 0 v_ArrVal_2485)))) (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 v_ArrVal_2487))) (select (select (store .cse1 .cse2 v_ArrVal_2489) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) 4) 0))))))) (forall ((v_ArrVal_2484 (Array Int Int))) (or (not (= v_ArrVal_2484 (store .cse0 0 (select v_ArrVal_2484 0)))) (forall ((v_ArrVal_2489 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2484)) (.cse7 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse6 .cse7) .cse3 (select v_ArrVal_2489 .cse3)))) (= (select (let ((.cse8 (store .cse6 .cse7 v_ArrVal_2489))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0))))))))) is different from false [2023-11-06 22:10:48,071 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select .cse7 4))) (and (forall ((v_ArrVal_2484 (Array Int Int))) (or (not (= (store .cse0 0 (select v_ArrVal_2484 0)) v_ArrVal_2484)) (forall ((v_ArrVal_2489 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2484)) (.cse2 (select v_ArrVal_2484 4))) (or (not (= (store (select .cse1 .cse2) .cse3 (select v_ArrVal_2489 .cse3)) v_ArrVal_2489)) (= (select (let ((.cse4 (store .cse1 .cse2 v_ArrVal_2489))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0)))))) (forall ((v_ArrVal_2484 (Array Int Int))) (or (not (= (store .cse0 0 (select v_ArrVal_2484 0)) v_ArrVal_2484)) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2489 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2484)) (.cse6 (select v_ArrVal_2484 4))) (or (forall ((v_ArrVal_2487 Int)) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse7 0 v_ArrVal_2485)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse3 v_ArrVal_2487))) (select (select (store .cse8 .cse6 v_ArrVal_2489) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0)) (not (= (store (select .cse8 .cse6) .cse3 (select v_ArrVal_2489 .cse3)) v_ArrVal_2489)))))))))) is different from false [2023-11-06 22:10:48,166 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse8 4)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_2484 (Array Int Int))) (or (forall ((v_ArrVal_2489 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2484)) (.cse2 (select v_ArrVal_2484 4))) (or (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_2489))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (not (= (store (select .cse1 .cse2) .cse3 (select v_ArrVal_2489 .cse3)) v_ArrVal_2489))))) (not (= v_ArrVal_2484 (store .cse4 0 (select v_ArrVal_2484 0)))))) (forall ((v_ArrVal_2484 (Array Int Int))) (or (forall ((v_ArrVal_2485 Int) (v_ArrVal_2489 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2484)) (.cse6 (select v_ArrVal_2484 4))) (or (not (= (store (select .cse5 .cse6) .cse3 (select v_ArrVal_2489 .cse3)) v_ArrVal_2489)) (forall ((v_ArrVal_2487 Int)) (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse8 0 v_ArrVal_2485)))) (store .cse7 .cse6 (store (select .cse7 .cse6) .cse3 v_ArrVal_2487))) (select (select (store .cse5 .cse6 v_ArrVal_2489) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) 4) 0))))) (not (= v_ArrVal_2484 (store .cse4 0 (select v_ArrVal_2484 0))))))))) is different from false [2023-11-06 22:10:48,213 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse5 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select .cse5 4))) (and (forall ((v_ArrVal_2484 (Array Int Int))) (or (not (= (store .cse0 0 (select v_ArrVal_2484 0)) v_ArrVal_2484)) (forall ((v_ArrVal_2485 Int) (v_ArrVal_2489 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2484)) (.cse2 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse1 .cse2) .cse3 (select v_ArrVal_2489 .cse3)))) (forall ((v_ArrVal_2487 Int)) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse5 0 v_ArrVal_2485)))) (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 v_ArrVal_2487))) (select (select (store .cse1 .cse2 v_ArrVal_2489) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) 4) 0))))))) (forall ((v_ArrVal_2484 (Array Int Int))) (or (not (= (store .cse0 0 (select v_ArrVal_2484 0)) v_ArrVal_2484)) (forall ((v_ArrVal_2489 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2484)) (.cse7 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse6 .cse7) .cse3 (select v_ArrVal_2489 .cse3)))) (= (select (let ((.cse8 (store .cse6 .cse7 v_ArrVal_2489))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0)))))))))) is different from false [2023-11-06 22:10:48,256 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse7 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse7 4)) (.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((v_ArrVal_2484 (Array Int Int))) (or (forall ((v_ArrVal_2489 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2484)) (.cse2 (select v_ArrVal_2484 4))) (or (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_2489))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0) (not (= v_ArrVal_2489 (store (select .cse1 .cse2) .cse3 (select v_ArrVal_2489 .cse3))))))) (not (= v_ArrVal_2484 (store .cse4 0 (select v_ArrVal_2484 0)))))) (forall ((v_ArrVal_2484 (Array Int Int))) (or (forall ((v_ArrVal_2485 Int) (v_ArrVal_2489 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2484)) (.cse6 (select v_ArrVal_2484 4))) (or (forall ((v_ArrVal_2487 Int)) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store .cse7 0 v_ArrVal_2485)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse3 v_ArrVal_2487))) (select (select (store .cse8 .cse6 v_ArrVal_2489) |c_ULTIMATE.start_node_create_#res#1.base|) 4)) 4) 0)) (not (= v_ArrVal_2489 (store (select .cse8 .cse6) .cse3 (select v_ArrVal_2489 .cse3))))))) (not (= v_ArrVal_2484 (store .cse4 0 (select v_ArrVal_2484 0)))))))))) is different from false [2023-11-06 22:10:48,304 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse7 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse7 4)) (.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((v_ArrVal_2484 (Array Int Int))) (or (forall ((v_ArrVal_2489 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse2 (select v_ArrVal_2484 4))) (or (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_2489))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (store (select .cse1 .cse2) .cse3 (select v_ArrVal_2489 .cse3)) v_ArrVal_2489))))) (not (= v_ArrVal_2484 (store .cse4 0 (select v_ArrVal_2484 0)))))) (forall ((v_ArrVal_2484 (Array Int Int))) (or (forall ((v_ArrVal_2485 Int) (v_ArrVal_2489 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse6 (select v_ArrVal_2484 4))) (or (forall ((v_ArrVal_2487 Int)) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse7 0 v_ArrVal_2485)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse3 v_ArrVal_2487))) (select (select (store .cse8 .cse6 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)) (not (= (store (select .cse8 .cse6) .cse3 (select v_ArrVal_2489 .cse3)) v_ArrVal_2489))))) (not (= v_ArrVal_2484 (store .cse4 0 (select v_ArrVal_2484 0)))))))))) is different from false [2023-11-06 22:10:48,394 INFO L322 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-11-06 22:10:48,394 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 164 treesize of output 158 [2023-11-06 22:10:48,449 INFO L322 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-06 22:10:48,449 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 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-06 22:10:49,118 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 46 treesize of output 42 [2023-11-06 22:10:49,148 INFO L322 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-06 22:10:49,149 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 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-06 22:10:49,237 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse18 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse0 (not .cse18)) (.cse10 (not (= .cse11 0)))) (and (or .cse0 (forall ((v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse1 (select v_ArrVal_2484 4))) (or (not (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse2 (store .cse3 .cse1 v_ArrVal_2489))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (store (select .cse3 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)))))) (or (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse5 (select v_ArrVal_2484 4))) (let ((.cse6 (select .cse4 .cse5)) (.cse9 (select v_arrayElimArr_6 4)) (.cse7 (select (select (store .cse8 .cse5 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse4 .cse5 (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse7) 4) 0) (not (= (select v_arrayElimArr_6 0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse8 .cse5) .cse9 (select v_ArrVal_2489 .cse9)) v_ArrVal_2489)) (= (select (select (store .cse4 .cse5 (store .cse6 .cse9 v_ArrVal_2487)) .cse7) 4) 0))))) .cse10) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_6 .cse11))) (forall ((v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse13 (select v_ArrVal_2484 4))) (let ((.cse14 (select .cse12 .cse13)) (.cse17 (select v_arrayElimArr_6 4)) (.cse15 (select (select (store .cse16 .cse13 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2484 .cse11))) (= (select (select (store .cse12 .cse13 (store .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse15) 4) 0) (not (= (store (select .cse16 .cse13) .cse17 (select v_ArrVal_2489 .cse17)) v_ArrVal_2489)) (= (select (select (store .cse12 .cse13 (store .cse14 .cse17 v_ArrVal_2487)) .cse15) 4) 0)))))))) .cse18) (or .cse18 (and (forall ((v_arrayElimCell_151 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse20 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse19 .cse20) v_arrayElimCell_151 (select v_ArrVal_2489 v_arrayElimCell_151)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2484 .cse11))) (= (select (let ((.cse21 (store .cse19 .cse20 v_ArrVal_2489))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse23 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse22 .cse23) v_arrayElimCell_151 (select v_ArrVal_2489 v_arrayElimCell_151)))) (= (select (let ((.cse24 (store .cse22 .cse23 v_ArrVal_2489))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) .cse10))) (or .cse0 (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse25 (select v_ArrVal_2484 4))) (or (not (= .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse26 .cse25 (store (select .cse26 .cse25) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487))) (select (select (store .cse27 .cse25 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse27 .cse25) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489))))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimCell_150 Int) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse28 (select v_ArrVal_2484 4))) (let ((.cse30 (select .cse29 .cse28)) (.cse31 (select (select (store .cse32 .cse28 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse29 .cse28 (store .cse30 v_arrayElimCell_150 v_ArrVal_2487)) .cse31) 4) 0) (= (select (select (store .cse29 .cse28 (store .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse31) 4) 0) (not (= (store (select .cse32 .cse28) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)))))) (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (or .cse0 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse33 (select v_ArrVal_2484 4)) (.cse35 (select v_arrayElimArr_6 4))) (or (not (= .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse34 .cse33 (store (select .cse34 .cse33) .cse35 v_ArrVal_2487))) (select (select (store .cse36 .cse33 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse36 .cse33) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)) (not (= .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (or .cse0 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse37 (select v_ArrVal_2484 4))) (or (not (= .cse37 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse38 .cse37 (store (select .cse38 .cse37) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487))) (select (select (store .cse39 .cse37 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse39 .cse37) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)) (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (or (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse42 (select v_arrayElimArr_6 4)) (.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse41 (select v_ArrVal_2484 4))) (or (not (= (store (select .cse40 .cse41) .cse42 (select v_ArrVal_2489 .cse42)) v_ArrVal_2489)) (= (select (select (let ((.cse43 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse43 .cse41 (store (select .cse43 .cse41) .cse42 v_ArrVal_2487))) (select (select (store .cse40 .cse41 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse45 (select v_ArrVal_2484 4))) (let ((.cse46 (select .cse44 .cse45)) (.cse49 (select v_arrayElimArr_6 4)) (.cse47 (select (select (store .cse48 .cse45 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse44 .cse45 (store .cse46 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse47) 4) 0) (not (= (store (select .cse48 .cse45) .cse49 (select v_ArrVal_2489 .cse49)) v_ArrVal_2489)) (= (select (select (store .cse44 .cse45 (store .cse46 .cse49 v_ArrVal_2487)) .cse47) 4) 0))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse51 (select v_ArrVal_2484 4))) (let ((.cse52 (select .cse50 .cse51)) (.cse55 (select v_arrayElimArr_6 4)) (.cse53 (select (select (store .cse54 .cse51 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse50 .cse51 (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse53) 4) 0) (not (= (store (select .cse54 .cse51) .cse55 (select v_ArrVal_2489 .cse55)) v_ArrVal_2489)) (= (select (select (store .cse50 .cse51 (store .cse52 .cse55 v_ArrVal_2487)) .cse53) 4) 0) (not (= (select v_ArrVal_2484 0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse58 (select v_arrayElimArr_6 4)) (.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse57 (select v_ArrVal_2484 4))) (or (not (= (store (select .cse56 .cse57) .cse58 (select v_ArrVal_2489 .cse58)) v_ArrVal_2489)) (= (select (select (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse59 .cse57 (store (select .cse59 .cse57) .cse58 v_ArrVal_2487))) (select (select (store .cse56 .cse57 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_ArrVal_2484 0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) .cse10) (or (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse62 (select v_arrayElimArr_6 4)) (.cse60 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse61 (select v_ArrVal_2484 4))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2484 .cse11))) (not (= (store (select .cse60 .cse61) .cse62 (select v_ArrVal_2489 .cse62)) v_ArrVal_2489)) (= (select (select (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse63 .cse61 (store (select .cse63 .cse61) .cse62 v_ArrVal_2487))) (select (select (store .cse60 .cse61 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_6 .cse11))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse66 (select v_arrayElimArr_6 4)) (.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse65 (select v_ArrVal_2484 4))) (or (not (= (select v_arrayElimArr_6 0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse64 .cse65) .cse66 (select v_ArrVal_2489 .cse66)) v_ArrVal_2489)) (= (select (select (let ((.cse67 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse67 .cse65 (store (select .cse67 .cse65) .cse66 v_ArrVal_2487))) (select (select (store .cse64 .cse65 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse10)) .cse18)))) is different from false [2023-11-06 22:10:54,067 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:54,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 611 treesize of output 719 [2023-11-06 22:11:19,228 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (and (forall ((v_prenex_85 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_prenex_87 Int) (v_prenex_86 Int) (v_prenex_88 (Array Int Int))) (let ((.cse3 (store .cse4 v_prenex_86 v_prenex_89)) (.cse0 (select v_prenex_89 4))) (or (not (= .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= (select (select (let ((.cse1 (store .cse2 v_prenex_86 v_prenex_85))) (store .cse1 .cse0 (store (select .cse1 .cse0) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_prenex_87))) (select (select (store .cse3 .cse0 v_prenex_88) v_prenex_86) 4)) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_prenex_86) (not (= v_prenex_88 (store (select .cse3 .cse0) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select v_prenex_88 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select v_prenex_85 4)))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_77 Int) (v_ArrVal_2487 Int) (v_prenex_79 (Array Int Int)) (v_prenex_78 (Array Int Int))) (let ((.cse7 (store .cse4 v_prenex_77 v_prenex_79)) (.cse5 (select v_prenex_79 4))) (or (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5)) (= (select (select (let ((.cse6 (store .cse2 v_prenex_77 v_arrayElimArr_6))) (store .cse6 .cse5 (store (select .cse6 .cse5) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_2487))) (select (select (store .cse7 .cse5 v_prenex_78) v_prenex_77) 4)) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_prenex_77) (not (= v_prenex_78 (store (select .cse7 .cse5) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select v_prenex_78 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))))) (forall ((v_prenex_94 (Array Int Int)) (v_prenex_93 (Array Int Int)) (v_arrayElimCell_150 Int) (v_prenex_90 (Array Int Int)) (v_prenex_92 Int) (v_prenex_91 Int)) (let ((.cse12 (store .cse4 v_prenex_91 v_prenex_94)) (.cse8 (store .cse2 v_prenex_91 v_prenex_90)) (.cse9 (select v_prenex_94 4))) (let ((.cse10 (select .cse8 .cse9)) (.cse11 (select (select (store .cse12 .cse9 v_prenex_93) v_prenex_91) 4))) (or (= (select (select (store .cse8 .cse9 (store .cse10 v_arrayElimCell_150 v_prenex_92)) .cse11) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_prenex_91) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (not (= (store (select .cse12 .cse9) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select v_prenex_93 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_prenex_93)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select v_prenex_90 4))) (= (select (select (store .cse8 .cse9 (store .cse10 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_prenex_92)) .cse11) 4) 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_58| Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse14 (store .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_58| v_ArrVal_2484)) (.cse13 (select v_ArrVal_2484 4))) (or (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_58|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse13)) (not (= (store (select .cse14 .cse13) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) v_ArrVal_2489)) (= (select (let ((.cse15 (store .cse14 .cse13 v_ArrVal_2489))) (select .cse15 (select (select .cse15 |v_ULTIMATE.start_node_create_~temp~0#1.base_58|) 4))) 4) 0)))) (forall ((v_prenex_83 (Array Int Int)) (v_prenex_80 (Array Int Int)) (v_prenex_84 (Array Int Int)) (v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse16 (select v_prenex_80 4)) (.cse19 (store .cse4 v_prenex_81 v_prenex_84)) (.cse17 (select v_prenex_84 4))) (or (not (= .cse16 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse17)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_prenex_81) (= (select (select (let ((.cse18 (store .cse2 v_prenex_81 v_prenex_80))) (store .cse18 .cse17 (store (select .cse18 .cse17) .cse16 v_prenex_82))) (select (select (store .cse19 .cse17 v_prenex_83) v_prenex_81) 4)) 4) 0) (not (= v_prenex_83 (store (select .cse19 .cse17) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select v_prenex_83 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))))))))) is different from false [2023-11-06 22:11:19,383 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_77 Int) (v_ArrVal_2487 Int) (v_prenex_79 (Array Int Int)) (v_prenex_78 (Array Int Int))) (let ((.cse3 (store .cse4 v_prenex_77 v_prenex_79)) (.cse0 (select v_prenex_79 4))) (or (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_node_create_#res#1.offset|)) (not (= |c_ULTIMATE.start_node_create_#res#1.base| .cse0)) (= (select (select (let ((.cse1 (store .cse2 v_prenex_77 v_arrayElimArr_6))) (store .cse1 .cse0 (store (select .cse1 .cse0) |c_ULTIMATE.start_node_create_#res#1.offset| v_ArrVal_2487))) (select (select (store .cse3 .cse0 v_prenex_78) v_prenex_77) 4)) 4) 0) (= |c_ULTIMATE.start_node_create_#res#1.base| v_prenex_77) (not (= v_prenex_78 (store (select .cse3 .cse0) |c_ULTIMATE.start_node_create_#res#1.offset| (select v_prenex_78 |c_ULTIMATE.start_node_create_#res#1.offset|))))))) (forall ((v_prenex_94 (Array Int Int)) (v_prenex_93 (Array Int Int)) (v_arrayElimCell_150 Int) (v_prenex_90 (Array Int Int)) (v_prenex_92 Int) (v_prenex_91 Int)) (let ((.cse9 (store .cse4 v_prenex_91 v_prenex_94)) (.cse6 (store .cse2 v_prenex_91 v_prenex_90)) (.cse5 (select v_prenex_94 4))) (let ((.cse7 (select .cse6 .cse5)) (.cse8 (select (select (store .cse9 .cse5 v_prenex_93) v_prenex_91) 4))) (or (not (= |c_ULTIMATE.start_node_create_#res#1.base| .cse5)) (= |c_ULTIMATE.start_node_create_#res#1.base| v_prenex_91) (= (select (select (store .cse6 .cse5 (store .cse7 v_arrayElimCell_150 v_prenex_92)) .cse8) 4) 0) (not (= |c_ULTIMATE.start_node_create_#res#1.offset| (select v_prenex_90 4))) (= (select (select (store .cse6 .cse5 (store .cse7 |c_ULTIMATE.start_node_create_#res#1.offset| v_prenex_92)) .cse8) 4) 0) (not (= (store (select .cse9 .cse5) |c_ULTIMATE.start_node_create_#res#1.offset| (select v_prenex_93 |c_ULTIMATE.start_node_create_#res#1.offset|)) v_prenex_93)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_58| Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse11 (store .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_58| v_ArrVal_2484)) (.cse12 (select v_ArrVal_2484 4))) (or (= (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_2489))) (select .cse10 (select (select .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_58|) 4))) 4) 0) (not (= v_ArrVal_2489 (store (select .cse11 .cse12) |c_ULTIMATE.start_node_create_#res#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_node_create_#res#1.offset|)))) (= |c_ULTIMATE.start_node_create_#res#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_58|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| .cse12))))) (forall ((v_prenex_85 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_prenex_87 Int) (v_prenex_86 Int) (v_prenex_88 (Array Int Int))) (let ((.cse13 (store .cse4 v_prenex_86 v_prenex_89)) (.cse14 (select v_prenex_89 4))) (or (not (= (select v_prenex_85 4) |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_node_create_#res#1.base| v_prenex_86) (not (= v_prenex_88 (store (select .cse13 .cse14) |c_ULTIMATE.start_node_create_#res#1.offset| (select v_prenex_88 |c_ULTIMATE.start_node_create_#res#1.offset|)))) (not (= |c_ULTIMATE.start_node_create_#res#1.base| .cse14)) (= (select (select (let ((.cse15 (store .cse2 v_prenex_86 v_prenex_85))) (store .cse15 .cse14 (store (select .cse15 .cse14) |c_ULTIMATE.start_node_create_#res#1.offset| v_prenex_87))) (select (select (store .cse13 .cse14 v_prenex_88) v_prenex_86) 4)) 4) 0)))) (forall ((v_prenex_83 (Array Int Int)) (v_prenex_80 (Array Int Int)) (v_prenex_84 (Array Int Int)) (v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse18 (select v_prenex_80 4)) (.cse17 (store .cse4 v_prenex_81 v_prenex_84)) (.cse16 (select v_prenex_84 4))) (or (not (= |c_ULTIMATE.start_node_create_#res#1.base| .cse16)) (not (= (store (select .cse17 .cse16) |c_ULTIMATE.start_node_create_#res#1.offset| (select v_prenex_83 |c_ULTIMATE.start_node_create_#res#1.offset|)) v_prenex_83)) (not (= .cse18 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= (select (select (let ((.cse19 (store .cse2 v_prenex_81 v_prenex_80))) (store .cse19 .cse16 (store (select .cse19 .cse16) .cse18 v_prenex_82))) (select (select (store .cse17 .cse16 v_prenex_83) v_prenex_81) 4)) 4) 0) (= |c_ULTIMATE.start_node_create_#res#1.base| v_prenex_81))))))) is different from false [2023-11-06 22:11:19,550 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_58| Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_58| v_ArrVal_2484)) (.cse0 (select v_ArrVal_2484 4))) (or (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse0)) (= (select (let ((.cse1 (store .cse2 .cse0 v_ArrVal_2489))) (select .cse1 (select (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_58|) 4))) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_58|) (not (= v_ArrVal_2489 (store (select .cse2 .cse0) |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))))))) (forall ((v_prenex_83 (Array Int Int)) (v_prenex_80 (Array Int Int)) (v_prenex_84 (Array Int Int)) (v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse8 (store .cse3 v_prenex_81 v_prenex_84)) (.cse6 (select v_prenex_80 4)) (.cse5 (select v_prenex_84 4))) (or (= (select (select (let ((.cse4 (store .cse7 v_prenex_81 v_prenex_80))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_prenex_82))) (select (select (store .cse8 .cse5 v_prenex_83) v_prenex_81) 4)) 4) 0) (not (= (store (select .cse8 .cse5) |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_prenex_83 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_prenex_83)) (not (= .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_81) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse5))))) (forall ((v_prenex_94 (Array Int Int)) (v_prenex_93 (Array Int Int)) (v_arrayElimCell_150 Int) (v_prenex_90 (Array Int Int)) (v_prenex_92 Int) (v_prenex_91 Int)) (let ((.cse13 (store .cse3 v_prenex_91 v_prenex_94)) (.cse10 (store .cse7 v_prenex_91 v_prenex_90)) (.cse9 (select v_prenex_94 4))) (let ((.cse11 (select .cse10 .cse9)) (.cse12 (select (select (store .cse13 .cse9 v_prenex_93) v_prenex_91) 4))) (or (not (= (select v_prenex_90 4) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse9)) (= (select (select (store .cse10 .cse9 (store .cse11 v_arrayElimCell_150 v_prenex_92)) .cse12) 4) 0) (= (select (select (store .cse10 .cse9 (store .cse11 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_prenex_92)) .cse12) 4) 0) (not (= v_prenex_93 (store (select .cse13 .cse9) |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_prenex_93 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_91))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_77 Int) (v_ArrVal_2487 Int) (v_prenex_79 (Array Int Int)) (v_prenex_78 (Array Int Int))) (let ((.cse14 (store .cse3 v_prenex_77 v_prenex_79)) (.cse15 (select v_prenex_79 4))) (or (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (not (= (store (select .cse14 .cse15) |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_prenex_78 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_prenex_78)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse15)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_77) (= (select (select (let ((.cse16 (store .cse7 v_prenex_77 v_arrayElimArr_6))) (store .cse16 .cse15 (store (select .cse16 .cse15) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2487))) (select (select (store .cse14 .cse15 v_prenex_78) v_prenex_77) 4)) 4) 0)))) (forall ((v_prenex_85 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_prenex_87 Int) (v_prenex_86 Int) (v_prenex_88 (Array Int Int))) (let ((.cse18 (store .cse3 v_prenex_86 v_prenex_89)) (.cse17 (select v_prenex_89 4))) (or (not (= .cse17 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (not (= (select v_prenex_85 4) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (not (= v_prenex_88 (store (select .cse18 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_prenex_88 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_86) (= 0 (select (select (let ((.cse19 (store .cse7 v_prenex_86 v_prenex_85))) (store .cse19 .cse17 (store (select .cse19 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_prenex_87))) (select (select (store .cse18 .cse17 v_prenex_88) v_prenex_86) 4)) 4)))))))) is different from false [2023-11-06 22:11:19,799 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_prenex_77 Int) (v_ArrVal_2487 Int) (v_prenex_79 (Array Int Int)) (v_prenex_78 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) v_prenex_77 v_prenex_79)) (.cse1 (select v_prenex_79 4))) (or (not (= (store (select .cse0 .cse1) |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_prenex_78 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_prenex_78)) (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse1)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_77) (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_17) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_prenex_77 v_arrayElimArr_6))) (store .cse2 .cse1 (store (select .cse2 .cse1) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2487))) (select (select (store .cse0 .cse1 v_prenex_78) v_prenex_77) 4)) 4) 0)))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_prenex_85 (Array Int Int)) (v_prenex_87 Int) (v_prenex_89 (Array Int Int)) (v_prenex_86 Int) (v_prenex_88 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) v_prenex_86 v_prenex_89)) (.cse7 (select v_prenex_89 4))) (or (not (= (store (select .cse6 .cse7) |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_prenex_88 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_prenex_88)) (not (= .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_17) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_prenex_86 v_prenex_85))) (store .cse8 .cse7 (store (select .cse8 .cse7) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_prenex_87))) (select (select (store .cse6 .cse7 v_prenex_88) v_prenex_86) 4)) 4) 0) (not (= (select v_prenex_85 4) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_86)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_58| Int) (v_DerPreprocessor_18 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_58| v_ArrVal_2484)) (.cse10 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse9 .cse10) |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (= (select (let ((.cse11 (store .cse9 .cse10 v_ArrVal_2489))) (select .cse11 (select (select .cse11 |v_ULTIMATE.start_node_create_~temp~0#1.base_58|) 4))) 4) 0) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse10)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_58|)))) (forall ((v_prenex_83 (Array Int Int)) (v_prenex_80 (Array Int Int)) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_prenex_84 (Array Int Int)) (v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse14 (select v_prenex_80 4)) (.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) v_prenex_81 v_prenex_84)) (.cse13 (select v_prenex_84 4))) (or (not (= v_prenex_83 (store (select .cse12 .cse13) |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_prenex_83 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (not (= .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (= (select (select (let ((.cse15 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_17) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_prenex_81 v_prenex_80))) (store .cse15 .cse13 (store (select .cse15 .cse13) .cse14 v_prenex_82))) (select (select (store .cse12 .cse13 v_prenex_83) v_prenex_81) 4)) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_81) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse13))))) (forall ((v_prenex_94 (Array Int Int)) (v_prenex_93 (Array Int Int)) (v_arrayElimCell_150 Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_prenex_90 (Array Int Int)) (v_prenex_92 Int) (v_prenex_91 Int)) (let ((.cse20 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_18) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) v_prenex_91 v_prenex_94)) (.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_17) .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_prenex_91 v_prenex_90)) (.cse17 (select v_prenex_94 4))) (let ((.cse18 (select .cse16 .cse17)) (.cse19 (select (select (store .cse20 .cse17 v_prenex_93) v_prenex_91) 4))) (or (not (= (select v_prenex_90 4) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (= (select (select (store .cse16 .cse17 (store .cse18 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_prenex_92)) .cse19) 4) 0) (not (= (store (select .cse20 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_prenex_93 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_prenex_93)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse17)) (= (select (select (store .cse16 .cse17 (store .cse18 v_arrayElimCell_150 v_prenex_92)) .cse19) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_91))))))) is different from false [2023-11-06 22:11:19,841 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:11:19,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:19,845 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:11:19,859 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:19,859 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 53 [2023-11-06 22:11:19,867 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:11:19,875 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:19,875 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2023-11-06 22:11:19,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:11:19,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-11-06 22:11:19,885 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 6 treesize of output 4 [2023-11-06 22:11:19,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:11:19,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-11-06 22:11:19,893 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:19,893 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 13 [2023-11-06 22:11:19,895 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-06 22:11:19,904 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:19,904 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 43 treesize of output 43 [2023-11-06 22:11:19,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:11:19,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:11:19,928 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:11:19,928 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2023-11-06 22:11:19,934 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:11:19,944 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:19,944 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 60 [2023-11-06 22:11:19,948 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:11:19,952 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-06 22:11:19,961 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:19,961 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 1 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:11:19,965 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 22:11:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2023-11-06 22:11:19,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534652705] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:11:19,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:11:19,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 33] total 74 [2023-11-06 22:11:19,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130793348] [2023-11-06 22:11:19,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:11:19,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-06 22:11:19,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:19,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-06 22:11:19,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3563, Unknown=28, NotChecked=1572, Total=5402 [2023-11-06 22:11:19,990 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 74 states, 74 states have (on average 2.2162162162162162) internal successors, (164), 74 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:25,853 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse18 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse0 (not .cse18)) (.cse10 (not (= .cse11 0)))) (and (or .cse0 (forall ((v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse1 (select v_ArrVal_2484 4))) (or (not (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse2 (store .cse3 .cse1 v_ArrVal_2489))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (store (select .cse3 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)))))) (or (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse5 (select v_ArrVal_2484 4))) (let ((.cse6 (select .cse4 .cse5)) (.cse9 (select v_arrayElimArr_6 4)) (.cse7 (select (select (store .cse8 .cse5 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse4 .cse5 (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse7) 4) 0) (not (= (select v_arrayElimArr_6 0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse8 .cse5) .cse9 (select v_ArrVal_2489 .cse9)) v_ArrVal_2489)) (= (select (select (store .cse4 .cse5 (store .cse6 .cse9 v_ArrVal_2487)) .cse7) 4) 0))))) .cse10) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_6 .cse11))) (forall ((v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse13 (select v_ArrVal_2484 4))) (let ((.cse14 (select .cse12 .cse13)) (.cse17 (select v_arrayElimArr_6 4)) (.cse15 (select (select (store .cse16 .cse13 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2484 .cse11))) (= (select (select (store .cse12 .cse13 (store .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse15) 4) 0) (not (= (store (select .cse16 .cse13) .cse17 (select v_ArrVal_2489 .cse17)) v_ArrVal_2489)) (= (select (select (store .cse12 .cse13 (store .cse14 .cse17 v_ArrVal_2487)) .cse15) 4) 0)))))))) .cse18) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or .cse18 (and (forall ((v_arrayElimCell_151 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse20 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse19 .cse20) v_arrayElimCell_151 (select v_ArrVal_2489 v_arrayElimCell_151)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2484 .cse11))) (= (select (let ((.cse21 (store .cse19 .cse20 v_ArrVal_2489))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse23 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse22 .cse23) v_arrayElimCell_151 (select v_ArrVal_2489 v_arrayElimCell_151)))) (= (select (let ((.cse24 (store .cse22 .cse23 v_ArrVal_2489))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) .cse10))) (or .cse0 (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse25 (select v_ArrVal_2484 4))) (or (not (= .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse26 .cse25 (store (select .cse26 .cse25) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487))) (select (select (store .cse27 .cse25 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse27 .cse25) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489))))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimCell_150 Int) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse28 (select v_ArrVal_2484 4))) (let ((.cse30 (select .cse29 .cse28)) (.cse31 (select (select (store .cse32 .cse28 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse29 .cse28 (store .cse30 v_arrayElimCell_150 v_ArrVal_2487)) .cse31) 4) 0) (= (select (select (store .cse29 .cse28 (store .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse31) 4) 0) (not (= (store (select .cse32 .cse28) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)))))) (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (or .cse0 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse33 (select v_ArrVal_2484 4)) (.cse35 (select v_arrayElimArr_6 4))) (or (not (= .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse34 .cse33 (store (select .cse34 .cse33) .cse35 v_ArrVal_2487))) (select (select (store .cse36 .cse33 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse36 .cse33) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)) (not (= .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse0 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse37 (select v_ArrVal_2484 4))) (or (not (= .cse37 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse38 .cse37 (store (select .cse38 .cse37) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487))) (select (select (store .cse39 .cse37 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse39 .cse37) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)) (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) .cse18 (or (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse42 (select v_arrayElimArr_6 4)) (.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse41 (select v_ArrVal_2484 4))) (or (not (= (store (select .cse40 .cse41) .cse42 (select v_ArrVal_2489 .cse42)) v_ArrVal_2489)) (= (select (select (let ((.cse43 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse43 .cse41 (store (select .cse43 .cse41) .cse42 v_ArrVal_2487))) (select (select (store .cse40 .cse41 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse45 (select v_ArrVal_2484 4))) (let ((.cse46 (select .cse44 .cse45)) (.cse49 (select v_arrayElimArr_6 4)) (.cse47 (select (select (store .cse48 .cse45 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse44 .cse45 (store .cse46 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse47) 4) 0) (not (= (store (select .cse48 .cse45) .cse49 (select v_ArrVal_2489 .cse49)) v_ArrVal_2489)) (= (select (select (store .cse44 .cse45 (store .cse46 .cse49 v_ArrVal_2487)) .cse47) 4) 0))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse51 (select v_ArrVal_2484 4))) (let ((.cse52 (select .cse50 .cse51)) (.cse55 (select v_arrayElimArr_6 4)) (.cse53 (select (select (store .cse54 .cse51 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse50 .cse51 (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse53) 4) 0) (not (= (store (select .cse54 .cse51) .cse55 (select v_ArrVal_2489 .cse55)) v_ArrVal_2489)) (= (select (select (store .cse50 .cse51 (store .cse52 .cse55 v_ArrVal_2487)) .cse53) 4) 0) (not (= (select v_ArrVal_2484 0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse58 (select v_arrayElimArr_6 4)) (.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse57 (select v_ArrVal_2484 4))) (or (not (= (store (select .cse56 .cse57) .cse58 (select v_ArrVal_2489 .cse58)) v_ArrVal_2489)) (= (select (select (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse59 .cse57 (store (select .cse59 .cse57) .cse58 v_ArrVal_2487))) (select (select (store .cse56 .cse57 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_ArrVal_2484 0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) .cse10) (or (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse62 (select v_arrayElimArr_6 4)) (.cse60 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse61 (select v_ArrVal_2484 4))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2484 .cse11))) (not (= (store (select .cse60 .cse61) .cse62 (select v_ArrVal_2489 .cse62)) v_ArrVal_2489)) (= (select (select (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse63 .cse61 (store (select .cse63 .cse61) .cse62 v_ArrVal_2487))) (select (select (store .cse60 .cse61 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_6 .cse11))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse66 (select v_arrayElimArr_6 4)) (.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse65 (select v_ArrVal_2484 4))) (or (not (= (select v_arrayElimArr_6 0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse64 .cse65) .cse66 (select v_ArrVal_2489 .cse66)) v_ArrVal_2489)) (= (select (select (let ((.cse67 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse67 .cse65 (store (select .cse67 .cse65) .cse66 v_ArrVal_2487))) (select (select (store .cse64 .cse65 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse10)) .cse18) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from false [2023-11-06 22:11:25,965 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse18 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse0 (not .cse18)) (.cse10 (not (= .cse11 0)))) (and (or .cse0 (forall ((v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse1 (select v_ArrVal_2484 4))) (or (not (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse2 (store .cse3 .cse1 v_ArrVal_2489))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (store (select .cse3 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)))))) (or (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse5 (select v_ArrVal_2484 4))) (let ((.cse6 (select .cse4 .cse5)) (.cse9 (select v_arrayElimArr_6 4)) (.cse7 (select (select (store .cse8 .cse5 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse4 .cse5 (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse7) 4) 0) (not (= (select v_arrayElimArr_6 0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse8 .cse5) .cse9 (select v_ArrVal_2489 .cse9)) v_ArrVal_2489)) (= (select (select (store .cse4 .cse5 (store .cse6 .cse9 v_ArrVal_2487)) .cse7) 4) 0))))) .cse10) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_6 .cse11))) (forall ((v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse13 (select v_ArrVal_2484 4))) (let ((.cse14 (select .cse12 .cse13)) (.cse17 (select v_arrayElimArr_6 4)) (.cse15 (select (select (store .cse16 .cse13 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2484 .cse11))) (= (select (select (store .cse12 .cse13 (store .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse15) 4) 0) (not (= (store (select .cse16 .cse13) .cse17 (select v_ArrVal_2489 .cse17)) v_ArrVal_2489)) (= (select (select (store .cse12 .cse13 (store .cse14 .cse17 v_ArrVal_2487)) .cse15) 4) 0)))))))) .cse18) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or .cse18 (and (forall ((v_arrayElimCell_151 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse20 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse19 .cse20) v_arrayElimCell_151 (select v_ArrVal_2489 v_arrayElimCell_151)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2484 .cse11))) (= (select (let ((.cse21 (store .cse19 .cse20 v_ArrVal_2489))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse23 (select v_ArrVal_2484 4))) (or (not (= v_ArrVal_2489 (store (select .cse22 .cse23) v_arrayElimCell_151 (select v_ArrVal_2489 v_arrayElimCell_151)))) (= (select (let ((.cse24 (store .cse22 .cse23 v_ArrVal_2489))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) .cse10))) (or .cse0 (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse25 (select v_ArrVal_2484 4))) (or (not (= .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse26 .cse25 (store (select .cse26 .cse25) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487))) (select (select (store .cse27 .cse25 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse27 .cse25) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489))))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimCell_150 Int) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse28 (select v_ArrVal_2484 4))) (let ((.cse30 (select .cse29 .cse28)) (.cse31 (select (select (store .cse32 .cse28 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store .cse29 .cse28 (store .cse30 v_arrayElimCell_150 v_ArrVal_2487)) .cse31) 4) 0) (= (select (select (store .cse29 .cse28 (store .cse30 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse31) 4) 0) (not (= (store (select .cse32 .cse28) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)))))) (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (or .cse0 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse33 (select v_ArrVal_2484 4)) (.cse35 (select v_arrayElimArr_6 4))) (or (not (= .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse34 .cse33 (store (select .cse34 .cse33) .cse35 v_ArrVal_2487))) (select (select (store .cse36 .cse33 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse36 .cse33) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)) (not (= .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse0 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse37 (select v_ArrVal_2484 4))) (or (not (= .cse37 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse38 .cse37 (store (select .cse38 .cse37) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487))) (select (select (store .cse39 .cse37 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse39 .cse37) |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_ArrVal_2489 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2489)) (not (= (select v_arrayElimArr_6 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) .cse18 (or (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse42 (select v_arrayElimArr_6 4)) (.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse41 (select v_ArrVal_2484 4))) (or (not (= (store (select .cse40 .cse41) .cse42 (select v_ArrVal_2489 .cse42)) v_ArrVal_2489)) (= (select (select (let ((.cse43 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse43 .cse41 (store (select .cse43 .cse41) .cse42 v_ArrVal_2487))) (select (select (store .cse40 .cse41 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse45 (select v_ArrVal_2484 4))) (let ((.cse46 (select .cse44 .cse45)) (.cse49 (select v_arrayElimArr_6 4)) (.cse47 (select (select (store .cse48 .cse45 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse44 .cse45 (store .cse46 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse47) 4) 0) (not (= (store (select .cse48 .cse45) .cse49 (select v_ArrVal_2489 .cse49)) v_ArrVal_2489)) (= (select (select (store .cse44 .cse45 (store .cse46 .cse49 v_ArrVal_2487)) .cse47) 4) 0))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6)) (.cse51 (select v_ArrVal_2484 4))) (let ((.cse52 (select .cse50 .cse51)) (.cse55 (select v_arrayElimArr_6 4)) (.cse53 (select (select (store .cse54 .cse51 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select (store .cse50 .cse51 (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2487)) .cse53) 4) 0) (not (= (store (select .cse54 .cse51) .cse55 (select v_ArrVal_2489 .cse55)) v_ArrVal_2489)) (= (select (select (store .cse50 .cse51 (store .cse52 .cse55 v_ArrVal_2487)) .cse53) 4) 0) (not (= (select v_ArrVal_2484 0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse58 (select v_arrayElimArr_6 4)) (.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse57 (select v_ArrVal_2484 4))) (or (not (= (store (select .cse56 .cse57) .cse58 (select v_ArrVal_2489 .cse58)) v_ArrVal_2489)) (= (select (select (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse59 .cse57 (store (select .cse59 .cse57) .cse58 v_ArrVal_2487))) (select (select (store .cse56 .cse57 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_ArrVal_2484 0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) .cse10) (or (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_2487 Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse62 (select v_arrayElimArr_6 4)) (.cse60 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse61 (select v_ArrVal_2484 4))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_ArrVal_2484 .cse11))) (not (= (store (select .cse60 .cse61) .cse62 (select v_ArrVal_2489 .cse62)) v_ArrVal_2489)) (= (select (select (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse63 .cse61 (store (select .cse63 .cse61) .cse62 v_ArrVal_2487))) (select (select (store .cse60 .cse61 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| (select v_arrayElimArr_6 .cse11))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2487 Int) (v_ArrVal_2484 (Array Int Int))) (let ((.cse66 (select v_arrayElimArr_6 4)) (.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2484)) (.cse65 (select v_ArrVal_2484 4))) (or (not (= (select v_arrayElimArr_6 0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (store (select .cse64 .cse65) .cse66 (select v_ArrVal_2489 .cse66)) v_ArrVal_2489)) (= (select (select (let ((.cse67 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse67 .cse65 (store (select .cse67 .cse65) .cse66 v_ArrVal_2487))) (select (select (store .cse64 .cse65 v_ArrVal_2489) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse10)) .cse18) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from false