./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0513_1.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_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/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_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0513_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/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_655644fb-ddbc-4699-a9c9-741d1deda4fc/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 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:01:38,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:01:38,634 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:01:38,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:01:38,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:01:38,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:01:38,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:01:38,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:01:38,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:01:38,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:01:38,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:01:38,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:01:38,678 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:01:38,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:01:38,680 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:01:38,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:01:38,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:01:38,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:01:38,682 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:01:38,683 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:01:38,684 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:01:38,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:01:38,685 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:01:38,686 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:01:38,687 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:01:38,687 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:01:38,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:01:38,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:01:38,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:01:38,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:01:38,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:01:38,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:01:38,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:01:38,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:01:38,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:01:38,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:01:38,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:01:38,712 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:01:38,712 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_655644fb-ddbc-4699-a9c9-741d1deda4fc/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_655644fb-ddbc-4699-a9c9-741d1deda4fc/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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2023-11-06 23:01:38,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:01:39,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:01:39,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:01:39,013 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:01:39,014 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:01:39,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2023-11-06 23:01:42,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:01:42,393 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:01:42,399 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2023-11-06 23:01:42,416 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/data/1c9653106/d1de3cd059c14d32a972f03cc7c3879f/FLAG6cc0beaac [2023-11-06 23:01:42,429 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/data/1c9653106/d1de3cd059c14d32a972f03cc7c3879f [2023-11-06 23:01:42,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:01:42,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:01:42,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:01:42,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:01:42,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:01:42,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:42,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a32d130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42, skipping insertion in model container [2023-11-06 23:01:42,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:42,498 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:01:42,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:01:42,852 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:01:42,926 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:01:42,960 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:01:42,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42 WrapperNode [2023-11-06 23:01:42,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:01:42,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:01:42,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:01:42,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:01:42,973 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:01:42" (1/1) ... [2023-11-06 23:01:43,009 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:01:42" (1/1) ... [2023-11-06 23:01:43,060 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2023-11-06 23:01:43,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:01:43,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:01:43,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:01:43,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:01:43,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:43,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:43,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:43,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:43,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:43,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:43,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:43,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:43,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:01:43,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:01:43,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:01:43,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:01:43,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42" (1/1) ... [2023-11-06 23:01:43,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:01:43,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:43,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/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:01:43,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/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:01:43,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:01:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:01:43,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 23:01:43,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:01:43,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 23:01:43,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 23:01:43,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:01:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:01:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:01:43,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:01:43,414 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:01:43,417 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:01:44,117 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:01:44,124 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:01:44,125 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 23:01:44,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:44 BoogieIcfgContainer [2023-11-06 23:01:44,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:01:44,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:01:44,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:01:44,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:01:44,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:01:42" (1/3) ... [2023-11-06 23:01:44,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6692b02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:01:44, skipping insertion in model container [2023-11-06 23:01:44,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:42" (2/3) ... [2023-11-06 23:01:44,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6692b02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:01:44, skipping insertion in model container [2023-11-06 23:01:44,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:44" (3/3) ... [2023-11-06 23:01:44,139 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2023-11-06 23:01:44,160 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:01:44,161 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2023-11-06 23:01:44,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:01:44,220 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;@767299b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:01:44,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2023-11-06 23:01:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 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:01:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 23:01:44,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:44,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:01:44,234 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:44,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:44,239 INFO L85 PathProgramCache]: Analyzing trace with hash 28769460, now seen corresponding path program 1 times [2023-11-06 23:01:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:44,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733758644] [2023-11-06 23:01:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:44,399 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:01:44,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733758644] [2023-11-06 23:01:44,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733758644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:44,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:44,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:44,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811996241] [2023-11-06 23:01:44,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:44,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:01:44,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:44,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:01:44,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:01:44,451 INFO L87 Difference]: Start difference. First operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 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) 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:01:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:44,480 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2023-11-06 23:01:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:01:44,483 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:01:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:44,491 INFO L225 Difference]: With dead ends: 151 [2023-11-06 23:01:44,492 INFO L226 Difference]: Without dead ends: 149 [2023-11-06 23:01:44,494 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:01:44,498 INFO L413 NwaCegarLoop]: 165 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, 165 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:01:44,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:01:44,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-06 23:01:44,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2023-11-06 23:01:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have 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:01:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2023-11-06 23:01:44,544 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 5 [2023-11-06 23:01:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:44,545 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2023-11-06 23:01:44,545 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:01:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2023-11-06 23:01:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 23:01:44,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:44,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:44,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:01:44,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:44,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849456, now seen corresponding path program 1 times [2023-11-06 23:01:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:44,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865315538] [2023-11-06 23:01:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:44,651 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:01:44,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:44,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865315538] [2023-11-06 23:01:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865315538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:44,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:44,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:44,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622067490] [2023-11-06 23:01:44,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:44,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:01:44,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:44,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:44,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:44,660 INFO L87 Difference]: Start difference. First operand 149 states and 163 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:01:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:44,909 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2023-11-06 23:01:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:44,910 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:01:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:44,918 INFO L225 Difference]: With dead ends: 196 [2023-11-06 23:01:44,919 INFO L226 Difference]: Without dead ends: 195 [2023-11-06 23:01:44,923 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:01:44,925 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 43 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:44,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:01:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-06 23:01:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2023-11-06 23:01:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have 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:01:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2023-11-06 23:01:44,961 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 7 [2023-11-06 23:01:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:44,961 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2023-11-06 23:01:44,962 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:01:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2023-11-06 23:01:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 23:01:44,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:44,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:44,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:01:44,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:44,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:44,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849360, now seen corresponding path program 1 times [2023-11-06 23:01:44,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:44,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053050617] [2023-11-06 23:01:44,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:45,063 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:01:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053050617] [2023-11-06 23:01:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053050617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:45,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:45,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179267073] [2023-11-06 23:01:45,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:45,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:01:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:45,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:45,068 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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:01:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:45,151 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2023-11-06 23:01:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:45,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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:01:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:45,155 INFO L225 Difference]: With dead ends: 173 [2023-11-06 23:01:45,155 INFO L226 Difference]: Without dead ends: 172 [2023-11-06 23:01:45,156 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:01:45,164 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:45,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 279 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-06 23:01:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2023-11-06 23:01:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have 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:01:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2023-11-06 23:01:45,176 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 7 [2023-11-06 23:01:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:45,177 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2023-11-06 23:01:45,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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:01:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2023-11-06 23:01:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 23:01:45,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:45,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:45,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:01:45,178 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:45,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2023-11-06 23:01:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427488470] [2023-11-06 23:01:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:45,321 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:01:45,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:45,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427488470] [2023-11-06 23:01:45,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427488470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:45,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:45,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188327467] [2023-11-06 23:01:45,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:45,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:01:45,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:45,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:45,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:45,325 INFO L87 Difference]: Start difference. First operand 162 states and 188 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:01:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:45,500 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2023-11-06 23:01:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:45,501 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:01:45,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:45,503 INFO L225 Difference]: With dead ends: 191 [2023-11-06 23:01:45,503 INFO L226 Difference]: Without dead ends: 191 [2023-11-06 23:01:45,503 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:01:45,512 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 84 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:45,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 196 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:01:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-06 23:01:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2023-11-06 23:01:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have 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:01:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2023-11-06 23:01:45,539 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 7 [2023-11-06 23:01:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:45,540 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2023-11-06 23:01:45,540 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:01:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2023-11-06 23:01:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 23:01:45,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:45,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:45,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:01:45,541 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:45,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2023-11-06 23:01:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:45,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097643939] [2023-11-06 23:01:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:45,682 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:01:45,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:45,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097643939] [2023-11-06 23:01:45,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097643939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:45,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:45,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:45,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81158588] [2023-11-06 23:01:45,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:45,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:01:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:45,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:45,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:45,685 INFO L87 Difference]: Start difference. First operand 161 states and 187 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:01:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:45,809 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2023-11-06 23:01:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:45,809 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:01:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:45,810 INFO L225 Difference]: With dead ends: 157 [2023-11-06 23:01:45,811 INFO L226 Difference]: Without dead ends: 157 [2023-11-06 23:01:45,811 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:01:45,812 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:45,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 202 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-06 23:01:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-11-06 23:01:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have 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:01:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2023-11-06 23:01:45,824 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 7 [2023-11-06 23:01:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:45,824 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2023-11-06 23:01:45,824 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:01:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2023-11-06 23:01:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 23:01:45,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:45,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:45,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:01:45,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:45,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1188718309, now seen corresponding path program 1 times [2023-11-06 23:01:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:45,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007332823] [2023-11-06 23:01:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:45,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:45,918 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:01:45,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:45,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007332823] [2023-11-06 23:01:45,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007332823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:45,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:45,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037522188] [2023-11-06 23:01:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:45,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:45,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:45,926 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:01:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:45,983 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2023-11-06 23:01:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:01:45,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-06 23:01:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:45,986 INFO L225 Difference]: With dead ends: 295 [2023-11-06 23:01:45,987 INFO L226 Difference]: Without dead ends: 295 [2023-11-06 23:01:45,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:45,992 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 147 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:45,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 454 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:01:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-06 23:01:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2023-11-06 23:01:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have 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:01:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2023-11-06 23:01:46,003 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 13 [2023-11-06 23:01:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:46,003 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2023-11-06 23:01:46,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:01:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2023-11-06 23:01:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 23:01:46,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:46,012 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:01:46,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:01:46,012 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:46,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682520, now seen corresponding path program 1 times [2023-11-06 23:01:46,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:46,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247669427] [2023-11-06 23:01:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:46,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:46,150 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:01:46,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247669427] [2023-11-06 23:01:46,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247669427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:46,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:46,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:46,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441114989] [2023-11-06 23:01:46,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:46,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:01:46,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:46,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:46,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:46,153 INFO L87 Difference]: Start difference. First operand 160 states and 179 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:01:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:46,258 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2023-11-06 23:01:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:46,259 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:01:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:46,260 INFO L225 Difference]: With dead ends: 156 [2023-11-06 23:01:46,260 INFO L226 Difference]: Without dead ends: 156 [2023-11-06 23:01:46,260 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:01:46,261 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:46,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-06 23:01:46,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-11-06 23:01:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have 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:01:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2023-11-06 23:01:46,266 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 16 [2023-11-06 23:01:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:46,266 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2023-11-06 23:01:46,267 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:01:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2023-11-06 23:01:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 23:01:46,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:46,268 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:01:46,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:01:46,268 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:46,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682519, now seen corresponding path program 1 times [2023-11-06 23:01:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:46,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112271404] [2023-11-06 23:01:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:46,375 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:01:46,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:46,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112271404] [2023-11-06 23:01:46,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112271404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:46,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:46,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681213800] [2023-11-06 23:01:46,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:46,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:01:46,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:46,378 INFO L87 Difference]: Start difference. First operand 156 states and 175 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:01:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:46,496 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2023-11-06 23:01:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:46,496 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:01:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:46,497 INFO L225 Difference]: With dead ends: 153 [2023-11-06 23:01:46,498 INFO L226 Difference]: Without dead ends: 153 [2023-11-06 23:01:46,498 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:01:46,499 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:46,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 215 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-06 23:01:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2023-11-06 23:01:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have 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:01:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2023-11-06 23:01:46,503 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 16 [2023-11-06 23:01:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:46,504 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2023-11-06 23:01:46,504 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:01:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2023-11-06 23:01:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 23:01:46,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:46,505 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] [2023-11-06 23:01:46,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:01:46,505 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:46,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351565, now seen corresponding path program 1 times [2023-11-06 23:01:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:46,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123613288] [2023-11-06 23:01:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:46,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:46,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123613288] [2023-11-06 23:01:46,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123613288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:46,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:46,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:46,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366941045] [2023-11-06 23:01:46,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:46,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:46,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:46,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:46,583 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:01:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:46,713 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2023-11-06 23:01:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:46,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:01:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:46,716 INFO L225 Difference]: With dead ends: 261 [2023-11-06 23:01:46,716 INFO L226 Difference]: Without dead ends: 261 [2023-11-06 23:01:46,716 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:01:46,717 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 146 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:46,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 323 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-06 23:01:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 153. [2023-11-06 23:01:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 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:01:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2023-11-06 23:01:46,723 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 24 [2023-11-06 23:01:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:46,724 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2023-11-06 23:01:46,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:01:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2023-11-06 23:01:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 23:01:46,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:46,725 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] [2023-11-06 23:01:46,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:01:46,726 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:46,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351469, now seen corresponding path program 1 times [2023-11-06 23:01:46,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:46,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154545238] [2023-11-06 23:01:46,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:46,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:46,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154545238] [2023-11-06 23:01:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154545238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:46,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:46,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:46,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146384610] [2023-11-06 23:01:46,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:46,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:01:46,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:46,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:01:46,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:01:46,825 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:01:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:46,996 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2023-11-06 23:01:46,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:46,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:01:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:46,998 INFO L225 Difference]: With dead ends: 147 [2023-11-06 23:01:46,998 INFO L226 Difference]: Without dead ends: 147 [2023-11-06 23:01:46,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:01:46,999 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 68 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:46,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 224 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:01:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-06 23:01:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2023-11-06 23:01:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2023-11-06 23:01:47,003 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 24 [2023-11-06 23:01:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:47,003 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2023-11-06 23:01:47,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:01:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2023-11-06 23:01:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 23:01:47,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:47,005 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] [2023-11-06 23:01:47,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:01:47,006 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:47,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:47,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351470, now seen corresponding path program 1 times [2023-11-06 23:01:47,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:47,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135943259] [2023-11-06 23:01:47,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:47,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:47,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:47,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135943259] [2023-11-06 23:01:47,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135943259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:47,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:47,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:47,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096707053] [2023-11-06 23:01:47,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:47,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:01:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:47,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:01:47,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:01:47,185 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:01:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:47,457 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2023-11-06 23:01:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:01:47,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:01:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:47,462 INFO L225 Difference]: With dead ends: 239 [2023-11-06 23:01:47,462 INFO L226 Difference]: Without dead ends: 239 [2023-11-06 23:01:47,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:01:47,463 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 325 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:47,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 226 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:01:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-06 23:01:47,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 185. [2023-11-06 23:01:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have 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:01:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2023-11-06 23:01:47,469 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 24 [2023-11-06 23:01:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:47,470 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2023-11-06 23:01:47,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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:01:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2023-11-06 23:01:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 23:01:47,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:47,471 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] [2023-11-06 23:01:47,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:01:47,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:47,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash 611618329, now seen corresponding path program 1 times [2023-11-06 23:01:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601351945] [2023-11-06 23:01:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:47,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:47,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601351945] [2023-11-06 23:01:47,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601351945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:47,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:47,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:47,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180019511] [2023-11-06 23:01:47,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:47,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:01:47,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:47,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:01:47,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:01:47,574 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:01:47,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:47,717 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2023-11-06 23:01:47,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:01:47,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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:01:47,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:47,720 INFO L225 Difference]: With dead ends: 238 [2023-11-06 23:01:47,720 INFO L226 Difference]: Without dead ends: 238 [2023-11-06 23:01:47,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:47,721 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 257 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:47,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 360 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-11-06 23:01:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2023-11-06 23:01:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have 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:01:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2023-11-06 23:01:47,727 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 29 [2023-11-06 23:01:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:47,728 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2023-11-06 23:01:47,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:01:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2023-11-06 23:01:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 23:01:47,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:47,729 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] [2023-11-06 23:01:47,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:01:47,730 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:47,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash 610479294, now seen corresponding path program 1 times [2023-11-06 23:01:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761350320] [2023-11-06 23:01:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:47,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:47,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:47,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761350320] [2023-11-06 23:01:47,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761350320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:47,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:47,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:01:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626102459] [2023-11-06 23:01:47,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:47,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:47,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:47,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:47,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:47,990 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:01:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:48,272 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2023-11-06 23:01:48,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:01:48,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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:01:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:48,275 INFO L225 Difference]: With dead ends: 213 [2023-11-06 23:01:48,275 INFO L226 Difference]: Without dead ends: 213 [2023-11-06 23:01:48,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:01:48,276 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 18 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:48,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 396 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:01:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-06 23:01:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2023-11-06 23:01:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have 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:01:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 252 transitions. [2023-11-06 23:01:48,282 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 252 transitions. Word has length 29 [2023-11-06 23:01:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:48,282 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 252 transitions. [2023-11-06 23:01:48,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:01:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 252 transitions. [2023-11-06 23:01:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 23:01:48,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:48,283 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] [2023-11-06 23:01:48,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:01:48,284 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:48,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:48,284 INFO L85 PathProgramCache]: Analyzing trace with hash 610479295, now seen corresponding path program 1 times [2023-11-06 23:01:48,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:48,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344124927] [2023-11-06 23:01:48,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:48,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344124927] [2023-11-06 23:01:48,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344124927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:48,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:48,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:01:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601427084] [2023-11-06 23:01:48,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:48,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:48,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:48,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:48,594 INFO L87 Difference]: Start difference. First operand 198 states and 252 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:01:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:48,765 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2023-11-06 23:01:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:01:48,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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:01:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:48,767 INFO L225 Difference]: With dead ends: 225 [2023-11-06 23:01:48,767 INFO L226 Difference]: Without dead ends: 225 [2023-11-06 23:01:48,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:01:48,768 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 36 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:48,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 455 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-06 23:01:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2023-11-06 23:01:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have 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:01:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2023-11-06 23:01:48,774 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 29 [2023-11-06 23:01:48,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:48,775 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2023-11-06 23:01:48,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:01:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2023-11-06 23:01:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 23:01:48,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:48,776 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:01:48,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:01:48,776 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:48,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604246, now seen corresponding path program 1 times [2023-11-06 23:01:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:48,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148635138] [2023-11-06 23:01:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:49,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:49,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148635138] [2023-11-06 23:01:49,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148635138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:49,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:49,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 23:01:49,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112406199] [2023-11-06 23:01:49,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:49,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:01:49,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:49,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:01:49,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:01:49,393 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:01:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:50,102 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2023-11-06 23:01:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 23:01:50,102 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:50,104 INFO L225 Difference]: With dead ends: 307 [2023-11-06 23:01:50,104 INFO L226 Difference]: Without dead ends: 307 [2023-11-06 23:01:50,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2023-11-06 23:01:50,106 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 205 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:50,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 530 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:01:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-11-06 23:01:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 220. [2023-11-06 23:01:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have 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:01:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2023-11-06 23:01:50,113 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 32 [2023-11-06 23:01:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:50,113 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2023-11-06 23:01:50,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:01:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2023-11-06 23:01:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 23:01:50,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:50,115 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:01:50,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:01:50,115 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:50,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604247, now seen corresponding path program 1 times [2023-11-06 23:01:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113349394] [2023-11-06 23:01:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:50,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:50,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113349394] [2023-11-06 23:01:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113349394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:50,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:50,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:01:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384135017] [2023-11-06 23:01:50,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:50,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:01:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:50,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:01:50,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:01:50,802 INFO L87 Difference]: Start difference. First operand 220 states and 280 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:01:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:51,418 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2023-11-06 23:01:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:01:51,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:51,421 INFO L225 Difference]: With dead ends: 309 [2023-11-06 23:01:51,421 INFO L226 Difference]: Without dead ends: 309 [2023-11-06 23:01:51,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-11-06 23:01:51,422 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 188 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:51,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 359 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:01:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-11-06 23:01:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 220. [2023-11-06 23:01:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have 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:01:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2023-11-06 23:01:51,432 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 32 [2023-11-06 23:01:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:51,434 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2023-11-06 23:01:51,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:01:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2023-11-06 23:01:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 23:01:51,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:51,435 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] [2023-11-06 23:01:51,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:01:51,435 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:51,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1655909309, now seen corresponding path program 1 times [2023-11-06 23:01:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:51,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103690916] [2023-11-06 23:01:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:51,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103690916] [2023-11-06 23:01:51,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103690916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:51,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:51,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:01:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979032566] [2023-11-06 23:01:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:51,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:01:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:51,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:01:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:01:51,778 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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:01:52,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:52,076 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2023-11-06 23:01:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:01:52,077 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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 33 [2023-11-06 23:01:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:52,078 INFO L225 Difference]: With dead ends: 254 [2023-11-06 23:01:52,078 INFO L226 Difference]: Without dead ends: 254 [2023-11-06 23:01:52,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:01:52,079 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 55 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:52,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 575 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:01:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-06 23:01:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2023-11-06 23:01:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have 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:01:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2023-11-06 23:01:52,086 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 33 [2023-11-06 23:01:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:52,086 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2023-11-06 23:01:52,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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:01:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2023-11-06 23:01:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 23:01:52,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:52,087 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:01:52,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:01:52,088 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:52,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 206446071, now seen corresponding path program 1 times [2023-11-06 23:01:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750489717] [2023-11-06 23:01:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 23:01:52,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:52,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750489717] [2023-11-06 23:01:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750489717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:52,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502732883] [2023-11-06 23:01:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:52,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:52,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:52,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:52,168 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:01:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:52,378 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2023-11-06 23:01:52,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:52,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:52,381 INFO L225 Difference]: With dead ends: 299 [2023-11-06 23:01:52,381 INFO L226 Difference]: Without dead ends: 299 [2023-11-06 23:01:52,381 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:01:52,382 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:52,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 265 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:01:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-06 23:01:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 228. [2023-11-06 23:01:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:01:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 294 transitions. [2023-11-06 23:01:52,388 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 294 transitions. Word has length 34 [2023-11-06 23:01:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:52,388 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 294 transitions. [2023-11-06 23:01:52,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:01:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2023-11-06 23:01:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 23:01:52,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:52,390 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:01:52,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:01:52,390 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:52,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:52,391 INFO L85 PathProgramCache]: Analyzing trace with hash 206446072, now seen corresponding path program 1 times [2023-11-06 23:01:52,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:52,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213442153] [2023-11-06 23:01:52,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:53,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:53,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213442153] [2023-11-06 23:01:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213442153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:53,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:53,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 23:01:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150099114] [2023-11-06 23:01:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:53,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 23:01:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 23:01:53,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:01:53,302 INFO L87 Difference]: Start difference. First operand 228 states and 294 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:01:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:54,246 INFO L93 Difference]: Finished difference Result 293 states and 367 transitions. [2023-11-06 23:01:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 23:01:54,246 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 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:01:54,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:54,248 INFO L225 Difference]: With dead ends: 293 [2023-11-06 23:01:54,248 INFO L226 Difference]: Without dead ends: 293 [2023-11-06 23:01:54,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2023-11-06 23:01:54,249 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 208 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:54,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 394 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:01:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-11-06 23:01:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 237. [2023-11-06 23:01:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 197 states have (on average 1.5482233502538072) internal successors, (305), 236 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have 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:01:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 305 transitions. [2023-11-06 23:01:54,256 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 305 transitions. Word has length 34 [2023-11-06 23:01:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:54,256 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 305 transitions. [2023-11-06 23:01:54,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have 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:01:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 305 transitions. [2023-11-06 23:01:54,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 23:01:54,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:54,259 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] [2023-11-06 23:01:54,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:01:54,259 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:01:54,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:54,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1585985001, now seen corresponding path program 1 times [2023-11-06 23:01:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:54,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858167135] [2023-11-06 23:01:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:55,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858167135] [2023-11-06 23:01:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858167135] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:01:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427307161] [2023-11-06 23:01:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:55,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:01:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:55,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:01:55,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:01:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:55,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-06 23:01:55,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:55,743 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:01:55,770 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:01:55,811 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:01:55,821 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:01:55,853 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:01:55,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 23 treesize of output 11 [2023-11-06 23:01:55,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 23:01:55,918 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 23:01:56,035 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 23:01:56,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-06 23:01:56,078 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 23:01:56,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-06 23:01:56,182 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 47 treesize of output 35 [2023-11-06 23:01:56,187 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 43 treesize of output 42 [2023-11-06 23:01:56,653 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:01:56,936 INFO L322 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-11-06 23:01:56,936 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 64 [2023-11-06 23:01:56,973 INFO L322 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-11-06 23:01:56,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 49 [2023-11-06 23:01:57,014 INFO L322 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2023-11-06 23:01:57,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 54 [2023-11-06 23:01:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:57,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:01:57,253 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 10 treesize of output 8 [2023-11-06 23:01:57,733 INFO L322 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2023-11-06 23:01:57,734 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 119 [2023-11-06 23:01:57,778 INFO L322 Elim1Store]: treesize reduction 10, result has 72.2 percent of original size [2023-11-06 23:01:57,779 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 160 [2023-11-06 23:01:57,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 23:01:58,072 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:01:58,073 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 26 treesize of output 28 [2023-11-06 23:01:58,327 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 0 case distinctions, treesize of input 16 treesize of output 4 [2023-11-06 23:01:58,351 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:01:58,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 52 [2023-11-06 23:01:58,407 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:01:58,408 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 33 treesize of output 35 [2023-11-06 23:01:59,235 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 0 case distinctions, treesize of input 16 treesize of output 4 [2023-11-06 23:01:59,320 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse12 (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (.cse18 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (.cse19 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse0 (not .cse1)) (.cse3 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (and (or .cse0 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))) (or .cse1 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_24 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse2 v_arrayElimCell_24) (select v_arrayElimArr_1 4)) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse3)))))))) (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_27 Int)) (let ((.cse4 (select v_arrayElimArr_3 4))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| .cse4) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse4) v_arrayElimCell_27) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_3 .cse3)))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse5 (select v_arrayElimArr_3 4)) (.cse6 (select v_arrayElimArr_2 4))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| .cse5) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse6))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse5) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= .cse6 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_3 .cse3))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse7 (select v_arrayElimArr_3 4))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| .cse7) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse7) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_3 .cse3)))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_27 Int)) (let ((.cse8 (select v_arrayElimArr_3 4)) (.cse9 (select v_arrayElimArr_2 4))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| .cse8) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse8) v_arrayElimCell_27) 0) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse9))) (not (= .cse9 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_3 .cse3))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_24 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_24) (select v_arrayElimArr_1 4)) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse3))))))) (or .cse1 (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse10 (select v_arrayElimArr_3 4))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| .cse10) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse10) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_3 .cse3))))))) (or .cse0 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse11 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse11))) (not (= .cse11 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) .cse12 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse14 (select v_arrayElimArr_1 4))) (or (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse14)) (= (select (select .cse13 v_arrayElimCell_24) .cse14) 0)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse15 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse15))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) v_arrayElimCell_27) 0) (not (= .cse15 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse16 (select v_arrayElimArr_3 4)) (.cse17 (select v_arrayElimArr_2 4))) (or (not (= .cse16 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse16) v_arrayElimCell_27) 0) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse17))) (not (= .cse17 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) .cse18 .cse19 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_3 4)) (.cse21 (select v_arrayElimArr_2 4))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| .cse20) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse21))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse20) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= .cse21 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_3 .cse3))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse22 (select v_arrayElimArr_3 4)) (.cse23 (select v_arrayElimArr_2 4))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| .cse22) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse22) v_arrayElimCell_27) 0) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse23))) (not (= .cse23 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_3 .cse3))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (or .cse0 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_24 Int)) (let ((.cse24 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse24))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse24 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_24 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse25 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select .cse25 v_arrayElimCell_24) (select v_arrayElimArr_1 4)) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse3)))))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (or .cse0 .cse12) (or (and .cse18 .cse19) .cse0) (or .cse1 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_24 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_24) (select v_arrayElimArr_1 4)) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse3)))))) (or .cse0 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse26 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse26))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) v_arrayElimCell_27) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse26 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (or .cse1 (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_27 Int)) (let ((.cse27 (select v_arrayElimArr_3 4))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| .cse27) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse27) v_arrayElimCell_27) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_3 .cse3)))))))))) is different from false [2023-11-06 23:02:00,480 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse0 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse0))) (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_24 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse2 (select v_arrayElimArr_1 4))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse2)) (= (select (select .cse1 v_arrayElimCell_24) .cse2) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse4 (select v_arrayElimArr_1 4))) (or (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse4)) (= (select (select .cse3 v_arrayElimCell_24) .cse4) 0)))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_24 Int)) (let ((.cse5 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse5))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse5 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse6 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse6))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) v_arrayElimCell_27) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse6 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse7))) (not (= .cse7 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse8 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse8))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) v_arrayElimCell_27) 0) (not (= .cse8 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse9 (select v_arrayElimArr_3 4)) (.cse10 (select v_arrayElimArr_2 4))) (or (not (= .cse9 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse9) v_arrayElimCell_27) 0) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse10))) (not (= .cse10 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2023-11-06 23:02:00,871 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 0 case distinctions, treesize of input 16 treesize of output 4 [2023-11-06 23:02:01,207 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_607 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_24 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_607))) (.cse1 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store .cse0 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse1))) (= (select (select (store .cse0 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_607 Int) (v_arrayElimCell_27 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_607))) (.cse4 (select v_arrayElimArr_3 4)) (.cse5 (select v_arrayElimArr_2 4))) (or (not (= .cse4 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse5))) (= (select (select (store .cse6 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select (store .cse6 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse4) v_arrayElimCell_27) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse5 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_ArrVal_605 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse8 (select v_arrayElimArr_1 4)) (.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_605) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse7 v_arrayElimCell_24) .cse8) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse8)) (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))))) (not (= (store .cse9 .cse3 (select v_ArrVal_605 .cse3)) v_ArrVal_605)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_607 Int)) (or (not (= (select v_arrayElimArr_4 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_607)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (forall ((v_ArrVal_605 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_605) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) (not (= (store .cse9 .cse3 (select v_ArrVal_605 .cse3)) v_ArrVal_605)))) (forall ((v_ArrVal_605 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_24 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_1 4)) (.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_605) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse10 v_arrayElimCell_24) .cse11) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse11)) (= (select (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (not (= (store .cse9 .cse3 (select v_ArrVal_605 .cse3)) v_ArrVal_605)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_607 Int) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse12 (select v_arrayElimArr_2 4)) (.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_607)))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse12))) (= (select (select (store .cse13 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse12 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_24) (= (select (select (store .cse13 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) v_arrayElimCell_27) 0)))) (forall ((v_ArrVal_605 (Array Int Int))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_605) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (not (= (store .cse9 .cse3 (select v_ArrVal_605 .cse3)) v_ArrVal_605)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_607 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_607)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_607 Int) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse14 (select v_arrayElimArr_2 4)) (.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_607)))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse14))) (= (select (select (store .cse15 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse14 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store .cse15 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) v_arrayElimCell_27) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_607 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_24 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_607))) (.cse17 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store .cse16 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) v_arrayElimCell_24) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse17))) (= (select (select (store .cse16 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse17 |c_ULTIMATE.start_main_~item~0#1.base|))))))) is different from false [2023-11-06 23:02:01,969 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((v_prenex_118 (Array Int Int)) (v_prenex_119 (Array Int Int)) (v_prenex_121 Int) (v_prenex_122 Int) (v_prenex_120 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_prenex_120))) (.cse1 (select v_prenex_118 4))) (or (not (= (select v_prenex_119 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store .cse0 v_prenex_121 v_prenex_118) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= v_prenex_121 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store .cse0 v_prenex_121 v_prenex_119) v_prenex_122) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= .cse1 |c_ULTIMATE.start_main_~item~0#1.base|)) (= v_prenex_122 v_prenex_121) (not (= v_prenex_118 (store v_prenex_119 4 .cse1)))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_607 Int) (v_arrayElimCell_27 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_ArrVal_607))) (.cse4 (select v_arrayElimArr_3 4)) (.cse5 (select v_arrayElimArr_2 4))) (or (not (= .cse4 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= v_arrayElimArr_2 (store v_arrayElimArr_3 4 .cse5))) (= (select (select (store .cse6 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select (store .cse6 |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_3) .cse4) v_arrayElimCell_27) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse5 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_prenex_96 (Array Int Int)) (v_prenex_95 (Array Int Int)) (v_prenex_97 Int)) (or (= v_prenex_97 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= v_prenex_95 (store .cse7 .cse3 (select v_prenex_95 .cse3)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_prenex_95) v_prenex_97 v_prenex_96) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_prenex_96 4))))) (forall ((v_prenex_87 (Array Int Int)) (v_prenex_88 Int) (v_prenex_86 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse9 (select v_prenex_87 4)) (.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_prenex_86) v_prenex_88 v_prenex_87))) (or (= (select (select .cse8 v_arrayElimCell_24) .cse9) 0) (not (= (store .cse7 .cse3 (select v_prenex_86 .cse3)) v_prenex_86)) (= v_prenex_88 v_arrayElimCell_24) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse9)) (= (select (select .cse8 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= v_prenex_88 |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_prenex_107 (Array Int Int)) (v_prenex_109 Int) (v_prenex_106 (Array Int Int)) (v_prenex_108 Int)) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_prenex_106) v_prenex_108 v_prenex_107)) (.cse11 (select v_prenex_107 4))) (or (= (select (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= v_prenex_108 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse11 |c_ULTIMATE.start_main_~item~0#1.offset|)) (not (= v_prenex_106 (store .cse7 .cse3 (select v_prenex_106 .cse3)))) (= (select (select .cse10 v_prenex_109) .cse11) 0)))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_101 Int) (v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_99 (Array Int Int))) (let ((.cse13 (select v_prenex_98 4)) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_prenex_100)))) (or (= (select (select (store .cse12 v_prenex_101 v_prenex_99) v_prenex_102) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= v_prenex_101 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (store v_prenex_99 4 .cse13) v_prenex_98)) (not (= .cse13 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= (select v_prenex_99 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store .cse12 v_prenex_101 v_prenex_98) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((v_prenex_89 (Array Int Int)) (v_prenex_90 (Array Int Int)) (v_prenex_92 Int) (v_prenex_91 Int) (v_prenex_94 Int) (v_prenex_93 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_prenex_91))) (.cse15 (select v_prenex_89 4))) (or (not (= (select v_prenex_90 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store .cse14 v_prenex_92 v_prenex_90) v_prenex_93) v_prenex_94) 0) (not (= .cse15 |c_ULTIMATE.start_main_~item~0#1.base|)) (= 0 (select (select (store .cse14 v_prenex_92 v_prenex_89) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (= v_prenex_92 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= v_prenex_89 (store v_prenex_90 4 .cse15)))))) (forall ((v_prenex_114 Int) (v_prenex_115 Int) (v_prenex_112 Int) (v_prenex_113 Int) (v_prenex_110 (Array Int Int)) (v_prenex_111 (Array Int Int))) (let ((.cse17 (select v_prenex_110 4)) (.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_prenex_112)))) (or (= (select (select (store .cse16 v_prenex_113 v_prenex_110) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= v_prenex_114 v_prenex_113) (not (= (select v_prenex_111 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse17 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= (store v_prenex_111 4 .cse17) v_prenex_110)) (= v_prenex_113 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store .cse16 v_prenex_113 v_prenex_111) v_prenex_114) v_prenex_115) 0)))) (forall ((v_ArrVal_605 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_prenex_85 Int)) (or (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_605) v_prenex_85 v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= v_prenex_85 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (store .cse7 .cse3 (select v_ArrVal_605 .cse3)) v_ArrVal_605)))) (forall ((v_prenex_116 Int) (v_prenex_117 Int) (v_arrayElimArr_4 (Array Int Int))) (or (= v_prenex_117 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_4 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_prenex_116)) v_prenex_117 v_arrayElimArr_4) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (forall ((v_prenex_105 Int) (v_prenex_104 Int) (v_prenex_103 (Array Int Int))) (or (= v_prenex_105 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse2 .cse3 v_prenex_104)) v_prenex_105 v_prenex_103) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (not (= (select v_prenex_103 4) |c_ULTIMATE.start_main_~item~0#1.base|)))))) is different from false [2023-11-06 23:02:02,989 INFO L322 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-11-06 23:02:02,989 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 29 treesize of output 1 [2023-11-06 23:02:02,996 INFO L322 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-11-06 23:02:02,997 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 57 treesize of output 1 [2023-11-06 23:02:03,004 INFO L322 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-11-06 23:02:03,005 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 57 treesize of output 1 [2023-11-06 23:02:03,009 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,010 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,016 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:02:03,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2023-11-06 23:02:03,023 INFO L322 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-11-06 23:02:03,024 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 59 treesize of output 1 [2023-11-06 23:02:03,026 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-06 23:02:03,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 1 [2023-11-06 23:02:03,043 INFO L322 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-11-06 23:02:03,043 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 57 treesize of output 1 [2023-11-06 23:02:03,049 INFO L322 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-11-06 23:02:03,049 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 29 treesize of output 1 [2023-11-06 23:02:03,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-06 23:02:03,057 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 23:02:03,061 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 1 [2023-11-06 23:02:03,070 INFO L322 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-11-06 23:02:03,071 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 57 treesize of output 1 [2023-11-06 23:02:03,074 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,079 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:02:03,080 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 153 treesize of output 1 [2023-11-06 23:02:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:03,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427307161] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:02:03,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:02:03,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 16] total 33 [2023-11-06 23:02:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840666959] [2023-11-06 23:02:03,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:02:03,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 23:02:03,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:03,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 23:02:03,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=696, Unknown=4, NotChecked=228, Total=1056 [2023-11-06 23:02:03,087 INFO L87 Difference]: Start difference. First operand 237 states and 305 transitions. Second operand has 33 states, 33 states have (on average 2.606060606060606) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have 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:02:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:06,684 INFO L93 Difference]: Finished difference Result 265 states and 336 transitions. [2023-11-06 23:02:06,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 23:02:06,685 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.606060606060606) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 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:02:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:06,687 INFO L225 Difference]: With dead ends: 265 [2023-11-06 23:02:06,687 INFO L226 Difference]: Without dead ends: 265 [2023-11-06 23:02:06,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=332, Invalid=1402, Unknown=4, NotChecked=332, Total=2070 [2023-11-06 23:02:06,689 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 235 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 565 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:06,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1612 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1074 Invalid, 0 Unknown, 565 Unchecked, 1.2s Time] [2023-11-06 23:02:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-06 23:02:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 240. [2023-11-06 23:02:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 200 states have (on average 1.545) internal successors, (309), 239 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have 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:02:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 309 transitions. [2023-11-06 23:02:06,696 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 309 transitions. Word has length 39 [2023-11-06 23:02:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:06,696 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 309 transitions. [2023-11-06 23:02:06,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.606060606060606) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have 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:02:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 309 transitions. [2023-11-06 23:02:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 23:02:06,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:06,697 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:02:06,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 23:02:06,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:06,903 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:06,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1585991954, now seen corresponding path program 1 times [2023-11-06 23:02:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:06,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920811677] [2023-11-06 23:02:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 23:02:06,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:06,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920811677] [2023-11-06 23:02:06,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920811677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:06,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:06,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:02:06,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361642731] [2023-11-06 23:02:06,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:06,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:02:06,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:06,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:02:06,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:02:06,956 INFO L87 Difference]: Start difference. First operand 240 states and 309 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:02:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:06,966 INFO L93 Difference]: Finished difference Result 242 states and 311 transitions. [2023-11-06 23:02:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:02:06,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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 39 [2023-11-06 23:02:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:06,968 INFO L225 Difference]: With dead ends: 242 [2023-11-06 23:02:06,969 INFO L226 Difference]: Without dead ends: 242 [2023-11-06 23:02:06,969 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:02:06,970 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:06,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:02:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-06 23:02:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2023-11-06 23:02:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 202 states have (on average 1.5396039603960396) internal successors, (311), 241 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have 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:02:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 311 transitions. [2023-11-06 23:02:06,977 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 311 transitions. Word has length 39 [2023-11-06 23:02:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:06,977 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 311 transitions. [2023-11-06 23:02:06,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:02:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 311 transitions. [2023-11-06 23:02:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 23:02:06,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:06,978 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:02:06,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 23:02:06,979 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:06,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1920895454, now seen corresponding path program 1 times [2023-11-06 23:02:06,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:06,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962597680] [2023-11-06 23:02:06,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:06,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:08,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:08,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962597680] [2023-11-06 23:02:08,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962597680] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:08,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404824993] [2023-11-06 23:02:08,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:08,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:08,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:08,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:08,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:02:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:08,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-06 23:02:08,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:08,256 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 11 [2023-11-06 23:02:08,424 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 23:02:08,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2023-11-06 23:02:08,594 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:02:08,619 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 23:02:08,619 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 48 treesize of output 45 [2023-11-06 23:02:08,637 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:02:08,889 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:08,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2023-11-06 23:02:08,906 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:08,907 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 49 treesize of output 39 [2023-11-06 23:02:09,167 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:02:09,370 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:02:09,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 11 treesize of output 11 [2023-11-06 23:02:09,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-06 23:02:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:09,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:02:09,653 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 10 treesize of output 8 [2023-11-06 23:02:10,026 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 101 treesize of output 93 [2023-11-06 23:02:10,061 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 129 treesize of output 117 [2023-11-06 23:02:13,032 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:13,033 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 26 treesize of output 27 [2023-11-06 23:02:13,035 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-06 23:02:13,048 INFO L322 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-06 23:02:13,048 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 79 treesize of output 1 [2023-11-06 23:02:13,056 INFO L322 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-06 23:02:13,057 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 79 treesize of output 1 [2023-11-06 23:02:13,063 INFO L322 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-06 23:02:13,064 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 26 treesize of output 1 [2023-11-06 23:02:13,071 INFO L322 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-06 23:02:13,071 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 79 treesize of output 1 [2023-11-06 23:02:13,079 INFO L322 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-06 23:02:13,079 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 79 treesize of output 1 [2023-11-06 23:02:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404824993] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:02:13,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:02:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 45 [2023-11-06 23:02:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708588845] [2023-11-06 23:02:13,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:02:13,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-06 23:02:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:13,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-06 23:02:13,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1767, Unknown=26, NotChecked=0, Total=1980 [2023-11-06 23:02:13,200 INFO L87 Difference]: Start difference. First operand 242 states and 311 transitions. Second operand has 45 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 45 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:02:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:18,400 INFO L93 Difference]: Finished difference Result 280 states and 350 transitions. [2023-11-06 23:02:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 23:02:18,403 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 45 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) Word has length 40 [2023-11-06 23:02:18,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:18,405 INFO L225 Difference]: With dead ends: 280 [2023-11-06 23:02:18,405 INFO L226 Difference]: Without dead ends: 280 [2023-11-06 23:02:18,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=633, Invalid=3889, Unknown=34, NotChecked=0, Total=4556 [2023-11-06 23:02:18,408 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 799 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 85 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:18,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1509 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1677 Invalid, 26 Unknown, 0 Unchecked, 2.6s Time] [2023-11-06 23:02:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-06 23:02:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 241. [2023-11-06 23:02:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 201 states have (on average 1.537313432835821) internal successors, (309), 240 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have 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:02:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 309 transitions. [2023-11-06 23:02:18,416 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 309 transitions. Word has length 40 [2023-11-06 23:02:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:18,416 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 309 transitions. [2023-11-06 23:02:18,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 45 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:02:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 309 transitions. [2023-11-06 23:02:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 23:02:18,417 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:18,417 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:02:18,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 23:02:18,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:18,623 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:18,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash 394802097, now seen corresponding path program 1 times [2023-11-06 23:02:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:18,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764094559] [2023-11-06 23:02:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:18,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:18,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:18,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764094559] [2023-11-06 23:02:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764094559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:18,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:18,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:02:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221442616] [2023-11-06 23:02:18,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:18,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:02:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:18,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:02:18,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:02:18,971 INFO L87 Difference]: Start difference. First operand 241 states and 309 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:19,316 INFO L93 Difference]: Finished difference Result 250 states and 316 transitions. [2023-11-06 23:02:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:02:19,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-06 23:02:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:19,318 INFO L225 Difference]: With dead ends: 250 [2023-11-06 23:02:19,318 INFO L226 Difference]: Without dead ends: 250 [2023-11-06 23:02:19,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:02:19,319 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 53 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 544 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.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:19,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 544 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:02:19,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-06 23:02:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 241. [2023-11-06 23:02:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 201 states have (on average 1.5323383084577114) internal successors, (308), 240 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have 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:02:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 308 transitions. [2023-11-06 23:02:19,326 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 308 transitions. Word has length 41 [2023-11-06 23:02:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:19,327 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 308 transitions. [2023-11-06 23:02:19,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 308 transitions. [2023-11-06 23:02:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 23:02:19,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:19,328 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] [2023-11-06 23:02:19,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 23:02:19,328 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:19,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:19,329 INFO L85 PathProgramCache]: Analyzing trace with hash -645822017, now seen corresponding path program 1 times [2023-11-06 23:02:19,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:19,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778012615] [2023-11-06 23:02:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:20,391 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:02:20,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:20,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778012615] [2023-11-06 23:02:20,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778012615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:20,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:20,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-06 23:02:20,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138255729] [2023-11-06 23:02:20,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:20,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 23:02:20,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:20,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 23:02:20,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-11-06 23:02:20,394 INFO L87 Difference]: Start difference. First operand 241 states and 308 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:02:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:21,847 INFO L93 Difference]: Finished difference Result 263 states and 331 transitions. [2023-11-06 23:02:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 23:02:21,847 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-11-06 23:02:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:21,849 INFO L225 Difference]: With dead ends: 263 [2023-11-06 23:02:21,849 INFO L226 Difference]: Without dead ends: 263 [2023-11-06 23:02:21,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2023-11-06 23:02:21,850 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 162 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:21,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1011 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 23:02:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-11-06 23:02:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 241. [2023-11-06 23:02:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 201 states have (on average 1.527363184079602) internal successors, (307), 240 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have 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:02:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 307 transitions. [2023-11-06 23:02:21,857 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 307 transitions. Word has length 42 [2023-11-06 23:02:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:21,857 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 307 transitions. [2023-11-06 23:02:21,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:02:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 307 transitions. [2023-11-06 23:02:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 23:02:21,858 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:21,858 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] [2023-11-06 23:02:21,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 23:02:21,858 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:21,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash -327922889, now seen corresponding path program 1 times [2023-11-06 23:02:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:21,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660589215] [2023-11-06 23:02:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:21,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:22,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660589215] [2023-11-06 23:02:22,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660589215] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262874117] [2023-11-06 23:02:22,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:22,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:22,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:22,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:22,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:02:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:22,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-06 23:02:22,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:22,569 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:02:22,569 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:02:22,679 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:02:22,807 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:22,807 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 30 [2023-11-06 23:02:22,979 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:02:22,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2023-11-06 23:02:23,206 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:23,231 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-06 23:02:23,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 39 [2023-11-06 23:02:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:23,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:02:23,634 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 88 treesize of output 80 [2023-11-06 23:02:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262874117] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:02:24,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:02:24,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 31 [2023-11-06 23:02:24,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571918007] [2023-11-06 23:02:24,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:02:24,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-06 23:02:24,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:24,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-06 23:02:24,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2023-11-06 23:02:24,735 INFO L87 Difference]: Start difference. First operand 241 states and 307 transitions. Second operand has 32 states, 31 states have (on average 3.7419354838709675) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:02:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:27,233 INFO L93 Difference]: Finished difference Result 243 states and 308 transitions. [2023-11-06 23:02:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 23:02:27,234 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7419354838709675) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 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:02:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:27,235 INFO L225 Difference]: With dead ends: 243 [2023-11-06 23:02:27,236 INFO L226 Difference]: Without dead ends: 220 [2023-11-06 23:02:27,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2023-11-06 23:02:27,237 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 76 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:27,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1152 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 23:02:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-06 23:02:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2023-11-06 23:02:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 180 states have (on average 1.5833333333333333) internal successors, (285), 219 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have 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:02:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 285 transitions. [2023-11-06 23:02:27,243 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 285 transitions. Word has length 45 [2023-11-06 23:02:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:27,243 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 285 transitions. [2023-11-06 23:02:27,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7419354838709675) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:02:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 285 transitions. [2023-11-06 23:02:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 23:02:27,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:27,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:27,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:02:27,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 23:02:27,445 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:27,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1291794435, now seen corresponding path program 1 times [2023-11-06 23:02:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:27,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857704070] [2023-11-06 23:02:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:27,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:27,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857704070] [2023-11-06 23:02:27,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857704070] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:27,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164535588] [2023-11-06 23:02:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:27,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:27,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:27,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:27,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 23:02:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:27,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:02:27,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:02:27,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:02:27,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164535588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:27,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:02:27,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-11-06 23:02:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569199239] [2023-11-06 23:02:27,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:27,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:02:27,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:27,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:02:27,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:02:27,733 INFO L87 Difference]: Start difference. First operand 220 states and 285 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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:02:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:27,767 INFO L93 Difference]: Finished difference Result 384 states and 496 transitions. [2023-11-06 23:02:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:02:27,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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 45 [2023-11-06 23:02:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:27,770 INFO L225 Difference]: With dead ends: 384 [2023-11-06 23:02:27,771 INFO L226 Difference]: Without dead ends: 382 [2023-11-06 23:02:27,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:02:27,772 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 106 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:27,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 384 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:02:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-11-06 23:02:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 231. [2023-11-06 23:02:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 191 states have (on average 1.5287958115183247) internal successors, (292), 230 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:02:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 292 transitions. [2023-11-06 23:02:27,779 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 292 transitions. Word has length 45 [2023-11-06 23:02:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:27,779 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 292 transitions. [2023-11-06 23:02:27,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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:02:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 292 transitions. [2023-11-06 23:02:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 23:02:27,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:27,780 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:27,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:02:27,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-06 23:02:27,986 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:27,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:27,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1971852805, now seen corresponding path program 1 times [2023-11-06 23:02:27,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:27,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900984759] [2023-11-06 23:02:27,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:28,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:28,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900984759] [2023-11-06 23:02:28,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900984759] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:28,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833926696] [2023-11-06 23:02:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:28,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:28,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:28,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:28,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 23:02:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:28,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 23:02:28,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:28,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:02:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:28,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833926696] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:02:28,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:02:28,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2023-11-06 23:02:28,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221813651] [2023-11-06 23:02:28,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:02:28,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:02:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:02:28,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:02:28,331 INFO L87 Difference]: Start difference. First operand 231 states and 292 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:02:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:28,424 INFO L93 Difference]: Finished difference Result 1033 states and 1359 transitions. [2023-11-06 23:02:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:02:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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:02:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:28,433 INFO L225 Difference]: With dead ends: 1033 [2023-11-06 23:02:28,434 INFO L226 Difference]: Without dead ends: 1033 [2023-11-06 23:02:28,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:02:28,435 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 689 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:28,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1045 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:02:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2023-11-06 23:02:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 274. [2023-11-06 23:02:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 234 states have (on average 1.4700854700854702) internal successors, (344), 273 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have 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:02:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 344 transitions. [2023-11-06 23:02:28,474 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 344 transitions. Word has length 45 [2023-11-06 23:02:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:28,475 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 344 transitions. [2023-11-06 23:02:28,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:02:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 344 transitions. [2023-11-06 23:02:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 23:02:28,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:28,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:28,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:02:28,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:28,684 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:28,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash 69553884, now seen corresponding path program 1 times [2023-11-06 23:02:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:28,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275810969] [2023-11-06 23:02:28,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:28,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:29,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275810969] [2023-11-06 23:02:29,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275810969] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:29,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862156317] [2023-11-06 23:02:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:29,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:29,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:29,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:29,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 23:02:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:29,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 23:02:29,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:29,320 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:02:29,400 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:02:29,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:29,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2023-11-06 23:02:29,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 23:02:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:29,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:02:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:31,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862156317] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:02:31,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:02:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-11-06 23:02:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732130716] [2023-11-06 23:02:31,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:02:31,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 23:02:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:31,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 23:02:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=338, Unknown=1, NotChecked=0, Total=420 [2023-11-06 23:02:31,841 INFO L87 Difference]: Start difference. First operand 274 states and 344 transitions. Second operand has 21 states, 20 states have (on average 5.15) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:02:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:32,764 INFO L93 Difference]: Finished difference Result 300 states and 347 transitions. [2023-11-06 23:02:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:02:32,769 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.15) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 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:02:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:32,771 INFO L225 Difference]: With dead ends: 300 [2023-11-06 23:02:32,771 INFO L226 Difference]: Without dead ends: 300 [2023-11-06 23:02:32,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=283, Invalid=1048, Unknown=1, NotChecked=0, Total=1332 [2023-11-06 23:02:32,773 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 561 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:32,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 943 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:02:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-06 23:02:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 274. [2023-11-06 23:02:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 234 states have (on average 1.4658119658119657) internal successors, (343), 273 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have 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:02:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 343 transitions. [2023-11-06 23:02:32,803 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 343 transitions. Word has length 47 [2023-11-06 23:02:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:32,804 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 343 transitions. [2023-11-06 23:02:32,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.15) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have 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:02:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 343 transitions. [2023-11-06 23:02:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 23:02:32,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:32,805 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:32,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-06 23:02:33,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-06 23:02:33,012 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:33,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:33,012 INFO L85 PathProgramCache]: Analyzing trace with hash 69553885, now seen corresponding path program 1 times [2023-11-06 23:02:33,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:33,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199118694] [2023-11-06 23:02:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:33,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:33,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:33,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199118694] [2023-11-06 23:02:33,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199118694] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:33,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943021421] [2023-11-06 23:02:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:33,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:33,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:33,698 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:33,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 23:02:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:33,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 23:02:33,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:34,007 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:02:34,018 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:02:34,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2023-11-06 23:02:34,092 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 35 treesize of output 11 [2023-11-06 23:02:34,253 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:02:34,257 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 23:02:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:34,276 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:02:34,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943021421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:34,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:02:34,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 18 [2023-11-06 23:02:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545577959] [2023-11-06 23:02:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:34,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:02:34,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:34,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:02:34,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-11-06 23:02:34,278 INFO L87 Difference]: Start difference. First operand 274 states and 343 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:34,676 INFO L93 Difference]: Finished difference Result 321 states and 370 transitions. [2023-11-06 23:02:34,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 23:02:34,676 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-06 23:02:34,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:34,678 INFO L225 Difference]: With dead ends: 321 [2023-11-06 23:02:34,678 INFO L226 Difference]: Without dead ends: 321 [2023-11-06 23:02:34,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2023-11-06 23:02:34,679 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 317 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:34,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 546 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:02:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-06 23:02:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 274. [2023-11-06 23:02:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 234 states have (on average 1.4615384615384615) internal successors, (342), 273 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have 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:02:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2023-11-06 23:02:34,687 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 47 [2023-11-06 23:02:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:34,687 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2023-11-06 23:02:34,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2023-11-06 23:02:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 23:02:34,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:34,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:34,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 23:02:34,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-06 23:02:34,896 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:34,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1479009528, now seen corresponding path program 1 times [2023-11-06 23:02:34,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:34,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731500597] [2023-11-06 23:02:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:34,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731500597] [2023-11-06 23:02:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731500597] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245376047] [2023-11-06 23:02:35,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:35,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:35,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:35,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:35,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 23:02:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:35,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 23:02:35,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:35,410 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:02:35,439 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 23:02:35,439 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:02:35,469 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:02:35,469 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:02:35,480 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:02:35,492 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:02:35,493 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 25 treesize of output 26 [2023-11-06 23:02:35,504 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-06 23:02:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:35,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:02:35,548 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:35,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-06 23:02:35,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-06 23:02:35,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 23:02:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:35,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245376047] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:02:35,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:02:35,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2023-11-06 23:02:35,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163332188] [2023-11-06 23:02:35,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:02:35,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 23:02:35,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:35,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 23:02:35,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=97, Unknown=4, NotChecked=0, Total=132 [2023-11-06 23:02:35,638 INFO L87 Difference]: Start difference. First operand 274 states and 342 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:36,016 INFO L93 Difference]: Finished difference Result 274 states and 339 transitions. [2023-11-06 23:02:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:02:36,017 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-06 23:02:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:36,018 INFO L225 Difference]: With dead ends: 274 [2023-11-06 23:02:36,019 INFO L226 Difference]: Without dead ends: 274 [2023-11-06 23:02:36,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=277, Unknown=5, NotChecked=0, Total=380 [2023-11-06 23:02:36,020 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 101 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:36,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 627 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:02:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-11-06 23:02:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2023-11-06 23:02:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 230 states have (on average 1.4652173913043478) internal successors, (337), 269 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have 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:02:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 337 transitions. [2023-11-06 23:02:36,027 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 337 transitions. Word has length 50 [2023-11-06 23:02:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:36,027 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 337 transitions. [2023-11-06 23:02:36,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 337 transitions. [2023-11-06 23:02:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 23:02:36,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:36,028 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:36,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-06 23:02:36,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:36,235 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:36,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1055909602, now seen corresponding path program 1 times [2023-11-06 23:02:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:36,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313762458] [2023-11-06 23:02:36,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:36,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 23:02:36,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:36,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313762458] [2023-11-06 23:02:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313762458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:36,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:36,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:02:36,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838667410] [2023-11-06 23:02:36,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:36,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:02:36,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:36,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:02:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:02:36,362 INFO L87 Difference]: Start difference. First operand 270 states and 337 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 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:02:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:36,592 INFO L93 Difference]: Finished difference Result 269 states and 335 transitions. [2023-11-06 23:02:36,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:02:36,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 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 51 [2023-11-06 23:02:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:36,594 INFO L225 Difference]: With dead ends: 269 [2023-11-06 23:02:36,594 INFO L226 Difference]: Without dead ends: 269 [2023-11-06 23:02:36,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:02:36,595 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 27 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:36,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 386 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:02:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-11-06 23:02:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2023-11-06 23:02:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 230 states have (on average 1.4565217391304348) internal successors, (335), 268 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have 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:02:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 335 transitions. [2023-11-06 23:02:36,616 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 335 transitions. Word has length 51 [2023-11-06 23:02:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:36,616 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 335 transitions. [2023-11-06 23:02:36,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 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:02:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 335 transitions. [2023-11-06 23:02:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 23:02:36,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:36,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:36,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 23:02:36,618 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:36,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:36,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1055909601, now seen corresponding path program 1 times [2023-11-06 23:02:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:36,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910382139] [2023-11-06 23:02:36,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:36,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:37,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:37,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910382139] [2023-11-06 23:02:37,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910382139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:37,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:37,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 23:02:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347155269] [2023-11-06 23:02:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:37,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 23:02:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:37,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 23:02:37,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:02:37,148 INFO L87 Difference]: Start difference. First operand 269 states and 335 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:02:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:37,883 INFO L93 Difference]: Finished difference Result 341 states and 391 transitions. [2023-11-06 23:02:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:02:37,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-06 23:02:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:37,886 INFO L225 Difference]: With dead ends: 341 [2023-11-06 23:02:37,886 INFO L226 Difference]: Without dead ends: 341 [2023-11-06 23:02:37,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2023-11-06 23:02:37,887 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 365 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:37,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 729 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:02:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-06 23:02:37,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 269. [2023-11-06 23:02:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 230 states have (on average 1.4521739130434783) internal successors, (334), 268 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have 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:02:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 334 transitions. [2023-11-06 23:02:37,897 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 334 transitions. Word has length 51 [2023-11-06 23:02:37,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:37,897 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 334 transitions. [2023-11-06 23:02:37,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:02:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 334 transitions. [2023-11-06 23:02:37,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 23:02:37,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:37,898 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:37,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 23:02:37,898 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:37,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:37,899 INFO L85 PathProgramCache]: Analyzing trace with hash -262389798, now seen corresponding path program 1 times [2023-11-06 23:02:37,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:37,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931067946] [2023-11-06 23:02:37,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:37,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:38,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:38,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931067946] [2023-11-06 23:02:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931067946] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:38,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490690695] [2023-11-06 23:02:38,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:38,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:38,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:38,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:38,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 23:02:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:39,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 23:02:39,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:39,131 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:02:39,161 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:02:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:39,258 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:02:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490690695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:39,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:02:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2023-11-06 23:02:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049100323] [2023-11-06 23:02:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:39,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:02:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:02:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-11-06 23:02:39,260 INFO L87 Difference]: Start difference. First operand 269 states and 334 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:02:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:39,479 INFO L93 Difference]: Finished difference Result 294 states and 341 transitions. [2023-11-06 23:02:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:02:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-06 23:02:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:39,482 INFO L225 Difference]: With dead ends: 294 [2023-11-06 23:02:39,482 INFO L226 Difference]: Without dead ends: 294 [2023-11-06 23:02:39,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:02:39,483 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 503 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:39,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 483 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:02:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-11-06 23:02:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 269. [2023-11-06 23:02:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 230 states have (on average 1.4478260869565218) internal successors, (333), 268 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have 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:02:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2023-11-06 23:02:39,492 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 54 [2023-11-06 23:02:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:39,493 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2023-11-06 23:02:39,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:02:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2023-11-06 23:02:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 23:02:39,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:39,494 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:39,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 23:02:39,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:39,701 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:39,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash 455851009, now seen corresponding path program 1 times [2023-11-06 23:02:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:39,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087940018] [2023-11-06 23:02:39,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:39,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:40,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:40,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087940018] [2023-11-06 23:02:40,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087940018] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:40,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398195078] [2023-11-06 23:02:40,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:40,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:40,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:40,090 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:40,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 23:02:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:40,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 23:02:40,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:40,429 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:02:40,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:40,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 23:02:40,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 23:02:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:40,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:02:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:40,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398195078] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:02:40,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:02:40,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-11-06 23:02:40,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456663227] [2023-11-06 23:02:40,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:02:40,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 23:02:40,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:40,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 23:02:40,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-11-06 23:02:40,723 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:02:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:41,141 INFO L93 Difference]: Finished difference Result 289 states and 335 transitions. [2023-11-06 23:02:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:02:41,145 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 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 55 [2023-11-06 23:02:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:41,147 INFO L225 Difference]: With dead ends: 289 [2023-11-06 23:02:41,147 INFO L226 Difference]: Without dead ends: 289 [2023-11-06 23:02:41,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2023-11-06 23:02:41,148 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 755 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:41,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 725 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:02:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-11-06 23:02:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2023-11-06 23:02:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 230 states have (on average 1.4434782608695653) internal successors, (332), 268 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have 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:02:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 332 transitions. [2023-11-06 23:02:41,155 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 332 transitions. Word has length 55 [2023-11-06 23:02:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:41,156 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 332 transitions. [2023-11-06 23:02:41,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:02:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 332 transitions. [2023-11-06 23:02:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 23:02:41,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:41,157 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:41,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 23:02:41,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:41,363 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:02:41,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash -429024641, now seen corresponding path program 1 times [2023-11-06 23:02:41,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:41,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269228169] [2023-11-06 23:02:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:41,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:42,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:42,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269228169] [2023-11-06 23:02:42,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269228169] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:42,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852581323] [2023-11-06 23:02:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:42,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:42,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:42,590 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:42,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 23:02:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:42,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-06 23:02:42,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:42,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:02:42,904 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:02:42,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 23:02:42,994 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:02:43,087 INFO L322 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-11-06 23:02:43,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2023-11-06 23:02:43,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-06 23:02:43,210 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-06 23:02:43,248 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-06 23:02:43,369 INFO L322 Elim1Store]: treesize reduction 84, result has 30.0 percent of original size [2023-11-06 23:02:43,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 48 [2023-11-06 23:02:43,564 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-06 23:02:43,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2023-11-06 23:02:43,735 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:02:43,735 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 53 [2023-11-06 23:02:44,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 23:02:44,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2023-11-06 23:02:44,690 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:02:44,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-06 23:02:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:44,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:02:45,172 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:02:45,290 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse0 0) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2378) (select .cse0 .cse1)) 1)))) (or (forall ((v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int)) (= (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2378) (select .cse2 .cse1))) 1)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)))) is different from false [2023-11-06 23:02:45,445 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (or (forall ((v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (v_ArrVal_2374 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2374) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2378) (select .cse0 .cse1))) 1)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (v_ArrVal_2374 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2374) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2378) (select .cse2 .cse1)) 1) (= (select .cse2 0) |c_ULTIMATE.start_main_~data~0#1.base|)))))) is different from false [2023-11-06 23:02:46,789 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:46,790 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 152 treesize of output 102 [2023-11-06 23:02:46,805 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:46,806 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 210 treesize of output 212 [2023-11-06 23:02:46,818 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:46,827 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:46,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2023-11-06 23:02:46,839 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:46,839 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 87 treesize of output 81 [2023-11-06 23:02:46,879 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:02:46,901 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:46,918 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:46,919 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 81 treesize of output 89 [2023-11-06 23:02:53,124 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:53,124 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 104 treesize of output 75 [2023-11-06 23:02:53,143 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:53,143 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 132 treesize of output 131 [2023-11-06 23:02:53,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-11-06 23:02:53,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-11-06 23:03:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 23:03:23,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852581323] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:23,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:03:23,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 21] total 50 [2023-11-06 23:03:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241779506] [2023-11-06 23:03:23,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:23,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-06 23:03:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-06 23:03:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2069, Unknown=15, NotChecked=190, Total=2550 [2023-11-06 23:03:23,099 INFO L87 Difference]: Start difference. First operand 269 states and 332 transitions. Second operand has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:25,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:03:27,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:03:29,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:03:32,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:03:36,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 23:03:37,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 23:03:42,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 23:03:47,298 WARN L839 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|) 1)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (or (forall ((v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (v_ArrVal_2374 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2374) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2378) (select .cse0 .cse1))) 1)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (v_ArrVal_2374 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2374) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2378) (select .cse2 .cse1)) 1) (= (select .cse2 0) |c_ULTIMATE.start_main_~data~0#1.base|)))))))) is different from false [2023-11-06 23:03:50,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:03:50,259 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|) 1)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (or (forall ((v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (v_ArrVal_2374 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2374) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2378) (select .cse0 .cse1))) 1)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (v_ArrVal_2374 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2374) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2377) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2378) (select .cse2 .cse1)) 1) (= (select .cse2 0) |c_ULTIMATE.start_main_~data~0#1.base|)))))))) is different from false [2023-11-06 23:03:51,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:03:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:52,827 INFO L93 Difference]: Finished difference Result 384 states and 459 transitions. [2023-11-06 23:03:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-06 23:03:52,828 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-06 23:03:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:52,829 INFO L225 Difference]: With dead ends: 384 [2023-11-06 23:03:52,830 INFO L226 Difference]: Without dead ends: 384 [2023-11-06 23:03:52,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=726, Invalid=3692, Unknown=20, NotChecked=532, Total=4970 [2023-11-06 23:03:52,831 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 388 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 54 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 2649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 514 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:52,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1535 Invalid, 2649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2063 Invalid, 18 Unknown, 514 Unchecked, 27.5s Time] [2023-11-06 23:03:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-11-06 23:03:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 267. [2023-11-06 23:03:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 228 states have (on average 1.4342105263157894) internal successors, (327), 266 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:03:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 327 transitions. [2023-11-06 23:03:52,839 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 327 transitions. Word has length 58 [2023-11-06 23:03:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:52,840 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 327 transitions. [2023-11-06 23:03:52,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 327 transitions. [2023-11-06 23:03:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 23:03:52,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:52,841 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:52,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:53,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-06 23:03:53,048 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:03:53,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:53,049 INFO L85 PathProgramCache]: Analyzing trace with hash -429024640, now seen corresponding path program 1 times [2023-11-06 23:03:53,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:53,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198634320] [2023-11-06 23:03:53,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:54,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:54,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198634320] [2023-11-06 23:03:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198634320] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:54,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971590609] [2023-11-06 23:03:54,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:54,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:54,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:54,669 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:54,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 23:03:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-06 23:03:54,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:54,981 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:03:54,986 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:03:55,076 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 23:03:55,077 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:03:55,088 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:03:55,188 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:03:55,198 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:03:55,336 INFO L322 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-06 23:03:55,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-11-06 23:03:55,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 23:03:55,463 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:03:55,474 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 43 treesize of output 32 [2023-11-06 23:03:55,561 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:03:55,571 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 43 treesize of output 32 [2023-11-06 23:03:55,634 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 43 treesize of output 32 [2023-11-06 23:03:55,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:03:55,761 INFO L322 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-11-06 23:03:55,762 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2023-11-06 23:03:55,779 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 23:03:55,912 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 34 treesize of output 25 [2023-11-06 23:03:55,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:03:55,968 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 37 treesize of output 28 [2023-11-06 23:03:55,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 23:03:56,069 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:03:56,070 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 73 treesize of output 62 [2023-11-06 23:03:56,075 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 34 treesize of output 32 [2023-11-06 23:03:56,533 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 56 treesize of output 28 [2023-11-06 23:03:56,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 23:03:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:56,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:06,113 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,113 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 150 treesize of output 141 [2023-11-06 23:04:06,130 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,130 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 592 treesize of output 591 [2023-11-06 23:04:06,144 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,145 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 340 treesize of output 230 [2023-11-06 23:04:06,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:06,174 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,175 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 2376 treesize of output 2358 [2023-11-06 23:04:06,190 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 53 treesize of output 49 [2023-11-06 23:04:06,201 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:06,212 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 68 treesize of output 60 [2023-11-06 23:04:06,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:06,222 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 48 treesize of output 40 [2023-11-06 23:04:06,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-06 23:04:06,288 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,288 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2023-11-06 23:04:06,438 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,438 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 96 treesize of output 67 [2023-11-06 23:04:06,443 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:06,457 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,457 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 268 treesize of output 270 [2023-11-06 23:04:06,473 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-11-06 23:04:06,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:06,484 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 32 treesize of output 24 [2023-11-06 23:04:06,516 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:04:06,529 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2023-11-06 23:04:06,656 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,656 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 198 treesize of output 168 [2023-11-06 23:04:06,676 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,677 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 670 treesize of output 672 [2023-11-06 23:04:06,698 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,698 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 344 treesize of output 234 [2023-11-06 23:04:06,711 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:06,736 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,736 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 1236 treesize of output 1230 [2023-11-06 23:04:06,782 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:06,783 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 99 treesize of output 93 [2023-11-06 23:04:06,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 53 treesize of output 49 [2023-11-06 23:04:06,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:06,813 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 78 treesize of output 68 [2023-11-06 23:04:06,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 90 treesize of output 82 [2023-11-06 23:04:06,899 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:04:06,914 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:04:06,968 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:06,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2023-11-06 23:04:07,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:07,028 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:07,028 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 72 treesize of output 80 [2023-11-06 23:04:07,670 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:07,670 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 47 treesize of output 38 [2023-11-06 23:04:07,685 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:07,685 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 96 treesize of output 67 [2023-11-06 23:04:07,708 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:07,708 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 163 treesize of output 165 [2023-11-06 23:04:07,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:07,729 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:07,730 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 268 treesize of output 270 [2023-11-06 23:04:07,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-11-06 23:04:07,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-06 23:04:07,770 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-11-06 23:04:07,783 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 50 treesize of output 42 [2023-11-06 23:04:07,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 8 treesize of output 4 [2023-11-06 23:04:07,856 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:04:07,902 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:07,902 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2023-11-06 23:04:07,975 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:07,976 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2023-11-06 23:04:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:13,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971590609] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:13,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:13,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 20] total 48 [2023-11-06 23:04:13,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736322140] [2023-11-06 23:04:13,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:13,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-06 23:04:13,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:13,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-06 23:04:13,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2052, Unknown=5, NotChecked=0, Total=2352 [2023-11-06 23:04:13,024 INFO L87 Difference]: Start difference. First operand 267 states and 327 transitions. Second operand has 49 states, 48 states have (on average 3.3958333333333335) internal successors, (163), 49 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have 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:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:25,807 INFO L93 Difference]: Finished difference Result 456 states and 541 transitions. [2023-11-06 23:04:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-06 23:04:25,808 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.3958333333333335) internal successors, (163), 49 states have internal predecessors, (163), 0 states have call successors, (0), 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 58 [2023-11-06 23:04:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:25,810 INFO L225 Difference]: With dead ends: 456 [2023-11-06 23:04:25,811 INFO L226 Difference]: Without dead ends: 456 [2023-11-06 23:04:25,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1666 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1081, Invalid=4920, Unknown=5, NotChecked=0, Total=6006 [2023-11-06 23:04:25,814 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 936 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 3072 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 3072 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:25,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1439 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 3072 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2023-11-06 23:04:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-11-06 23:04:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 278. [2023-11-06 23:04:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 239 states have (on average 1.4518828451882846) internal successors, (347), 277 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have 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:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 347 transitions. [2023-11-06 23:04:25,824 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 347 transitions. Word has length 58 [2023-11-06 23:04:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:25,825 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 347 transitions. [2023-11-06 23:04:25,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.3958333333333335) internal successors, (163), 49 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have 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:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 347 transitions. [2023-11-06 23:04:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 23:04:25,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:25,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:25,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:26,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-06 23:04:26,033 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:04:26,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:26,034 INFO L85 PathProgramCache]: Analyzing trace with hash -414862677, now seen corresponding path program 1 times [2023-11-06 23:04:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:26,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324105694] [2023-11-06 23:04:26,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:26,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324105694] [2023-11-06 23:04:26,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324105694] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433130437] [2023-11-06 23:04:26,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:26,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:26,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:26,605 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:26,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 23:04:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 23:04:26,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:27,194 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 17 [2023-11-06 23:04:27,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-06 23:04:27,352 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:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:27,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:27,654 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:04:27,661 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:27,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2023-11-06 23:04:27,708 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 23:04:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:27,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433130437] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:27,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:27,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2023-11-06 23:04:27,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470829966] [2023-11-06 23:04:27,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:27,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 23:04:27,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:27,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 23:04:27,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2023-11-06 23:04:27,767 INFO L87 Difference]: Start difference. First operand 278 states and 347 transitions. Second operand has 26 states, 25 states have (on average 4.52) internal successors, (113), 26 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:28,981 INFO L93 Difference]: Finished difference Result 353 states and 411 transitions. [2023-11-06 23:04:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 23:04:28,982 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.52) internal successors, (113), 26 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-11-06 23:04:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:28,984 INFO L225 Difference]: With dead ends: 353 [2023-11-06 23:04:28,984 INFO L226 Difference]: Without dead ends: 353 [2023-11-06 23:04:28,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2023-11-06 23:04:28,986 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 1011 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:28,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1049 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 23:04:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-11-06 23:04:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 287. [2023-11-06 23:04:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 249 states have (on average 1.4497991967871486) internal successors, (361), 286 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have 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:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 361 transitions. [2023-11-06 23:04:28,993 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 361 transitions. Word has length 59 [2023-11-06 23:04:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:28,994 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 361 transitions. [2023-11-06 23:04:28,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.52) internal successors, (113), 26 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 361 transitions. [2023-11-06 23:04:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 23:04:28,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:28,995 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:29,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:29,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-11-06 23:04:29,202 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:04:29,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash -414862676, now seen corresponding path program 1 times [2023-11-06 23:04:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:29,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247781711] [2023-11-06 23:04:29,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:29,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 23:04:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:29,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247781711] [2023-11-06 23:04:29,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247781711] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757592677] [2023-11-06 23:04:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:29,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:29,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:29,383 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:29,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 23:04:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 23:04:29,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 23:04:29,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:29,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757592677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:29,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-11-06 23:04:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307680499] [2023-11-06 23:04:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:29,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:29,820 INFO L87 Difference]: Start difference. First operand 287 states and 361 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:30,079 INFO L93 Difference]: Finished difference Result 341 states and 414 transitions. [2023-11-06 23:04:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:30,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-11-06 23:04:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:30,082 INFO L225 Difference]: With dead ends: 341 [2023-11-06 23:04:30,082 INFO L226 Difference]: Without dead ends: 341 [2023-11-06 23:04:30,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:30,083 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 150 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:30,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 172 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-06 23:04:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 303. [2023-11-06 23:04:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 269 states have (on average 1.4312267657992566) internal successors, (385), 302 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have 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,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 385 transitions. [2023-11-06 23:04:30,092 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 385 transitions. Word has length 59 [2023-11-06 23:04:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:30,093 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 385 transitions. [2023-11-06 23:04:30,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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,093 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 385 transitions. [2023-11-06 23:04:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 23:04:30,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:30,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:30,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:30,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-06 23:04:30,302 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:04:30,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash -414861873, now seen corresponding path program 1 times [2023-11-06 23:04:30,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:30,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140075204] [2023-11-06 23:04:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:30,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:31,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:31,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140075204] [2023-11-06 23:04:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140075204] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363599002] [2023-11-06 23:04:31,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:31,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:31,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:31,461 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:31,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 23:04:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-06 23:04:31,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:31,759 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:31,880 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 23:04:31,880 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:04:32,036 INFO L322 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-06 23:04:32,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-06 23:04:32,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:04:32,343 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 51 [2023-11-06 23:04:32,817 INFO L322 Elim1Store]: treesize reduction 19, result has 38.7 percent of original size [2023-11-06 23:04:32,817 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 39 [2023-11-06 23:04:32,821 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-06 23:04:33,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2023-11-06 23:04:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:33,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:33,862 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:04:33,995 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:33,996 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 650 treesize of output 642 [2023-11-06 23:04:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:37,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363599002] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:37,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:37,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 46 [2023-11-06 23:04:37,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115502657] [2023-11-06 23:04:37,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:37,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-06 23:04:37,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:37,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-06 23:04:37,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1963, Unknown=0, NotChecked=0, Total=2162 [2023-11-06 23:04:37,848 INFO L87 Difference]: Start difference. First operand 303 states and 385 transitions. Second operand has 47 states, 46 states have (on average 3.369565217391304) internal successors, (155), 47 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:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:44,035 INFO L93 Difference]: Finished difference Result 440 states and 511 transitions. [2023-11-06 23:04:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-06 23:04:44,036 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.369565217391304) internal successors, (155), 47 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) Word has length 59 [2023-11-06 23:04:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:44,038 INFO L225 Difference]: With dead ends: 440 [2023-11-06 23:04:44,038 INFO L226 Difference]: Without dead ends: 440 [2023-11-06 23:04:44,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=873, Invalid=6437, Unknown=0, NotChecked=0, Total=7310 [2023-11-06 23:04:44,041 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 819 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 2615 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:44,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1525 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2615 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-06 23:04:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2023-11-06 23:04:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 303. [2023-11-06 23:04:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 269 states have (on average 1.4275092936802973) internal successors, (384), 302 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have 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:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 384 transitions. [2023-11-06 23:04:44,050 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 384 transitions. Word has length 59 [2023-11-06 23:04:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:44,050 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 384 transitions. [2023-11-06 23:04:44,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.369565217391304) internal successors, (155), 47 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:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 384 transitions. [2023-11-06 23:04:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 23:04:44,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:44,051 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:44,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:44,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-06 23:04:44,258 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:04:44,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:44,258 INFO L85 PathProgramCache]: Analyzing trace with hash -414861872, now seen corresponding path program 1 times [2023-11-06 23:04:44,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:44,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800244315] [2023-11-06 23:04:44,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:44,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800244315] [2023-11-06 23:04:45,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800244315] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201241226] [2023-11-06 23:04:45,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:45,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:45,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:45,485 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:45,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 23:04:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:45,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-06 23:04:45,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:45,800 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:45,881 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 23:04:45,882 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:04:46,065 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 23:04:46,066 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-06 23:04:46,092 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-06 23:04:46,092 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 16 treesize of output 18 [2023-11-06 23:04:46,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:04:46,310 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 62 [2023-11-06 23:04:46,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-06 23:04:46,612 INFO L322 Elim1Store]: treesize reduction 19, result has 38.7 percent of original size [2023-11-06 23:04:46,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 56 [2023-11-06 23:04:46,986 INFO L322 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2023-11-06 23:04:46,986 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 10 case distinctions, treesize of input 93 treesize of output 118 [2023-11-06 23:04:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:49,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:50,043 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:50,044 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 244 treesize of output 229 [2023-11-06 23:04:50,492 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 85 treesize of output 81 [2023-11-06 23:04:50,517 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:04:50,559 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:04:50,559 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 814 treesize of output 798 [2023-11-06 23:04:50,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:04:50,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:04:50,679 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 54 treesize of output 50 [2023-11-06 23:04:50,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:04:50,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:04:51,741 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 137 treesize of output 129 [2023-11-06 23:04:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:52,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201241226] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:52,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:52,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 41 [2023-11-06 23:04:52,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368734336] [2023-11-06 23:04:52,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:52,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-06 23:04:52,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:52,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-06 23:04:52,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1551, Unknown=0, NotChecked=0, Total=1722 [2023-11-06 23:04:52,299 INFO L87 Difference]: Start difference. First operand 303 states and 384 transitions. Second operand has 42 states, 41 states have (on average 3.7804878048780486) internal successors, (155), 42 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:05:00,660 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, 1] [2023-11-06 23:05:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:01,665 INFO L93 Difference]: Finished difference Result 489 states and 561 transitions. [2023-11-06 23:05:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-06 23:05:01,666 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.7804878048780486) internal successors, (155), 42 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) Word has length 59 [2023-11-06 23:05:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:01,669 INFO L225 Difference]: With dead ends: 489 [2023-11-06 23:05:01,669 INFO L226 Difference]: Without dead ends: 489 [2023-11-06 23:05:01,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=918, Invalid=6054, Unknown=0, NotChecked=0, Total=6972 [2023-11-06 23:05:01,672 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 930 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:01,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1114 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2634 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2023-11-06 23:05:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-11-06 23:05:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 313. [2023-11-06 23:05:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 280 states have (on average 1.4285714285714286) internal successors, (400), 312 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have 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:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 400 transitions. [2023-11-06 23:05:01,682 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 400 transitions. Word has length 59 [2023-11-06 23:05:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:01,682 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 400 transitions. [2023-11-06 23:05:01,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.7804878048780486) internal successors, (155), 42 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:05:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 400 transitions. [2023-11-06 23:05:01,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 23:05:01,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:01,684 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:01,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:01,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-06 23:05:01,891 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-11-06 23:05:01,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:01,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1647086193, now seen corresponding path program 1 times [2023-11-06 23:05:01,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:01,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316225210] [2023-11-06 23:05:01,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:01,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:02,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:02,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316225210] [2023-11-06 23:05:02,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316225210] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:05:02,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799911911] [2023-11-06 23:05:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:02,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:02,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:02,887 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:05:02,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655644fb-ddbc-4699-a9c9-741d1deda4fc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 23:05:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:03,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-06 23:05:03,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:03,246 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:03,350 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:03,420 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:05:03,420 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:05:03,477 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 17 treesize of output 12 [2023-11-06 23:05:03,505 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 17 treesize of output 12 [2023-11-06 23:05:03,534 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 17 treesize of output 12 [2023-11-06 23:05:03,670 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 23:05:03,670 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 17 treesize of output 16 [2023-11-06 23:05:03,776 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 28 treesize of output 16 [2023-11-06 23:05:03,813 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-06 23:05:03,814 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 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-06 23:05:04,067 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:04,068 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 51 treesize of output 35 [2023-11-06 23:05:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:04,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:05:04,311 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:04,311 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2023-11-06 23:05:04,324 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_28 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_28 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_main_~data~0#1.base|) (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) 0)))) is different from false [2023-11-06 23:05:04,819 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:04,819 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 28 treesize of output 29 [2023-11-06 23:05:04,833 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:04,834 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 165 treesize of output 158 [2023-11-06 23:05:04,851 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:05:04,851 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 80 treesize of output 68 [2023-11-06 23:05:04,858 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 50 treesize of output 46 [2023-11-06 23:05:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799911911] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:05:05,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:05:05,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 37 [2023-11-06 23:05:05,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431826534] [2023-11-06 23:05:05,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:05:05,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-06 23:05:05,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:05,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-06 23:05:05,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1138, Unknown=7, NotChecked=68, Total=1332 [2023-11-06 23:05:05,335 INFO L87 Difference]: Start difference. First operand 313 states and 400 transitions. Second operand has 37 states, 37 states have (on average 4.135135135135135) internal successors, (153), 37 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have 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,693 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:12,122 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]