./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0504.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/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_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0504.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/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_7efbf04d-53c6-4983-a258-bd273506587d/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 cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:04:24,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:04:24,222 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:04:24,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:04:24,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:04:24,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:04:24,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:04:24,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:04:24,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:04:24,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:04:24,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:04:24,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:04:24,287 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:04:24,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:04:24,290 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:04:24,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:04:24,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:04:24,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:04:24,292 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:04:24,292 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:04:24,293 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:04:24,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:04:24,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:04:24,307 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:04:24,307 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:04:24,308 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:04:24,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:04:24,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:04:24,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:04:24,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:24,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:04:24,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:04:24,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:04:24,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:04:24,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:04:24,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:04:24,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:04:24,312 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:04:24,313 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_7efbf04d-53c6-4983-a258-bd273506587d/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_7efbf04d-53c6-4983-a258-bd273506587d/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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2023-11-06 23:04:24,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:04:24,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:04:24,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:04:24,628 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:04:24,629 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:04:24,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/memsafety/test-0504.i [2023-11-06 23:04:27,799 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:04:28,085 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:04:28,085 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/sv-benchmarks/c/memsafety/test-0504.i [2023-11-06 23:04:28,099 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/data/8409a2578/2f1043d1e74340d29905373933205797/FLAGe6b3eaaa3 [2023-11-06 23:04:28,114 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/data/8409a2578/2f1043d1e74340d29905373933205797 [2023-11-06 23:04:28,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:04:28,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:04:28,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:28,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:04:28,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:04:28,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278012c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28, skipping insertion in model container [2023-11-06 23:04:28,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,195 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:04:28,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:28,540 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:04:28,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:28,651 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:04:28,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28 WrapperNode [2023-11-06 23:04:28,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:28,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:28,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:04:28,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:04:28,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,700 INFO L138 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 90 [2023-11-06 23:04:28,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:28,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:04:28,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:04:28,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:04:28,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:04:28,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:04:28,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:04:28,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:04:28,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (1/1) ... [2023-11-06 23:04:28,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:28,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:28,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:04:28,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:04:28,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:04:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 23:04:28,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:04:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 23:04:28,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 23:04:28,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:04:28,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:04:28,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:04:28,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:04:29,005 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:04:29,007 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:04:29,396 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:04:29,403 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:04:29,404 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 23:04:29,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:29 BoogieIcfgContainer [2023-11-06 23:04:29,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:04:29,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:04:29,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:04:29,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:04:29,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:04:28" (1/3) ... [2023-11-06 23:04:29,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbd2c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:29, skipping insertion in model container [2023-11-06 23:04:29,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:28" (2/3) ... [2023-11-06 23:04:29,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbd2c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:29, skipping insertion in model container [2023-11-06 23:04:29,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:29" (3/3) ... [2023-11-06 23:04:29,416 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0504.i [2023-11-06 23:04:29,435 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:04:29,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-06 23:04:29,480 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:04:29,487 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;@28ffaef7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:04:29,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-06 23:04:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 46 states have (on average 2.130434782608696) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 23:04:29,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:29,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:04:29,500 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:29,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash 28781372, now seen corresponding path program 1 times [2023-11-06 23:04:29,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:29,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058822501] [2023-11-06 23:04:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:29,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,638 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 23:04:29,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:29,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058822501] [2023-11-06 23:04:29,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058822501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:29,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:29,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:29,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209471863] [2023-11-06 23:04:29,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:29,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:04:29,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:29,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:04:29,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:04:29,680 INFO L87 Difference]: Start difference. First operand has 88 states, 46 states have (on average 2.130434782608696) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 23:04:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:29,700 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2023-11-06 23:04:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:04:29,702 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 23:04:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:29,711 INFO L225 Difference]: With dead ends: 88 [2023-11-06 23:04:29,711 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 23:04:29,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:04:29,717 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:29,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:04:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 23:04:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-06 23:04:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 2.0) internal successors, (90), 85 states have internal predecessors, (90), 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 23:04:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2023-11-06 23:04:29,757 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 5 [2023-11-06 23:04:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:29,758 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2023-11-06 23:04:29,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 23:04:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2023-11-06 23:04:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 23:04:29,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:29,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:04:29,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:04:29,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:29,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:29,761 INFO L85 PathProgramCache]: Analyzing trace with hash 889572136, now seen corresponding path program 1 times [2023-11-06 23:04:29,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:29,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911362050] [2023-11-06 23:04:29,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:29,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,837 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 23:04:29,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:29,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911362050] [2023-11-06 23:04:29,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911362050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:29,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:29,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:29,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210666009] [2023-11-06 23:04:29,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:29,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:29,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:29,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:29,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:29,842 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:04:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:29,874 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2023-11-06 23:04:29,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:29,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-06 23:04:29,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:29,877 INFO L225 Difference]: With dead ends: 134 [2023-11-06 23:04:29,877 INFO L226 Difference]: Without dead ends: 134 [2023-11-06 23:04:29,878 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 23:04:29,879 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 49 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:29,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:04:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-06 23:04:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 110. [2023-11-06 23:04:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 2.028985507246377) internal successors, (140), 109 states have internal predecessors, (140), 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 23:04:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2023-11-06 23:04:29,895 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 6 [2023-11-06 23:04:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:29,895 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2023-11-06 23:04:29,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:04:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2023-11-06 23:04:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 23:04:29,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:29,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:04:29,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:04:29,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:29,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2023-11-06 23:04:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:29,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998559455] [2023-11-06 23:04:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:30,032 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 23:04:30,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:30,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998559455] [2023-11-06 23:04:30,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998559455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:30,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:30,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:30,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228778810] [2023-11-06 23:04:30,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:30,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:30,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:30,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:30,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:30,039 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:04:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:30,155 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2023-11-06 23:04:30,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:30,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-06 23:04:30,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:30,158 INFO L225 Difference]: With dead ends: 102 [2023-11-06 23:04:30,158 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 23:04:30,158 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 23:04:30,160 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:30,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 71 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 23:04:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-06 23:04:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.8115942028985508) 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 23:04:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2023-11-06 23:04:30,170 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 6 [2023-11-06 23:04:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:30,171 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2023-11-06 23:04:30,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:04:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2023-11-06 23:04:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 23:04:30,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:30,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:04:30,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:04:30,173 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:30,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:30,174 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2023-11-06 23:04:30,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:30,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019735995] [2023-11-06 23:04:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:30,288 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 23:04:30,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:30,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019735995] [2023-11-06 23:04:30,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019735995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:30,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:30,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:30,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098828230] [2023-11-06 23:04:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:30,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:30,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:30,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:30,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:30,294 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:04:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:30,405 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2023-11-06 23:04:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:30,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-06 23:04:30,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:30,410 INFO L225 Difference]: With dead ends: 109 [2023-11-06 23:04:30,411 INFO L226 Difference]: Without dead ends: 109 [2023-11-06 23:04:30,411 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 23:04:30,421 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 15 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:30,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 104 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:30,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-06 23:04:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2023-11-06 23:04:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 101 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 23:04:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2023-11-06 23:04:30,436 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 6 [2023-11-06 23:04:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:30,437 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2023-11-06 23:04:30,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:04:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2023-11-06 23:04:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 23:04:30,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:30,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:30,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:04:30,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:30,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1806931840, now seen corresponding path program 1 times [2023-11-06 23:04:30,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:30,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313847114] [2023-11-06 23:04:30,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:30,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:30,497 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 23:04:30,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:30,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313847114] [2023-11-06 23:04:30,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313847114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:30,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:30,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:30,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394206169] [2023-11-06 23:04:30,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:30,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:30,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:30,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:30,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:30,500 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 23:04:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:30,602 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2023-11-06 23:04:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-11-06 23:04:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:30,604 INFO L225 Difference]: With dead ends: 104 [2023-11-06 23:04:30,605 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 23:04:30,605 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 23:04:30,606 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:30,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 23:04:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-06 23:04:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 100 states have internal predecessors, (122), 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 23:04:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2023-11-06 23:04:30,614 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 7 [2023-11-06 23:04:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:30,614 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2023-11-06 23:04:30,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 23:04:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2023-11-06 23:04:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 23:04:30,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:30,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:30,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:04:30,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:30,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1857997403, now seen corresponding path program 1 times [2023-11-06 23:04:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:30,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574724631] [2023-11-06 23:04:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:30,991 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 23:04:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:30,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574724631] [2023-11-06 23:04:30,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574724631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:30,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:30,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816387336] [2023-11-06 23:04:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:30,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:30,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:30,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:30,995 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 23:04:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:31,127 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2023-11-06 23:04:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:04:31,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2023-11-06 23:04:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:31,129 INFO L225 Difference]: With dead ends: 98 [2023-11-06 23:04:31,129 INFO L226 Difference]: Without dead ends: 98 [2023-11-06 23:04:31,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:31,130 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 50 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:31,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-06 23:04:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2023-11-06 23:04:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.588235294117647) internal successors, (108), 92 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 23:04:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2023-11-06 23:04:31,137 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 15 [2023-11-06 23:04:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:31,138 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2023-11-06 23:04:31,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 23:04:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2023-11-06 23:04:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 23:04:31,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:31,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:31,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:04:31,139 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:31,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344638, now seen corresponding path program 1 times [2023-11-06 23:04:31,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:31,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302267102] [2023-11-06 23:04:31,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:31,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,244 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 23:04:31,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:31,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302267102] [2023-11-06 23:04:31,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302267102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:31,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:31,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:31,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192080074] [2023-11-06 23:04:31,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:31,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:31,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:31,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:31,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:31,246 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 23:04:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:31,314 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2023-11-06 23:04:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:31,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 23:04:31,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:31,315 INFO L225 Difference]: With dead ends: 89 [2023-11-06 23:04:31,315 INFO L226 Difference]: Without dead ends: 89 [2023-11-06 23:04:31,316 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 23:04:31,317 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:31,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-06 23:04:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-06 23:04:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 88 states have internal predecessors, (100), 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 23:04:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2023-11-06 23:04:31,335 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 16 [2023-11-06 23:04:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:31,335 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2023-11-06 23:04:31,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 23:04:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2023-11-06 23:04:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 23:04:31,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:31,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:31,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:04:31,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:31,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:31,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344639, now seen corresponding path program 1 times [2023-11-06 23:04:31,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:31,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114315457] [2023-11-06 23:04:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:31,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,478 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 23:04:31,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:31,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114315457] [2023-11-06 23:04:31,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114315457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:31,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:31,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886546931] [2023-11-06 23:04:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:31,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:31,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:31,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:31,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:31,481 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 23:04:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:31,550 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2023-11-06 23:04:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:31,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 23:04:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:31,552 INFO L225 Difference]: With dead ends: 85 [2023-11-06 23:04:31,552 INFO L226 Difference]: Without dead ends: 85 [2023-11-06 23:04:31,553 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 23:04:31,554 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:31,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 90 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-06 23:04:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-06 23:04:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 84 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 23:04:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-11-06 23:04:31,569 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2023-11-06 23:04:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:31,570 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-11-06 23:04:31,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 23:04:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-11-06 23:04:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 23:04:31,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:31,573 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:31,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:04:31,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:31,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash -796866651, now seen corresponding path program 1 times [2023-11-06 23:04:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:31,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183126729] [2023-11-06 23:04:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:31,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:31,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183126729] [2023-11-06 23:04:31,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183126729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:31,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:31,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:31,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730555090] [2023-11-06 23:04:31,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:31,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:31,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:31,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:31,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:31,674 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) 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 23:04:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:31,804 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2023-11-06 23:04:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) 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 19 [2023-11-06 23:04:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:31,808 INFO L225 Difference]: With dead ends: 93 [2023-11-06 23:04:31,808 INFO L226 Difference]: Without dead ends: 93 [2023-11-06 23:04:31,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 23:04:31,811 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 54 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:31,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 92 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-06 23:04:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2023-11-06 23:04:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 86 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 23:04:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2023-11-06 23:04:31,823 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 19 [2023-11-06 23:04:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:31,824 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2023-11-06 23:04:31,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) 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 23:04:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2023-11-06 23:04:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 23:04:31,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:31,826 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:31,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:04:31,826 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:31,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:31,827 INFO L85 PathProgramCache]: Analyzing trace with hash -796866650, now seen corresponding path program 1 times [2023-11-06 23:04:31,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:31,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77388376] [2023-11-06 23:04:31,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:31,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:31,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:31,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77388376] [2023-11-06 23:04:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77388376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:31,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:31,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:31,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045366387] [2023-11-06 23:04:31,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:31,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:31,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:31,995 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) 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 23:04:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:32,119 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2023-11-06 23:04:32,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:32,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) 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 19 [2023-11-06 23:04:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:32,121 INFO L225 Difference]: With dead ends: 123 [2023-11-06 23:04:32,121 INFO L226 Difference]: Without dead ends: 123 [2023-11-06 23:04:32,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 23:04:32,122 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 32 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:32,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 123 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-06 23:04:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2023-11-06 23:04:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.372340425531915) internal successors, (129), 110 states have internal predecessors, (129), 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 23:04:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2023-11-06 23:04:32,127 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 19 [2023-11-06 23:04:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:32,127 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2023-11-06 23:04:32,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) 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 23:04:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2023-11-06 23:04:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 23:04:32,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:32,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:32,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:04:32,129 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:32,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash 55140128, now seen corresponding path program 1 times [2023-11-06 23:04:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:32,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270574571] [2023-11-06 23:04:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:32,379 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 23:04:32,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:32,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270574571] [2023-11-06 23:04:32,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270574571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:32,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:32,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:04:32,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237308619] [2023-11-06 23:04:32,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:32,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:04:32,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:32,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:04:32,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:32,382 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:32,574 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2023-11-06 23:04:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:04:32,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-06 23:04:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:32,576 INFO L225 Difference]: With dead ends: 140 [2023-11-06 23:04:32,576 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 23:04:32,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:32,577 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:32,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 184 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 23:04:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 123. [2023-11-06 23:04:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.349056603773585) internal successors, (143), 122 states have internal predecessors, (143), 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 23:04:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2023-11-06 23:04:32,582 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 19 [2023-11-06 23:04:32,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:32,582 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2023-11-06 23:04:32,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2023-11-06 23:04:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 23:04:32,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:32,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:32,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:04:32,583 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:32,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash 55140129, now seen corresponding path program 1 times [2023-11-06 23:04:32,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:32,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099302028] [2023-11-06 23:04:32,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,258 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 23:04:33,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099302028] [2023-11-06 23:04:33,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099302028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:33,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:33,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:04:33,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23033074] [2023-11-06 23:04:33,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:33,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:04:33,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:33,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:04:33,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:33,261 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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 23:04:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:33,683 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2023-11-06 23:04:33,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:04:33,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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 19 [2023-11-06 23:04:33,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:33,684 INFO L225 Difference]: With dead ends: 137 [2023-11-06 23:04:33,684 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 23:04:33,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:04:33,686 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 109 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:33,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 222 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:33,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 23:04:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2023-11-06 23:04:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.330188679245283) internal successors, (141), 122 states have internal predecessors, (141), 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 23:04:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2023-11-06 23:04:33,690 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 19 [2023-11-06 23:04:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:33,690 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2023-11-06 23:04:33,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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 23:04:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2023-11-06 23:04:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 23:04:33,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:33,691 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:33,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:04:33,692 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:33,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1066936995, now seen corresponding path program 1 times [2023-11-06 23:04:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745866805] [2023-11-06 23:04:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:33,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745866805] [2023-11-06 23:04:33,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745866805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:33,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:33,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:33,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479175608] [2023-11-06 23:04:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:33,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:33,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:33,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:33,765 INFO L87 Difference]: Start difference. First operand 123 states and 141 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 23:04:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:33,833 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-11-06 23:04:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:33,834 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 20 [2023-11-06 23:04:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:33,835 INFO L225 Difference]: With dead ends: 127 [2023-11-06 23:04:33,835 INFO L226 Difference]: Without dead ends: 127 [2023-11-06 23:04:33,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 23:04:33,836 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:33,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 139 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-06 23:04:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2023-11-06 23:04:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 121 states have internal predecessors, (135), 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 23:04:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2023-11-06 23:04:33,842 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 20 [2023-11-06 23:04:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:33,842 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2023-11-06 23:04:33,843 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 23:04:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2023-11-06 23:04:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 23:04:33,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:33,844 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:33,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:04:33,845 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:33,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1284670490, now seen corresponding path program 1 times [2023-11-06 23:04:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:33,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301259242] [2023-11-06 23:04:33,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:33,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:04:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301259242] [2023-11-06 23:04:33,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301259242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:33,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337933764] [2023-11-06 23:04:33,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:33,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:33,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:33,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:33,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:33,917 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) 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 23:04:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:34,018 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2023-11-06 23:04:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:34,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) 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 21 [2023-11-06 23:04:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:34,020 INFO L225 Difference]: With dead ends: 137 [2023-11-06 23:04:34,020 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 23:04:34,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 23:04:34,022 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:34,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 101 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 23:04:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2023-11-06 23:04:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.2935779816513762) internal successors, (141), 124 states have internal predecessors, (141), 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 23:04:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2023-11-06 23:04:34,027 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 21 [2023-11-06 23:04:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:34,027 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2023-11-06 23:04:34,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) 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 23:04:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2023-11-06 23:04:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 23:04:34,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:34,029 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:34,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:04:34,030 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:34,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:34,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1284670489, now seen corresponding path program 1 times [2023-11-06 23:04:34,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:34,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993718048] [2023-11-06 23:04:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:34,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:34,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993718048] [2023-11-06 23:04:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993718048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:34,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:34,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521599063] [2023-11-06 23:04:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:34,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:34,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:34,185 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:34,369 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2023-11-06 23:04:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:04:34,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-06 23:04:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:34,371 INFO L225 Difference]: With dead ends: 157 [2023-11-06 23:04:34,371 INFO L226 Difference]: Without dead ends: 157 [2023-11-06 23:04:34,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:34,374 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 48 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:34,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 128 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-06 23:04:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2023-11-06 23:04:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.322314049586777) internal successors, (160), 136 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 23:04:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2023-11-06 23:04:34,401 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 21 [2023-11-06 23:04:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:34,401 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2023-11-06 23:04:34,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2023-11-06 23:04:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 23:04:34,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:34,405 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:34,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:04:34,406 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:34,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash 835086795, now seen corresponding path program 1 times [2023-11-06 23:04:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:34,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720661989] [2023-11-06 23:04:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:34,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:34,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:34,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720661989] [2023-11-06 23:04:34,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720661989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:34,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:34,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:04:34,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354389025] [2023-11-06 23:04:34,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:34,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:04:34,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:34,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:04:34,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:34,727 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 23:04:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:34,939 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2023-11-06 23:04:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:04:34,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 24 [2023-11-06 23:04:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:34,941 INFO L225 Difference]: With dead ends: 159 [2023-11-06 23:04:34,941 INFO L226 Difference]: Without dead ends: 159 [2023-11-06 23:04:34,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:04:34,942 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:34,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 240 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-06 23:04:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2023-11-06 23:04:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 145 states have internal predecessors, (170), 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 23:04:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2023-11-06 23:04:34,948 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 24 [2023-11-06 23:04:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:34,948 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2023-11-06 23:04:34,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 23:04:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2023-11-06 23:04:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 23:04:34,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:34,953 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:34,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:04:34,954 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:34,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash 117885485, now seen corresponding path program 1 times [2023-11-06 23:04:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:34,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818356671] [2023-11-06 23:04:34,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:34,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:35,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:35,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818356671] [2023-11-06 23:04:35,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818356671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:35,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:35,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:35,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956953474] [2023-11-06 23:04:35,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:35,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:35,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:35,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:35,071 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 23:04:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:35,207 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2023-11-06 23:04:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:04:35,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2023-11-06 23:04:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:35,210 INFO L225 Difference]: With dead ends: 170 [2023-11-06 23:04:35,210 INFO L226 Difference]: Without dead ends: 170 [2023-11-06 23:04:35,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:35,212 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 70 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:35,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 185 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-06 23:04:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2023-11-06 23:04:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 144 states have (on average 1.3472222222222223) internal successors, (194), 159 states have internal predecessors, (194), 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 23:04:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2023-11-06 23:04:35,238 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 25 [2023-11-06 23:04:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:35,239 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2023-11-06 23:04:35,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 23:04:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2023-11-06 23:04:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 23:04:35,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:35,240 INFO L195 NwaCegarLoop]: trace histogram [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 23:04:35,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:04:35,241 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:35,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:35,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1356598818, now seen corresponding path program 1 times [2023-11-06 23:04:35,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:35,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038339445] [2023-11-06 23:04:35,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:35,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:35,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038339445] [2023-11-06 23:04:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038339445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475562038] [2023-11-06 23:04:35,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:35,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:35,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:35,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:35,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:04:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 23:04:35,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:36,006 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 23:04:36,012 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 23:04:36,044 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 23:04:36,051 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 23:04:36,077 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 19 treesize of output 18 [2023-11-06 23:04:36,086 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 23:04:36,154 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 23:04:36,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 23:04:36,192 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 23:04:36,201 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 23:04:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:36,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:36,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475562038] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:36,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:36,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 11 [2023-11-06 23:04:36,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429506347] [2023-11-06 23:04:36,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:36,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:04:36,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:36,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:04:36,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:04:36,577 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 23:04:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:36,887 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2023-11-06 23:04:36,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 23:04:36,888 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 23:04:36,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:36,889 INFO L225 Difference]: With dead ends: 186 [2023-11-06 23:04:36,889 INFO L226 Difference]: Without dead ends: 186 [2023-11-06 23:04:36,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-11-06 23:04:36,890 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 138 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:36,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 278 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-06 23:04:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 164. [2023-11-06 23:04:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 148 states have (on average 1.337837837837838) internal successors, (198), 163 states have internal predecessors, (198), 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 23:04:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2023-11-06 23:04:36,895 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 28 [2023-11-06 23:04:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:36,895 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2023-11-06 23:04:36,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 23:04:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2023-11-06 23:04:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 23:04:36,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:36,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:36,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:37,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 23:04:37,097 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:37,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:37,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1346664678, now seen corresponding path program 1 times [2023-11-06 23:04:37,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:37,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139184306] [2023-11-06 23:04:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:37,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:37,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:37,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139184306] [2023-11-06 23:04:37,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139184306] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:37,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215576543] [2023-11-06 23:04:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:37,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:37,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:37,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:37,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:04:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 23:04:37,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:37,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:04:37,467 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 23:04:37,467 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 23:04:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:37,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:37,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215576543] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:37,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:37,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-11-06 23:04:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664098131] [2023-11-06 23:04:37,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:37,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:04:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:37,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:04:37,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:37,705 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 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 23:04:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:37,864 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2023-11-06 23:04:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:37,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 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 23:04:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:37,866 INFO L225 Difference]: With dead ends: 184 [2023-11-06 23:04:37,866 INFO L226 Difference]: Without dead ends: 184 [2023-11-06 23:04:37,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:37,867 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 76 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:37,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 152 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-11-06 23:04:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2023-11-06 23:04:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 148 states have (on average 1.3243243243243243) internal successors, (196), 162 states have internal predecessors, (196), 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 23:04:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2023-11-06 23:04:37,872 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 28 [2023-11-06 23:04:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:37,872 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2023-11-06 23:04:37,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 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 23:04:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2023-11-06 23:04:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 23:04:37,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:37,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:37,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:38,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:38,085 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:38,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1346664677, now seen corresponding path program 1 times [2023-11-06 23:04:38,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:38,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662897011] [2023-11-06 23:04:38,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:38,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:38,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:38,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662897011] [2023-11-06 23:04:38,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662897011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:38,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14455762] [2023-11-06 23:04:38,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:38,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:38,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:38,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:38,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:04:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 23:04:38,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:38,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:04:38,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 23:04:38,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:04:38,576 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 23:04:38,584 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:04:38,584 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 23:04:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:38,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:39,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14455762] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:39,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:39,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2023-11-06 23:04:39,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37616073] [2023-11-06 23:04:39,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:39,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:04:39,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:39,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:04:39,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:39,036 INFO L87 Difference]: Start difference. First operand 163 states and 196 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 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 23:04:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:39,227 INFO L93 Difference]: Finished difference Result 183 states and 215 transitions. [2023-11-06 23:04:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:04:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 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 23:04:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:39,229 INFO L225 Difference]: With dead ends: 183 [2023-11-06 23:04:39,230 INFO L226 Difference]: Without dead ends: 183 [2023-11-06 23:04:39,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:04:39,230 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 247 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:39,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 114 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-06 23:04:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 162. [2023-11-06 23:04:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 148 states have (on average 1.3108108108108107) internal successors, (194), 161 states have internal predecessors, (194), 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 23:04:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2023-11-06 23:04:39,235 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 28 [2023-11-06 23:04:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:39,235 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2023-11-06 23:04:39,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 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 23:04:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2023-11-06 23:04:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 23:04:39,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:39,236 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:39,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:39,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:39,444 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:39,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 895109002, now seen corresponding path program 1 times [2023-11-06 23:04:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591367804] [2023-11-06 23:04:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:39,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:39,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591367804] [2023-11-06 23:04:39,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591367804] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:39,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073187949] [2023-11-06 23:04:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:39,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:39,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:39,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:39,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 23:04:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 23:04:39,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:39,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 23:04:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:39,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:39,848 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_43| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_43|))) (= (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_43| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-11-06 23:04:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 23:04:39,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073187949] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:39,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:39,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2023-11-06 23:04:39,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373443048] [2023-11-06 23:04:39,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:39,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:04:39,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:39,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:04:39,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-11-06 23:04:39,857 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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 23:04:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:40,060 INFO L93 Difference]: Finished difference Result 164 states and 195 transitions. [2023-11-06 23:04:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:04:40,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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 29 [2023-11-06 23:04:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:40,062 INFO L225 Difference]: With dead ends: 164 [2023-11-06 23:04:40,062 INFO L226 Difference]: Without dead ends: 152 [2023-11-06 23:04:40,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=53, Unknown=1, NotChecked=14, Total=90 [2023-11-06 23:04:40,063 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:40,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 222 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2023-11-06 23:04:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-06 23:04:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2023-11-06 23:04:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 138 states have (on average 1.326086956521739) internal successors, (183), 151 states have internal predecessors, (183), 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 23:04:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 183 transitions. [2023-11-06 23:04:40,067 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 183 transitions. Word has length 29 [2023-11-06 23:04:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:40,067 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 183 transitions. [2023-11-06 23:04:40,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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 23:04:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 183 transitions. [2023-11-06 23:04:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 23:04:40,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:40,069 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:40,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:40,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:40,276 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:40,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash -815532581, now seen corresponding path program 1 times [2023-11-06 23:04:40,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:40,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766049831] [2023-11-06 23:04:40,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:40,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:40,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:40,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766049831] [2023-11-06 23:04:40,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766049831] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:40,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112390698] [2023-11-06 23:04:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:40,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:40,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:40,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:40,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 23:04:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:41,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 23:04:41,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:41,053 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:04:41,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:04:41,111 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 23:04:41,120 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:04:41,124 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 23:04:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:41,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:41,450 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 23:04:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:41,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112390698] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:41,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:41,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 15 [2023-11-06 23:04:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556022177] [2023-11-06 23:04:41,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:41,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 23:04:41,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:41,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 23:04:41,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:04:41,498 INFO L87 Difference]: Start difference. First operand 152 states and 183 transitions. Second operand has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 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 23:04:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:41,930 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2023-11-06 23:04:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 23:04:41,932 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 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) Word has length 32 [2023-11-06 23:04:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:41,934 INFO L225 Difference]: With dead ends: 187 [2023-11-06 23:04:41,934 INFO L226 Difference]: Without dead ends: 187 [2023-11-06 23:04:41,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2023-11-06 23:04:41,935 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 163 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:41,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 282 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:04:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-06 23:04:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2023-11-06 23:04:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.3012820512820513) internal successors, (203), 169 states have internal predecessors, (203), 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 23:04:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2023-11-06 23:04:41,939 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 32 [2023-11-06 23:04:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:41,940 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2023-11-06 23:04:41,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 16 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 23:04:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2023-11-06 23:04:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 23:04:41,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:41,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:41,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:42,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 23:04:42,149 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:42,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:42,149 INFO L85 PathProgramCache]: Analyzing trace with hash 36474197, now seen corresponding path program 1 times [2023-11-06 23:04:42,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:42,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596772245] [2023-11-06 23:04:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:42,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596772245] [2023-11-06 23:04:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596772245] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241723729] [2023-11-06 23:04:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:42,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:42,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:42,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:42,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 23:04:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:42,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 23:04:42,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:42,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:04:42,681 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 23:04:42,706 INFO L322 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-06 23:04:42,707 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 23 treesize of output 24 [2023-11-06 23:04:42,771 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-06 23:04:42,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-06 23:04:42,814 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 23:04:42,814 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2023-11-06 23:04:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:42,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241723729] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:42,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:42,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-06 23:04:42,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670899754] [2023-11-06 23:04:42,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:42,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 23:04:42,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:42,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 23:04:42,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:04:42,964 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 23:04:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:43,388 INFO L93 Difference]: Finished difference Result 169 states and 201 transitions. [2023-11-06 23:04:43,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:04:43,390 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 32 [2023-11-06 23:04:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:43,391 INFO L225 Difference]: With dead ends: 169 [2023-11-06 23:04:43,391 INFO L226 Difference]: Without dead ends: 169 [2023-11-06 23:04:43,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2023-11-06 23:04:43,392 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:43,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 249 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:04:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-11-06 23:04:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2023-11-06 23:04:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 156 states have (on average 1.2884615384615385) internal successors, (201), 168 states have internal predecessors, (201), 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 23:04:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2023-11-06 23:04:43,396 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 32 [2023-11-06 23:04:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:43,396 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2023-11-06 23:04:43,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 23:04:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2023-11-06 23:04:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 23:04:43,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:43,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:43,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:43,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-06 23:04:43,610 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:43,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:43,611 INFO L85 PathProgramCache]: Analyzing trace with hash 36474198, now seen corresponding path program 1 times [2023-11-06 23:04:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:43,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072789395] [2023-11-06 23:04:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:44,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:44,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072789395] [2023-11-06 23:04:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072789395] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:44,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564031146] [2023-11-06 23:04:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:44,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:44,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:44,118 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:44,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 23:04:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:44,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 23:04:44,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:44,310 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 23:04:44,313 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:04:44,393 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 23:04:44,398 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 23:04:44,476 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 23:04:44,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-06 23:04:44,507 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 23:04:44,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 23:04:44,601 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-06 23:04:44,602 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-06 23:04:44,620 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-06 23:04:44,620 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 23:04:44,705 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 23:04:44,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2023-11-06 23:04:44,713 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 23:04:44,714 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 23:04:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:44,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564031146] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:45,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:45,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-11-06 23:04:45,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580789801] [2023-11-06 23:04:45,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:45,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 23:04:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 23:04:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:04:45,150 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 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 23:04:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:46,139 INFO L93 Difference]: Finished difference Result 181 states and 212 transitions. [2023-11-06 23:04:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:04:46,140 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 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) Word has length 32 [2023-11-06 23:04:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:46,141 INFO L225 Difference]: With dead ends: 181 [2023-11-06 23:04:46,141 INFO L226 Difference]: Without dead ends: 181 [2023-11-06 23:04:46,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2023-11-06 23:04:46,143 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 36 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:46,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 485 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:04:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-06 23:04:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 154. [2023-11-06 23:04:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.295774647887324) internal successors, (184), 153 states have internal predecessors, (184), 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 23:04:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 184 transitions. [2023-11-06 23:04:46,149 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 184 transitions. Word has length 32 [2023-11-06 23:04:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:46,149 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 184 transitions. [2023-11-06 23:04:46,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 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 23:04:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 184 transitions. [2023-11-06 23:04:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 23:04:46,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:46,151 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:46,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:46,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 23:04:46,352 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:46,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2042760996, now seen corresponding path program 1 times [2023-11-06 23:04:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632499114] [2023-11-06 23:04:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632499114] [2023-11-06 23:04:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632499114] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381010638] [2023-11-06 23:04:46,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:46,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:46,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:46,956 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:46,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 23:04:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 23:04:47,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:04:47,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:47,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381010638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:47,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:47,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-11-06 23:04:47,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77670686] [2023-11-06 23:04:47,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:47,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:04:47,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:47,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:04:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:04:47,232 INFO L87 Difference]: Start difference. First operand 154 states and 184 transitions. Second operand has 6 states, 5 states have (on average 6.6) 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 23:04:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:47,367 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2023-11-06 23:04:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:04:47,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) 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 34 [2023-11-06 23:04:47,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:47,369 INFO L225 Difference]: With dead ends: 164 [2023-11-06 23:04:47,369 INFO L226 Difference]: Without dead ends: 164 [2023-11-06 23:04:47,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:04:47,370 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 55 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:47,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 110 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-06 23:04:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2023-11-06 23:04:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 153 states have internal predecessors, (183), 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 23:04:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 183 transitions. [2023-11-06 23:04:47,381 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 183 transitions. Word has length 34 [2023-11-06 23:04:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:47,381 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 183 transitions. [2023-11-06 23:04:47,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) 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 23:04:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 183 transitions. [2023-11-06 23:04:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 23:04:47,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:47,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:47,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:47,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 23:04:47,583 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:47,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash -501164924, now seen corresponding path program 1 times [2023-11-06 23:04:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193241095] [2023-11-06 23:04:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:04:47,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:47,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193241095] [2023-11-06 23:04:47,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193241095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:47,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:47,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:47,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082752882] [2023-11-06 23:04:47,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:47,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:47,701 INFO L87 Difference]: Start difference. First operand 154 states and 183 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 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 23:04:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:47,774 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2023-11-06 23:04:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:04:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 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 37 [2023-11-06 23:04:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:47,775 INFO L225 Difference]: With dead ends: 160 [2023-11-06 23:04:47,776 INFO L226 Difference]: Without dead ends: 160 [2023-11-06 23:04:47,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:47,776 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:47,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 121 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-06 23:04:47,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 124. [2023-11-06 23:04:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 123 states have internal predecessors, (142), 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 23:04:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2023-11-06 23:04:47,781 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 37 [2023-11-06 23:04:47,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:47,781 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2023-11-06 23:04:47,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 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 23:04:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2023-11-06 23:04:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 23:04:47,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:47,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:47,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 23:04:47,782 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:47,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash -501164874, now seen corresponding path program 1 times [2023-11-06 23:04:47,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:47,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933640672] [2023-11-06 23:04:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:47,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:47,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933640672] [2023-11-06 23:04:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933640672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:47,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:47,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:04:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467900428] [2023-11-06 23:04:47,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:47,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:04:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:47,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:04:47,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:47,986 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:48,219 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2023-11-06 23:04:48,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:04:48,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-06 23:04:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:48,220 INFO L225 Difference]: With dead ends: 147 [2023-11-06 23:04:48,220 INFO L226 Difference]: Without dead ends: 147 [2023-11-06 23:04:48,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:04:48,221 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:48,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 166 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-06 23:04:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2023-11-06 23:04:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 133 states have internal predecessors, (155), 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 23:04:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2023-11-06 23:04:48,225 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 37 [2023-11-06 23:04:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:48,225 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2023-11-06 23:04:48,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2023-11-06 23:04:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 23:04:48,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:48,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:48,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 23:04:48,226 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:48,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash -501164873, now seen corresponding path program 1 times [2023-11-06 23:04:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:48,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979409300] [2023-11-06 23:04:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:48,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979409300] [2023-11-06 23:04:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979409300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:48,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:04:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781392650] [2023-11-06 23:04:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:48,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:04:48,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:04:48,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:48,593 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:48,912 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2023-11-06 23:04:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:04:48,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-06 23:04:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:48,914 INFO L225 Difference]: With dead ends: 163 [2023-11-06 23:04:48,914 INFO L226 Difference]: Without dead ends: 163 [2023-11-06 23:04:48,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:04:48,915 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 34 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:48,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 226 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-06 23:04:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 134. [2023-11-06 23:04:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 133 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 23:04:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2023-11-06 23:04:48,919 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 37 [2023-11-06 23:04:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:48,919 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2023-11-06 23:04:48,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2023-11-06 23:04:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 23:04:48,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:48,920 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:48,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 23:04:48,922 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:48,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:48,924 INFO L85 PathProgramCache]: Analyzing trace with hash -583103786, now seen corresponding path program 1 times [2023-11-06 23:04:48,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:48,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015338198] [2023-11-06 23:04:48,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:49,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:49,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015338198] [2023-11-06 23:04:49,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015338198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:49,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:49,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:04:49,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16761466] [2023-11-06 23:04:49,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:49,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:04:49,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:49,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:04:49,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:49,175 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 23:04:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:49,439 INFO L93 Difference]: Finished difference Result 168 states and 190 transitions. [2023-11-06 23:04:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:04:49,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 39 [2023-11-06 23:04:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:49,441 INFO L225 Difference]: With dead ends: 168 [2023-11-06 23:04:49,441 INFO L226 Difference]: Without dead ends: 168 [2023-11-06 23:04:49,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:04:49,442 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 53 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:49,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 341 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-06 23:04:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 136. [2023-11-06 23:04:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 135 states have internal predecessors, (156), 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 23:04:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2023-11-06 23:04:49,446 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 39 [2023-11-06 23:04:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:49,446 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2023-11-06 23:04:49,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 23:04:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2023-11-06 23:04:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 23:04:49,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:49,447 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 23:04:49,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 23:04:49,447 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:04:49,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:49,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1743858476, now seen corresponding path program 1 times [2023-11-06 23:04:49,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:49,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023804933] [2023-11-06 23:04:49,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:49,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:50,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023804933] [2023-11-06 23:04:50,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023804933] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432183423] [2023-11-06 23:04:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:50,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:50,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:50,284 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:50,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 23:04:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:50,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-06 23:04:50,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:50,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:04:50,534 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 23:04:50,549 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 23:04:50,558 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 23:04:50,657 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:04:50,658 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 23:04:50,704 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 23:04:50,730 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 23:04:50,745 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 23:04:50,765 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 23:04:50,784 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 23:04:50,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:04:50,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-06 23:04:50,899 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 23:04:50,899 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 38 treesize of output 37 [2023-11-06 23:04:51,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:04:51,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2023-11-06 23:04:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:51,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:51,120 INFO L322 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-06 23:04:51,121 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 16 treesize of output 15 [2023-11-06 23:04:51,135 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1805) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) is different from false [2023-11-06 23:04:51,142 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 (Array Int Int))) (= |c_ULTIMATE.start_main_~first~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1805) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) is different from false [2023-11-06 23:04:51,655 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:51,655 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 43 treesize of output 48 [2023-11-06 23:04:51,663 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 46 treesize of output 42 [2023-11-06 23:04:51,667 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:51,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 17 treesize of output 13 [2023-11-06 23:04:51,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 23:04:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-06 23:04:51,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432183423] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:51,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 25 [2023-11-06 23:04:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470736224] [2023-11-06 23:04:51,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:51,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 23:04:51,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:51,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 23:04:51,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=475, Unknown=9, NotChecked=90, Total=650 [2023-11-06 23:04:51,713 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand has 26 states, 25 states have (on average 3.72) internal successors, (93), 26 states have internal predecessors, (93), 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 23:04:54,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:04:56,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:04:58,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:05:00,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:05:02,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:05:04,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:05:06,273 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (forall ((v_ArrVal_1805 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1803) |c_ULTIMATE.start_main_~last~0#1.base|) .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1805) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) (forall ((v_ArrVal_1805 (Array Int Int))) (= |c_ULTIMATE.start_main_~first~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1805) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2023-11-06 23:05:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:07,021 INFO L93 Difference]: Finished difference Result 222 states and 249 transitions. [2023-11-06 23:05:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-06 23:05:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 26 states have internal predecessors, (93), 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 40 [2023-11-06 23:05:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:07,024 INFO L225 Difference]: With dead ends: 222 [2023-11-06 23:05:07,024 INFO L226 Difference]: Without dead ends: 222 [2023-11-06 23:05:07,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=323, Invalid=1728, Unknown=31, NotChecked=270, Total=2352 [2023-11-06 23:05:07,026 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 162 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 44 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:07,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 718 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 969 Invalid, 37 Unknown, 273 Unchecked, 14.3s Time] [2023-11-06 23:05:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-06 23:05:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 175. [2023-11-06 23:05:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 163 states have (on average 1.2331288343558282) internal successors, (201), 174 states have internal predecessors, (201), 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 23:05:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2023-11-06 23:05:07,030 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 40 [2023-11-06 23:05:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:07,031 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2023-11-06 23:05:07,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 26 states have internal predecessors, (93), 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 23:05:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2023-11-06 23:05:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 23:05:07,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:07,032 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 23:05:07,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:07,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:07,234 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:05:07,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1743858477, now seen corresponding path program 1 times [2023-11-06 23:05:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:07,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204605969] [2023-11-06 23:05:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:08,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:08,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204605969] [2023-11-06 23:05:08,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204605969] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:05:08,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683733998] [2023-11-06 23:05:08,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:08,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:08,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:08,304 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:05:08,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 23:05:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:08,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-06 23:05:08,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:08,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:05:08,584 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 23:05:08,591 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 23:05:08,611 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 23:05:08,618 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 23:05:08,637 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 23:05:08,644 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 23:05:08,764 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:05:08,765 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 23:05:08,829 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 23:05:08,838 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 23:05:08,857 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 23:05:08,867 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 23:05:08,887 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 23:05:08,897 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 23:05:08,913 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 23:05:08,927 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 23:05:08,953 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 23:05:08,964 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 23:05:09,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:05:09,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-06 23:05:09,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:05:09,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 23:05:09,125 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 23:05:09,126 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 58 treesize of output 53 [2023-11-06 23:05:09,133 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 28 treesize of output 11 [2023-11-06 23:05:09,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:05:09,322 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:09,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-11-06 23:05:09,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 23:05:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:09,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:05:09,439 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1982 (Array Int Int))) (= |c_ULTIMATE.start_main_~first~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1982) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) (forall ((v_ArrVal_1981 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2023-11-06 23:05:10,295 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12))) (and (forall ((v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1969 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1969) |c_ULTIMATE.start_main_~last~0#1.base|) .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1970 (Array Int Int))) (= |c_ULTIMATE.start_main_~first~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1970) |c_ULTIMATE.start_main_~last~0#1.base|) .cse0 |ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1982) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))))) is different from false [2023-11-06 23:05:17,001 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:17,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 58 [2023-11-06 23:05:17,009 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 46 treesize of output 42 [2023-11-06 23:05:17,016 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:05:17,018 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 23:05:17,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 23:05:17,027 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:05:17,029 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2023-11-06 23:05:17,035 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:05:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 23:05:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683733998] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:05:17,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:05:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 27 [2023-11-06 23:05:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636571046] [2023-11-06 23:05:17,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:05:17,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 23:05:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:17,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 23:05:17,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=515, Unknown=14, NotChecked=94, Total=702 [2023-11-06 23:05:17,098 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 27 states have internal predecessors, (95), 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 23:05:20,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:05:22,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:05:24,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:05:26,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:05:28,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:05:30,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:05:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:33,155 INFO L93 Difference]: Finished difference Result 218 states and 245 transitions. [2023-11-06 23:05:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 23:05:33,155 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 27 states have internal predecessors, (95), 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 40 [2023-11-06 23:05:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:33,157 INFO L225 Difference]: With dead ends: 218 [2023-11-06 23:05:33,157 INFO L226 Difference]: Without dead ends: 218 [2023-11-06 23:05:33,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=235, Invalid=1088, Unknown=17, NotChecked=142, Total=1482 [2023-11-06 23:05:33,158 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 114 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 52 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:33,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 537 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 848 Invalid, 12 Unknown, 206 Unchecked, 15.0s Time] [2023-11-06 23:05:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-06 23:05:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 158. [2023-11-06 23:05:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 146 states have (on average 1.2328767123287672) internal successors, (180), 157 states have internal predecessors, (180), 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 23:05:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2023-11-06 23:05:33,163 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 40 [2023-11-06 23:05:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:33,163 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2023-11-06 23:05:33,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 27 states have internal predecessors, (95), 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 23:05:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2023-11-06 23:05:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 23:05:33,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:33,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:33,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:33,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:33,365 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:05:33,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash -896348025, now seen corresponding path program 1 times [2023-11-06 23:05:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:33,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477169708] [2023-11-06 23:05:33,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477169708] [2023-11-06 23:05:33,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477169708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:33,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:33,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:05:33,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879009991] [2023-11-06 23:05:33,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:33,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:05:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:33,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:05:33,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:05:33,633 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 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 23:05:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:33,969 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2023-11-06 23:05:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 23:05:33,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 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 40 [2023-11-06 23:05:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:33,971 INFO L225 Difference]: With dead ends: 189 [2023-11-06 23:05:33,971 INFO L226 Difference]: Without dead ends: 189 [2023-11-06 23:05:33,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:05:33,972 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 43 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:33,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 271 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:05:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-06 23:05:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 159. [2023-11-06 23:05:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 147 states have (on average 1.2312925170068028) internal successors, (181), 158 states have internal predecessors, (181), 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 23:05:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 181 transitions. [2023-11-06 23:05:33,976 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 181 transitions. Word has length 40 [2023-11-06 23:05:33,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:33,977 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 181 transitions. [2023-11-06 23:05:33,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 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 23:05:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2023-11-06 23:05:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 23:05:33,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:33,978 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:33,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 23:05:33,978 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:05:33,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2060914871, now seen corresponding path program 1 times [2023-11-06 23:05:33,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:33,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725818165] [2023-11-06 23:05:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:34,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725818165] [2023-11-06 23:05:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725818165] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:05:34,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489137768] [2023-11-06 23:05:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:34,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:34,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:34,208 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:05:34,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 23:05:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:34,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 23:05:34,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:34,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:05:34,516 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:05:34,517 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 23:05:34,575 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 23:05:34,643 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:34,643 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 16 treesize of output 16 [2023-11-06 23:05:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:34,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:05:34,826 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 11 treesize of output 9 [2023-11-06 23:05:34,829 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 23:05:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:34,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489137768] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:05:34,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:05:34,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2023-11-06 23:05:34,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892827228] [2023-11-06 23:05:34,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:05:34,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 23:05:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:34,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 23:05:34,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-11-06 23:05:34,973 INFO L87 Difference]: Start difference. First operand 159 states and 181 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 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 23:05:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:35,591 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2023-11-06 23:05:35,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 23:05:35,592 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 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) Word has length 41 [2023-11-06 23:05:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:35,593 INFO L225 Difference]: With dead ends: 202 [2023-11-06 23:05:35,593 INFO L226 Difference]: Without dead ends: 202 [2023-11-06 23:05:35,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2023-11-06 23:05:35,594 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 88 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:35,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 472 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:05:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-06 23:05:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 159. [2023-11-06 23:05:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 158 states have internal predecessors, (180), 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 23:05:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 180 transitions. [2023-11-06 23:05:35,599 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 180 transitions. Word has length 41 [2023-11-06 23:05:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:35,599 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 180 transitions. [2023-11-06 23:05:35,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 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 23:05:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 180 transitions. [2023-11-06 23:05:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 23:05:35,600 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:35,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:35,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:35,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-06 23:05:35,810 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:05:35,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:35,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2016984840, now seen corresponding path program 1 times [2023-11-06 23:05:35,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816013362] [2023-11-06 23:05:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:05:35,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:35,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816013362] [2023-11-06 23:05:35,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816013362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:35,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:35,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:05:35,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310619271] [2023-11-06 23:05:35,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:35,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:05:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:35,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:05:35,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:05:35,895 INFO L87 Difference]: Start difference. First operand 159 states and 180 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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 23:05:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:35,969 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2023-11-06 23:05:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:05:35,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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 23:05:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:35,970 INFO L225 Difference]: With dead ends: 158 [2023-11-06 23:05:35,970 INFO L226 Difference]: Without dead ends: 158 [2023-11-06 23:05:35,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 23:05:35,971 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:35,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:05:35,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-06 23:05:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2023-11-06 23:05:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 147 states have (on average 1.2108843537414966) internal successors, (178), 157 states have internal predecessors, (178), 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 23:05:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2023-11-06 23:05:35,975 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 41 [2023-11-06 23:05:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:35,975 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2023-11-06 23:05:35,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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 23:05:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2023-11-06 23:05:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 23:05:35,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:35,976 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:35,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-06 23:05:35,976 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:05:35,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:35,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1292175973, now seen corresponding path program 1 times [2023-11-06 23:05:35,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:35,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778592643] [2023-11-06 23:05:35,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:35,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:37,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778592643] [2023-11-06 23:05:37,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778592643] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:05:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018949151] [2023-11-06 23:05:37,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:37,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:37,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:37,242 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:05:37,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 23:05:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:37,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-06 23:05:37,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:37,521 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 23:05:37,554 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 23:05:37,566 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 23:05:37,692 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 23:05:37,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2023-11-06 23:05:37,826 INFO L322 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-11-06 23:05:37,826 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 31 treesize of output 42 [2023-11-06 23:05:37,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 23:05:37,841 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 23:05:37,898 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 23:05:37,953 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:37,954 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-11-06 23:05:38,019 INFO L322 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-06 23:05:38,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2023-11-06 23:05:38,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 23:05:38,604 INFO L322 Elim1Store]: treesize reduction 40, result has 69.0 percent of original size [2023-11-06 23:05:38,605 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 87 treesize of output 137 [2023-11-06 23:05:39,758 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 23:05:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:39,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:05:40,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-06 23:05:40,255 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:40,255 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 37 treesize of output 41 [2023-11-06 23:05:42,082 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (or (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (and (forall ((v_ArrVal_2380 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2383 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base|) 0) |ULTIMATE.start_main_~y~0#1.base|)) (not (= (store (store (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse1)) .cse1 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base|) .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 (select v_ArrVal_2383 .cse3)) v_ArrVal_2383)))) (forall ((v_ArrVal_2380 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2383 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383))) (store .cse4 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (store (store (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse1)) .cse1 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base|) .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 (select v_ArrVal_2383 .cse3)) v_ArrVal_2383)))))) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int)) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_2380 (Array Int Int)) (v_ArrVal_2383 (Array Int Int))) (or (not (= (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383))) (store .cse5 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base|) 0) |ULTIMATE.start_main_~y~0#1.base|)) (not (= (store (store (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse1)) .cse1 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base|) .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 (select v_ArrVal_2383 .cse3)) v_ArrVal_2383)))))) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int)) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_2380 (Array Int Int)) (v_ArrVal_2383 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383))) (store .cse6 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (store (store (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse1)) .cse1 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base|) .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 (select v_ArrVal_2383 .cse3)) v_ArrVal_2383)))))))) is different from false [2023-11-06 23:05:42,882 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (or (and (forall ((v_ArrVal_2380 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2378 Int) (v_ArrVal_2383 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 .cse3 v_ArrVal_2378)))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse1 .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) |ULTIMATE.start_main_~y~0#1.base|) 0) |ULTIMATE.start_main_~y~0#1.base|)) (not (= v_ArrVal_2383 (store (store (select (store (store .cse1 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse0)) .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base|) 4 |c_ULTIMATE.start_main_~x~0#1.base|) 8 (select v_ArrVal_2383 8))))))) (forall ((v_ArrVal_2380 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2378 Int) (v_ArrVal_2383 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 .cse3 v_ArrVal_2378)))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse4 .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_2383 (store (store (select (store (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse0)) .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base|) 4 |c_ULTIMATE.start_main_~x~0#1.base|) 8 (select v_ArrVal_2383 8)))))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2378 Int)) (or (forall ((v_ArrVal_2380 (Array Int Int)) (v_ArrVal_2383 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 .cse3 v_ArrVal_2378)))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse5 .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) |ULTIMATE.start_main_~y~0#1.base|) 0) |ULTIMATE.start_main_~y~0#1.base|)) (not (= v_ArrVal_2383 (store (store (select (store (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse0)) .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base|) 4 |c_ULTIMATE.start_main_~x~0#1.base|) 8 (select v_ArrVal_2383 8))))))) (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2378 Int)) (or (= |ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_2380 (Array Int Int)) (v_ArrVal_2383 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 .cse3 v_ArrVal_2378)))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store .cse6 .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_2383) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_2383 (store (store (select (store (store .cse6 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse0)) .cse0 v_ArrVal_2380) |ULTIMATE.start_main_~y~0#1.base|) 4 |c_ULTIMATE.start_main_~x~0#1.base|) 8 (select v_ArrVal_2383 8)))))))))))) is different from false [2023-11-06 23:05:45,916 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:45,917 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 138 [2023-11-06 23:05:45,928 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-06 23:05:45,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 39 [2023-11-06 23:05:45,939 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 23:05:45,939 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 52 treesize of output 50 [2023-11-06 23:05:45,979 INFO L322 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2023-11-06 23:05:45,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 64 [2023-11-06 23:05:46,020 INFO L322 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-06 23:05:46,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 38 [2023-11-06 23:05:46,026 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:05:46,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-06 23:05:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:46,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018949151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:05:46,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:05:46,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 23] total 55 [2023-11-06 23:05:46,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109546177] [2023-11-06 23:05:46,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:05:46,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-06 23:05:46,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:46,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-06 23:05:46,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2460, Unknown=93, NotChecked=206, Total=2970 [2023-11-06 23:05:46,046 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand has 55 states, 55 states have (on average 2.018181818181818) internal successors, (111), 55 states have internal predecessors, (111), 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 23:05:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:52,013 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2023-11-06 23:05:52,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-06 23:05:52,014 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.018181818181818) internal successors, (111), 55 states have internal predecessors, (111), 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 43 [2023-11-06 23:05:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:52,015 INFO L225 Difference]: With dead ends: 229 [2023-11-06 23:05:52,015 INFO L226 Difference]: Without dead ends: 229 [2023-11-06 23:05:52,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=558, Invalid=5659, Unknown=111, NotChecked=314, Total=6642 [2023-11-06 23:05:52,019 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 129 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:52,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 769 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1661 Invalid, 0 Unknown, 187 Unchecked, 2.4s Time] [2023-11-06 23:05:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-06 23:05:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 186. [2023-11-06 23:05:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 175 states have (on average 1.1885714285714286) internal successors, (208), 185 states have internal predecessors, (208), 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 23:05:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2023-11-06 23:05:52,024 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 43 [2023-11-06 23:05:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:52,025 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2023-11-06 23:05:52,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.018181818181818) internal successors, (111), 55 states have internal predecessors, (111), 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 23:05:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2023-11-06 23:05:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 23:05:52,026 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:52,026 INFO L195 NwaCegarLoop]: trace histogram [3, 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 23:05:52,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:52,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-06 23:05:52,233 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:05:52,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1700600511, now seen corresponding path program 1 times [2023-11-06 23:05:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522982684] [2023-11-06 23:05:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:52,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522982684] [2023-11-06 23:05:52,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522982684] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:05:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777179078] [2023-11-06 23:05:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:52,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:52,917 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:05:52,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 23:05:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:53,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 23:05:53,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:53,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:05:53,265 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 23:05:53,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 23:05:53,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:05:53,523 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:05:53,523 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 23:05:53,629 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 23:05:53,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 12 [2023-11-06 23:05:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:53,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:05:53,933 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:53,933 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 23 treesize of output 24 [2023-11-06 23:05:53,943 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:53,943 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 39 treesize of output 38 [2023-11-06 23:05:53,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-06 23:05:53,967 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:53,967 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-06 23:05:53,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:05:53,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:05:53,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 23:05:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:54,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777179078] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:05:54,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:05:54,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 25 [2023-11-06 23:05:54,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334485456] [2023-11-06 23:05:54,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:05:54,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 23:05:54,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 23:05:54,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=544, Unknown=8, NotChecked=0, Total=650 [2023-11-06 23:05:54,219 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 26 states, 25 states have (on average 4.2) internal successors, (105), 26 states have internal predecessors, (105), 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 23:05:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:55,242 INFO L93 Difference]: Finished difference Result 307 states and 339 transitions. [2023-11-06 23:05:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:05:55,243 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.2) internal successors, (105), 26 states have internal predecessors, (105), 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 23:05:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:55,245 INFO L225 Difference]: With dead ends: 307 [2023-11-06 23:05:55,245 INFO L226 Difference]: Without dead ends: 307 [2023-11-06 23:05:55,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=914, Unknown=8, NotChecked=0, Total=1122 [2023-11-06 23:05:55,246 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 173 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 31 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:55,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 550 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 843 Invalid, 5 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 23:05:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-11-06 23:05:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 257. [2023-11-06 23:05:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 246 states have (on average 1.1747967479674797) internal successors, (289), 256 states have internal predecessors, (289), 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 23:05:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 289 transitions. [2023-11-06 23:05:55,253 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 289 transitions. Word has length 44 [2023-11-06 23:05:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:55,253 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 289 transitions. [2023-11-06 23:05:55,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.2) internal successors, (105), 26 states have internal predecessors, (105), 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 23:05:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 289 transitions. [2023-11-06 23:05:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 23:05:55,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:55,268 INFO L195 NwaCegarLoop]: trace histogram [3, 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 23:05:55,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:55,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:55,475 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:05:55,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1700600512, now seen corresponding path program 1 times [2023-11-06 23:05:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:55,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085213164] [2023-11-06 23:05:55,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:56,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:56,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085213164] [2023-11-06 23:05:56,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085213164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:05:56,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650748713] [2023-11-06 23:05:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:56,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:56,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:56,861 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:05:56,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 23:05:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:57,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-06 23:05:57,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:57,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:05:57,233 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:05:57,234 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 23:05:57,448 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 23:05:57,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:05:57,517 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:05:57,518 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 23:05:57,522 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 23:05:57,619 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 23:05:57,622 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 23:05:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:57,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:05:57,855 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2704 (Array Int Int)) (v_ArrVal_2703 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2703) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2704) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))) (forall ((v_ArrVal_2703 (Array Int Int))) (<= 0 (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2703) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))))) is different from false [2023-11-06 23:05:57,863 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:57,863 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 45 treesize of output 46 [2023-11-06 23:05:57,870 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:57,870 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 35 treesize of output 36 [2023-11-06 23:05:57,880 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:57,880 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 62 treesize of output 61 [2023-11-06 23:05:57,906 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:57,906 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 96 treesize of output 89 [2023-11-06 23:05:57,937 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 23:05:57,943 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 23:05:57,953 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:57,954 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 24 treesize of output 25 [2023-11-06 23:05:57,957 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:05:57,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:05:57,961 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 23:05:58,104 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 23:05:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:58,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650748713] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:05:58,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:05:58,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 28 [2023-11-06 23:05:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793268007] [2023-11-06 23:05:58,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:05:58,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 23:05:58,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:58,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 23:05:58,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=667, Unknown=1, NotChecked=52, Total=812 [2023-11-06 23:05:58,290 INFO L87 Difference]: Start difference. First operand 257 states and 289 transitions. Second operand has 29 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 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 23:05:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:59,906 INFO L93 Difference]: Finished difference Result 342 states and 380 transitions. [2023-11-06 23:05:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 23:05:59,906 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 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 44 [2023-11-06 23:05:59,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:59,908 INFO L225 Difference]: With dead ends: 342 [2023-11-06 23:05:59,908 INFO L226 Difference]: Without dead ends: 342 [2023-11-06 23:05:59,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=344, Invalid=1821, Unknown=1, NotChecked=90, Total=2256 [2023-11-06 23:05:59,910 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 220 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:59,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 746 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 881 Invalid, 0 Unknown, 156 Unchecked, 0.8s Time] [2023-11-06 23:05:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-06 23:05:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 282. [2023-11-06 23:05:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 271 states have (on average 1.188191881918819) internal successors, (322), 281 states have internal predecessors, (322), 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 23:05:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 322 transitions. [2023-11-06 23:05:59,918 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 322 transitions. Word has length 44 [2023-11-06 23:05:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:59,918 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 322 transitions. [2023-11-06 23:05:59,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 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 23:05:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 322 transitions. [2023-11-06 23:05:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 23:05:59,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:59,920 INFO L195 NwaCegarLoop]: trace histogram [3, 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 23:05:59,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 23:06:00,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:00,127 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:06:00,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:00,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1179007689, now seen corresponding path program 1 times [2023-11-06 23:06:00,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:00,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005861980] [2023-11-06 23:06:00,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:00,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:00,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:00,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005861980] [2023-11-06 23:06:00,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005861980] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:00,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140344183] [2023-11-06 23:06:00,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:00,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:00,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:00,510 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:00,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 23:06:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:00,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 23:06:00,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:00,795 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:06:00,907 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:06:00,907 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 23:06:01,043 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:06:01,090 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:06:01,090 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 23:06:01,156 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 24 treesize of output 12 [2023-11-06 23:06:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:01,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:06:01,211 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2861 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2861) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))))) is different from false [2023-11-06 23:06:01,217 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:01,217 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 23 treesize of output 24 [2023-11-06 23:06:01,226 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:01,226 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 39 treesize of output 38 [2023-11-06 23:06:01,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-06 23:06:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:01,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140344183] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:06:01,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:06:01,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2023-11-06 23:06:01,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607229570] [2023-11-06 23:06:01,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:06:01,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 23:06:01,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:01,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 23:06:01,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=200, Unknown=1, NotChecked=28, Total=272 [2023-11-06 23:06:01,566 INFO L87 Difference]: Start difference. First operand 282 states and 322 transitions. Second operand has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 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 23:06:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:02,259 INFO L93 Difference]: Finished difference Result 294 states and 325 transitions. [2023-11-06 23:06:02,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 23:06:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 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) Word has length 45 [2023-11-06 23:06:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:02,263 INFO L225 Difference]: With dead ends: 294 [2023-11-06 23:06:02,263 INFO L226 Difference]: Without dead ends: 294 [2023-11-06 23:06:02,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=507, Unknown=1, NotChecked=48, Total=702 [2023-11-06 23:06:02,264 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 262 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:02,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 533 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 454 Invalid, 0 Unknown, 124 Unchecked, 0.4s Time] [2023-11-06 23:06:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-11-06 23:06:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 282. [2023-11-06 23:06:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 271 states have (on average 1.1808118081180812) internal successors, (320), 281 states have internal predecessors, (320), 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 23:06:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 320 transitions. [2023-11-06 23:06:02,271 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 320 transitions. Word has length 45 [2023-11-06 23:06:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:02,272 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 320 transitions. [2023-11-06 23:06:02,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 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 23:06:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 320 transitions. [2023-11-06 23:06:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 23:06:02,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:02,273 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 23:06:02,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 23:06:02,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-06 23:06:02,480 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:06:02,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2105446271, now seen corresponding path program 1 times [2023-11-06 23:06:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:02,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706472509] [2023-11-06 23:06:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:03,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:03,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706472509] [2023-11-06 23:06:03,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706472509] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:03,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14110602] [2023-11-06 23:06:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:03,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:03,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:03,325 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:03,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 23:06:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:03,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 23:06:03,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:03,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:06:03,693 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:06:03,693 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 23:06:03,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:06:03,862 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 23:06:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:03,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:06:04,009 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:04,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-11-06 23:06:04,141 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3018 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3018) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 1))) is different from false [2023-11-06 23:06:04,148 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:04,148 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-06 23:06:04,161 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:04,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2023-11-06 23:06:04,179 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 23:06:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14110602] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:06:04,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:06:04,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2023-11-06 23:06:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169829699] [2023-11-06 23:06:04,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:06:04,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 23:06:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:04,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 23:06:04,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=472, Unknown=1, NotChecked=44, Total=600 [2023-11-06 23:06:04,423 INFO L87 Difference]: Start difference. First operand 282 states and 320 transitions. Second operand has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 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 23:06:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:05,562 INFO L93 Difference]: Finished difference Result 355 states and 401 transitions. [2023-11-06 23:06:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 23:06:05,563 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 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 46 [2023-11-06 23:06:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:05,565 INFO L225 Difference]: With dead ends: 355 [2023-11-06 23:06:05,566 INFO L226 Difference]: Without dead ends: 355 [2023-11-06 23:06:05,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=1149, Unknown=1, NotChecked=72, Total=1482 [2023-11-06 23:06:05,567 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 280 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:05,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 569 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 933 Invalid, 0 Unknown, 164 Unchecked, 0.8s Time] [2023-11-06 23:06:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-11-06 23:06:05,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 331. [2023-11-06 23:06:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 320 states have (on average 1.2125) internal successors, (388), 330 states have internal predecessors, (388), 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 23:06:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 388 transitions. [2023-11-06 23:06:05,582 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 388 transitions. Word has length 46 [2023-11-06 23:06:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:05,583 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 388 transitions. [2023-11-06 23:06:05,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 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 23:06:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 388 transitions. [2023-11-06 23:06:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 23:06:05,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:05,584 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:05,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-06 23:06:05,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:05,795 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:06:05,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash 680400302, now seen corresponding path program 1 times [2023-11-06 23:06:05,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:05,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122125835] [2023-11-06 23:06:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:05,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:07,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:07,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122125835] [2023-11-06 23:06:07,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122125835] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:07,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517691020] [2023-11-06 23:06:07,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:07,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:07,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:07,543 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:07,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 23:06:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-06 23:06:07,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:07,839 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 23:06:07,846 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 23:06:07,868 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 23:06:07,877 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 23:06:07,891 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 19 treesize of output 18 [2023-11-06 23:06:07,900 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 19 treesize of output 18 [2023-11-06 23:06:07,920 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:07,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 23:06:07,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 23:06:07,949 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:07,949 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 23:06:07,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 23:06:08,144 INFO L322 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-11-06 23:06:08,144 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 3 case distinctions, treesize of input 30 treesize of output 36 [2023-11-06 23:06:08,223 INFO L322 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2023-11-06 23:06:08,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2023-11-06 23:06:08,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:06:08,685 INFO L322 Elim1Store]: treesize reduction 76, result has 29.0 percent of original size [2023-11-06 23:06:08,685 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 92 [2023-11-06 23:06:08,793 INFO L322 Elim1Store]: treesize reduction 78, result has 39.1 percent of original size [2023-11-06 23:06:08,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 78 [2023-11-06 23:06:09,344 INFO L322 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-06 23:06:09,344 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 100 [2023-11-06 23:06:09,389 INFO L322 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-06 23:06:09,389 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 94 [2023-11-06 23:06:09,493 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 23:06:09,511 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 23:06:09,524 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 13 treesize of output 9 [2023-11-06 23:06:09,609 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:09,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 74 [2023-11-06 23:06:09,738 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:09,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2023-11-06 23:06:09,793 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 23:06:09,793 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2023-11-06 23:06:09,817 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 23:06:09,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2023-11-06 23:06:09,851 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-11-06 23:06:09,856 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-11-06 23:06:10,186 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:10,187 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 2 case distinctions, treesize of input 38 treesize of output 38 [2023-11-06 23:06:10,203 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:10,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-11-06 23:06:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:10,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:06:13,977 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse6 (select |c_#memory_$Pointer$.base| .cse3)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (forall ((v_ArrVal_3172 Int) (v_ArrVal_3178 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store .cse4 .cse5 v_ArrVal_3172)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse1 .cse2) 0) (not (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.offset|) 0) 0))))) (forall ((v_ArrVal_3171 Int) (v_ArrVal_3177 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse6 .cse5 v_ArrVal_3171)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (forall ((v_ArrVal_3171 Int) (v_ArrVal_3177 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse6 .cse8 v_ArrVal_3171)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse7 .cse2) 0) (= (select (store .cse7 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_ArrVal_3172 Int) (v_ArrVal_3178 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store .cse4 .cse8 v_ArrVal_3172)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.offset|) 0) 0))))))))) is different from false [2023-11-06 23:06:14,157 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (forall ((v_ArrVal_3168 Int)) (or (< |c_ULTIMATE.start_main_#t~mem7#1.offset| v_ArrVal_3168) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (or (< v_ArrVal_3168 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (forall ((v_ArrVal_3172 Int) (v_ArrVal_3178 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3168)) |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse2 v_ArrVal_3172)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse0 .cse1) 0) (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) 0) 0))))) (forall ((v_ArrVal_3171 Int) (v_ArrVal_3177 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)) |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse2 v_ArrVal_3171)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))))))) (forall ((v_ArrVal_3168 Int)) (or (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (or (forall ((v_ArrVal_3171 Int) (v_ArrVal_3177 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)) |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse4 v_ArrVal_3171)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse3 .cse1) 0)))) (forall ((v_ArrVal_3172 Int) (v_ArrVal_3178 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3168)) |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse4 v_ArrVal_3172)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) 0) 0))) (< v_ArrVal_3168 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|)))) (< |c_ULTIMATE.start_main_#t~mem7#1.offset| v_ArrVal_3168))))) is different from false [2023-11-06 23:06:14,303 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_3171 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3172 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3178 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3168 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse0)) .cse0) .cse1 v_ArrVal_3171)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3168)) .cse0) .cse1 v_ArrVal_3172)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) 0) 0)) (= (select .cse2 .cse3) 0) (< .cse4 v_ArrVal_3168) (< v_ArrVal_3168 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (= (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_3171 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3172 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3178 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3168 Int)) (let ((.cse6 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3168)) .cse0) .cse6 v_ArrVal_3172)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse5 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) 0) 0)) (< .cse4 v_ArrVal_3168) (< v_ArrVal_3168 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (= (select (store (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse0)) .cse0) .cse6 v_ArrVal_3171)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse5 .cse3) 0))))))) is different from false [2023-11-06 23:06:14,939 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_3165 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3165 .cse1)) v_ArrVal_3165)) (forall ((v_ArrVal_3171 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3172 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3178 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3168 Int) (v_ArrVal_3167 Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (let ((.cse6 (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3165))) (store .cse8 .cse3 (store (select (store .cse8 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3168)) .cse3) .cse4 v_ArrVal_3172))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< (select v_ArrVal_3165 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3168) (= (select (store (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse5 .cse1 v_ArrVal_3167)))) (store .cse2 .cse3 (store (select (store .cse2 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse3)) .cse3) .cse4 v_ArrVal_3171))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (< v_ArrVal_3168 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (= (select .cse6 .cse7) 0) (not (= (select (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) 0) 0)))))))) (forall ((v_ArrVal_3165 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3165 .cse1)) v_ArrVal_3165)) (forall ((v_ArrVal_3171 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3172 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3178 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3168 Int) (v_ArrVal_3167 Int)) (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (let ((.cse9 (select (store (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse5 .cse1 v_ArrVal_3167)))) (store .cse12 .cse3 (store (select (store .cse12 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse12 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse3)) .cse3) .cse11 v_ArrVal_3171))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< (select v_ArrVal_3165 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3168) (= (select (store .cse9 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse9 .cse7) 0) (< v_ArrVal_3168 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (not (= (select (store (select (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3165))) (store .cse10 .cse3 (store (select (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3168)) .cse3) .cse11 v_ArrVal_3172))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) 0) 0))))))))))) is different from false [2023-11-06 23:06:15,182 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_3171 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3172 Int) (v_ArrVal_3165 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3178 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3168 Int) (v_ArrVal_3167 Int) (v_ArrVal_3162 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (let ((.cse6 (select (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3165))) (store .cse9 .cse1 (store (select (store .cse9 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse9 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3168)) .cse1) .cse2 v_ArrVal_3172))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< (select v_ArrVal_3165 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3168) (= (select (store (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse3 .cse4 v_ArrVal_3162) .cse5 v_ArrVal_3167)))) (store .cse0 .cse1 (store (select (store .cse0 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse1)) .cse1) .cse2 v_ArrVal_3171))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (< v_ArrVal_3168 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (= (select .cse6 .cse7) 0) (not (= (select (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) 0) 0)) (not (= (store (store .cse8 .cse4 (select v_ArrVal_3165 .cse4)) .cse5 (select v_ArrVal_3165 .cse5)) v_ArrVal_3165)))))) (forall ((v_ArrVal_3171 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3172 Int) (v_ArrVal_3165 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3178 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3168 Int) (v_ArrVal_3167 Int) (v_ArrVal_3162 Int)) (let ((.cse12 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (let ((.cse10 (select (store (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse3 .cse4 v_ArrVal_3162) .cse5 v_ArrVal_3167)))) (store .cse13 .cse1 (store (select (store .cse13 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse13 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse1)) .cse1) .cse12 v_ArrVal_3171))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< (select v_ArrVal_3165 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3168) (= (select (store .cse10 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse10 .cse7) 0) (< v_ArrVal_3168 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (not (= (select (store (select (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3165))) (store .cse11 .cse1 (store (select (store .cse11 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse11 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3168)) .cse1) .cse12 v_ArrVal_3172))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) 0) 0)) (not (= (store (store .cse8 .cse4 (select v_ArrVal_3165 .cse4)) .cse5 (select v_ArrVal_3165 .cse5)) v_ArrVal_3165))))))))) is different from false [2023-11-06 23:06:15,338 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse2 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_3171 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3172 Int) (v_ArrVal_3165 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3178 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3168 Int) (v_ArrVal_3167 Int) (v_ArrVal_3162 Int)) (let ((.cse6 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse8 .cse3 v_ArrVal_3162) .cse4 v_ArrVal_3167)))) (store .cse7 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3171)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< (select v_ArrVal_3165 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3168) (= (select .cse0 .cse1) 0) (not (= (store (store .cse2 .cse3 (select v_ArrVal_3165 .cse3)) .cse4 (select v_ArrVal_3165 .cse4)) v_ArrVal_3165)) (not (= 0 (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3165))) (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3168))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3172)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) 0))) (< v_ArrVal_3168 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_3171 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3172 Int) (v_ArrVal_3165 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_3177 (Array Int Int)) (v_ArrVal_3178 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3168 Int) (v_ArrVal_3167 Int) (v_ArrVal_3162 Int)) (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| 4))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3165))) (store .cse12 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse12 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3168))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3172)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3178) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< (select v_ArrVal_3165 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3168) (= (select .cse9 .cse1) 0) (not (= (store (store .cse2 .cse3 (select v_ArrVal_3165 .cse3)) .cse4 (select v_ArrVal_3165 .cse4)) v_ArrVal_3165)) (not (= 0 (select (store .cse9 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) 0))) (< v_ArrVal_3168 |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse8 .cse3 v_ArrVal_3162) .cse4 v_ArrVal_3167)))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3171)) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3177) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))))))) is different from false [2023-11-06 23:06:17,942 INFO L322 Elim1Store]: treesize reduction 116, result has 43.7 percent of original size [2023-11-06 23:06:17,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 152 [2023-11-06 23:06:17,971 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:06:17,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 307 treesize of output 247 [2023-11-06 23:06:18,638 INFO L322 Elim1Store]: treesize reduction 16, result has 84.8 percent of original size [2023-11-06 23:06:18,639 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 290 treesize of output 320 [2023-11-06 23:06:18,693 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:06:18,693 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 155 treesize of output 155 [2023-11-06 23:06:18,752 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:06:18,760 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 2297 treesize of output 2289 [2023-11-06 23:06:18,795 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:06:18,801 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 170 treesize of output 168 [2023-11-06 23:06:18,841 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:18,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 34 treesize of output 38 [2023-11-06 23:06:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 23:06:19,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517691020] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:06:19,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:06:19,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 23] total 50 [2023-11-06 23:06:19,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690267590] [2023-11-06 23:06:19,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:06:19,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 23:06:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 23:06:19,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1641, Unknown=74, NotChecked=534, Total=2450 [2023-11-06 23:06:19,019 INFO L87 Difference]: Start difference. First operand 331 states and 388 transitions. Second operand has 50 states, 50 states have (on average 2.16) internal successors, (108), 50 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 23:06:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:36,282 INFO L93 Difference]: Finished difference Result 398 states and 459 transitions. [2023-11-06 23:06:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-06 23:06:36,282 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.16) internal successors, (108), 50 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) Word has length 47 [2023-11-06 23:06:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:36,285 INFO L225 Difference]: With dead ends: 398 [2023-11-06 23:06:36,286 INFO L226 Difference]: Without dead ends: 398 [2023-11-06 23:06:36,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 69 SyntacticMatches, 17 SemanticMatches, 90 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1981 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=937, Invalid=6281, Unknown=116, NotChecked=1038, Total=8372 [2023-11-06 23:06:36,290 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 360 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 948 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:36,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 634 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1016 Invalid, 0 Unknown, 948 Unchecked, 2.3s Time] [2023-11-06 23:06:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2023-11-06 23:06:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 335. [2023-11-06 23:06:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 324 states have (on average 1.2098765432098766) internal successors, (392), 334 states have internal predecessors, (392), 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 23:06:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 392 transitions. [2023-11-06 23:06:36,301 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 392 transitions. Word has length 47 [2023-11-06 23:06:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:36,302 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 392 transitions. [2023-11-06 23:06:36,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.16) internal successors, (108), 50 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 23:06:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 392 transitions. [2023-11-06 23:06:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 23:06:36,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:36,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:36,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 23:06:36,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:36,512 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:06:36,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:36,512 INFO L85 PathProgramCache]: Analyzing trace with hash -382427718, now seen corresponding path program 1 times [2023-11-06 23:06:36,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:36,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505938823] [2023-11-06 23:06:36,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:36,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:37,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:37,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505938823] [2023-11-06 23:06:37,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505938823] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:37,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506189436] [2023-11-06 23:06:37,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:37,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:37,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:37,343 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:37,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 23:06:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:37,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-06 23:06:37,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:37,794 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:06:37,795 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2023-11-06 23:06:37,979 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 23:06:38,232 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:38,232 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 38 treesize of output 30 [2023-11-06 23:06:38,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 23:06:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:39,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:06:40,911 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-06 23:06:41,195 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 27 [2023-11-06 23:06:41,199 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 55 treesize of output 51 [2023-11-06 23:06:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506189436] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:06:45,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:06:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 34 [2023-11-06 23:06:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744778524] [2023-11-06 23:06:45,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:06:45,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 23:06:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:45,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 23:06:45,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1091, Unknown=2, NotChecked=0, Total=1190 [2023-11-06 23:06:45,798 INFO L87 Difference]: Start difference. First operand 335 states and 392 transitions. Second operand has 35 states, 34 states have (on average 3.7058823529411766) internal successors, (126), 35 states have internal predecessors, (126), 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 23:06:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:49,039 INFO L93 Difference]: Finished difference Result 337 states and 393 transitions. [2023-11-06 23:06:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:06:49,040 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.7058823529411766) internal successors, (126), 35 states have internal predecessors, (126), 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 48 [2023-11-06 23:06:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:49,042 INFO L225 Difference]: With dead ends: 337 [2023-11-06 23:06:49,042 INFO L226 Difference]: Without dead ends: 319 [2023-11-06 23:06:49,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=244, Invalid=2204, Unknown=2, NotChecked=0, Total=2450 [2023-11-06 23:06:49,044 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 57 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:49,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 422 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 934 Invalid, 1 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 23:06:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-11-06 23:06:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2023-11-06 23:06:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 308 states have (on average 1.2175324675324675) internal successors, (375), 318 states have internal predecessors, (375), 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 23:06:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 375 transitions. [2023-11-06 23:06:49,054 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 375 transitions. Word has length 48 [2023-11-06 23:06:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:49,054 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 375 transitions. [2023-11-06 23:06:49,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.7058823529411766) internal successors, (126), 35 states have internal predecessors, (126), 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 23:06:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 375 transitions. [2023-11-06 23:06:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-06 23:06:49,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:49,056 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 23:06:49,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-06 23:06:49,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:49,264 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:06:49,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash 352581361, now seen corresponding path program 1 times [2023-11-06 23:06:49,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:49,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008059013] [2023-11-06 23:06:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:50,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008059013] [2023-11-06 23:06:50,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008059013] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891272180] [2023-11-06 23:06:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:50,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:50,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:50,650 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:50,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7efbf04d-53c6-4983-a258-bd273506587d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 23:06:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:50,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-06 23:06:50,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:50,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:06:51,079 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:06:51,080 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 23:06:51,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:06:51,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 23:06:51,275 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 23:06:51,375 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 23:06:51,392 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:06:51,467 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:51,467 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 40 [2023-11-06 23:06:51,479 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 23:06:51,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 23:06:52,225 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:52,226 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 22 [2023-11-06 23:06:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:52,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:06:52,370 INFO L322 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-06 23:06:52,370 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 16 treesize of output 15 [2023-11-06 23:06:52,754 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:52,754 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 128 treesize of output 129 [2023-11-06 23:06:52,768 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:06:52,768 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 248 treesize of output 247 [2023-11-06 23:06:52,799 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 113 treesize of output 109 [2023-11-06 23:06:54,812 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) |c_ULTIMATE.start_main_~last~0#1.base|))))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (let ((.cse0 (select .cse4 .cse1)) (.cse2 (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (or (let ((.cse3 (forall ((v_arrayElimCell_238 Int)) (= .cse1 (select .cse0 v_arrayElimCell_238))))) (and (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) .cse1) (not .cse2) (or .cse3 (= |c_ULTIMATE.start_main_~first~0#1.offset| |c_ULTIMATE.start_main_~last~0#1.offset|)) (or .cse3 (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)))) (and (forall ((v_arrayElimCell_239 Int)) (= (select .cse0 v_arrayElimCell_239) .cse1)) .cse2))))) is different from false [2023-11-06 23:07:06,230 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse7 (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse10 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse11 (and (forall ((v_ArrVal_3478 Int) (v_ArrVal_3477 Int) (v_arrayElimCell_238 Int)) (let ((.cse23 (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse8 .cse9 v_ArrVal_3477) .cse10 v_ArrVal_3478)))) (let ((.cse24 (store (select .cse25 |c_ULTIMATE.start_main_~last~0#1.base|) .cse7 |c_ULTIMATE.start_main_~x~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| .cse24) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse25 |c_ULTIMATE.start_main_~last~0#1.base| .cse24) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 |c_ULTIMATE.start_main_~last~0#1.base|)))))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (let ((.cse21 (select .cse23 .cse22))) (or (= (select .cse21 v_arrayElimCell_238) .cse22) (forall ((v_arrayElimCell_239 Int)) (= (select .cse21 v_arrayElimCell_239) .cse22))))))) (or .cse12 (forall ((v_ArrVal_3478 Int) (v_ArrVal_3477 Int) (v_arrayElimCell_238 Int)) (let ((.cse26 (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse8 .cse9 v_ArrVal_3477) .cse10 v_ArrVal_3478)))) (let ((.cse28 (store (select .cse29 |c_ULTIMATE.start_main_~last~0#1.base|) .cse7 |c_ULTIMATE.start_main_~x~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| .cse28) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse29 |c_ULTIMATE.start_main_~last~0#1.base| .cse28) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 |c_ULTIMATE.start_main_~last~0#1.base|)))))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (= (select (select .cse26 .cse27) v_arrayElimCell_238) .cse27)))))))) (and (forall ((v_ArrVal_3478 Int) (v_ArrVal_3477 Int)) (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse8 .cse9 v_ArrVal_3477) .cse10 v_ArrVal_3478)))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~last~0#1.base|) .cse7 |c_ULTIMATE.start_main_~x~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| .cse4) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse5 |c_ULTIMATE.start_main_~last~0#1.base| .cse4) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 |c_ULTIMATE.start_main_~last~0#1.base|)))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (let ((.cse0 (select .cse2 .cse1))) (or (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) .cse1) (forall ((v_arrayElimCell_239 Int)) (= (select .cse0 v_arrayElimCell_239) .cse1))))))) (or .cse11 (= |c_ULTIMATE.start_main_~first~0#1.offset| |c_ULTIMATE.start_main_~last~0#1.offset|)) (or .cse11 (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (or .cse12 (forall ((v_ArrVal_3478 Int) (v_ArrVal_3477 Int)) (let ((.cse13 (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse8 .cse9 v_ArrVal_3477) .cse10 v_ArrVal_3478)))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~last~0#1.base|) .cse7 |c_ULTIMATE.start_main_~x~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| .cse15) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_main_~last~0#1.base| .cse15) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 |c_ULTIMATE.start_main_~last~0#1.base|)))))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (= (select (select .cse13 .cse14) |c_ULTIMATE.start_main_~x~0#1.offset|) .cse14))))) (or (not .cse12) (forall ((v_ArrVal_3478 Int) (v_ArrVal_3477 Int) (v_arrayElimCell_239 Int)) (let ((.cse17 (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse8 .cse9 v_ArrVal_3477) .cse10 v_ArrVal_3478)))) (let ((.cse19 (store (select .cse20 |c_ULTIMATE.start_main_~last~0#1.base|) .cse7 |c_ULTIMATE.start_main_~x~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| .cse19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse20 |c_ULTIMATE.start_main_~last~0#1.base| .cse19) |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 |c_ULTIMATE.start_main_~last~0#1.base|)))))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (= (select (select .cse17 .cse18) v_arrayElimCell_239) .cse18)))))))) is different from false [2023-11-06 23:07:06,303 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:07:08,269 INFO L322 Elim1Store]: treesize reduction 1151, result has 34.3 percent of original size [2023-11-06 23:07:08,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 2679 treesize of output 1306 [2023-11-06 23:07:08,898 INFO L322 Elim1Store]: treesize reduction 181, result has 44.5 percent of original size [2023-11-06 23:07:08,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 885 treesize of output 969 [2023-11-06 23:07:09,105 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:07:09,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 1227 treesize of output 1159 [2023-11-06 23:07:09,618 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 23:07:09,983 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