./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.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_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/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_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/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_f2182987-af44-4f5d-bee4-297bf58e226e/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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:29:59,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:29:59,794 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:29:59,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:29:59,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:29:59,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:29:59,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:29:59,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:29:59,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:29:59,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:29:59,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:29:59,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:29:59,831 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:29:59,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:29:59,832 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:29:59,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:29:59,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:29:59,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:29:59,835 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:29:59,835 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:29:59,836 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:29:59,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:29:59,837 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:29:59,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:29:59,839 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:29:59,839 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:29:59,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:29:59,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:29:59,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:29:59,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:29:59,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:29:59,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:29:59,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:29:59,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:29:59,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:29:59,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:29:59,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:29:59,844 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:29:59,845 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_f2182987-af44-4f5d-bee4-297bf58e226e/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_f2182987-af44-4f5d-bee4-297bf58e226e/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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2023-11-06 22:30:00,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:30:00,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:30:00,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:30:00,154 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:30:00,155 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:30:00,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2023-11-06 22:30:03,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:30:03,625 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:30:03,626 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2023-11-06 22:30:03,641 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/data/7a544d17f/0f41310115824e18a2e85bb3dbc40418/FLAG0a77b6e59 [2023-11-06 22:30:03,656 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/data/7a544d17f/0f41310115824e18a2e85bb3dbc40418 [2023-11-06 22:30:03,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:30:03,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:30:03,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:30:03,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:30:03,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:30:03,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:30:03" (1/1) ... [2023-11-06 22:30:03,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@514f185d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:03, skipping insertion in model container [2023-11-06 22:30:03,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:30:03" (1/1) ... [2023-11-06 22:30:03,712 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:30:04,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:30:04,058 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:30:04,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:30:04,181 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:30:04,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04 WrapperNode [2023-11-06 22:30:04,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:30:04,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:30:04,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:30:04,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:30:04,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,260 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2023-11-06 22:30:04,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:30:04,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:30:04,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:30:04,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:30:04,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:30:04,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:30:04,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:30:04,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:30:04,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (1/1) ... [2023-11-06 22:30:04,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:30:04,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:04,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:30:04,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:30:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:30:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:30:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 22:30:04,416 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 22:30:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:30:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:30:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:30:04,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:30:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:30:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:30:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:30:04,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:30:04,556 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:30:04,560 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:30:04,867 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:30:04,875 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:30:04,875 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 22:30:04,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:30:04 BoogieIcfgContainer [2023-11-06 22:30:04,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:30:04,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:30:04,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:30:04,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:30:04,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:30:03" (1/3) ... [2023-11-06 22:30:04,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6788de18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:30:04, skipping insertion in model container [2023-11-06 22:30:04,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:04" (2/3) ... [2023-11-06 22:30:04,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6788de18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:30:04, skipping insertion in model container [2023-11-06 22:30:04,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:30:04" (3/3) ... [2023-11-06 22:30:04,892 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2023-11-06 22:30:04,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:30:04,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-11-06 22:30:04,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:30:04,977 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;@12104ac0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:30:04,977 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-11-06 22:30:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 82 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:30:04,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:04,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:30:04,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:04,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:04,998 INFO L85 PathProgramCache]: Analyzing trace with hash 894752021, now seen corresponding path program 1 times [2023-11-06 22:30:05,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:05,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480976054] [2023-11-06 22:30:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:05,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:05,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480976054] [2023-11-06 22:30:05,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480976054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:05,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:05,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:30:05,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632961032] [2023-11-06 22:30:05,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:05,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:30:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:05,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:30:05,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:30:05,407 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 82 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:30:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:05,551 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2023-11-06 22:30:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:30:05,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 22:30:05,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:05,565 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:30:05,565 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:30:05,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:30:05,572 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:05,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:30:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-06 22:30:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-11-06 22:30:05,615 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 6 [2023-11-06 22:30:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:05,616 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-11-06 22:30:05,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:30:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-11-06 22:30:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:30:05,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:05,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:30:05,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:30:05,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:05,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash 894752022, now seen corresponding path program 1 times [2023-11-06 22:30:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:05,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898035977] [2023-11-06 22:30:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:05,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:05,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:05,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898035977] [2023-11-06 22:30:05,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898035977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:05,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:05,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:30:05,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849138838] [2023-11-06 22:30:05,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:05,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:30:05,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:05,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:30:05,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:30:05,755 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:30:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:05,835 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2023-11-06 22:30:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:30:05,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 22:30:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:05,837 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:30:05,837 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 22:30:05,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:30:05,839 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:05,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 141 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 22:30:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-06 22:30:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.588235294117647) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-11-06 22:30:05,850 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2023-11-06 22:30:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:05,853 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-11-06 22:30:05,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:30:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-11-06 22:30:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:30:05,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:05,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:05,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:30:05,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:05,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1374205737, now seen corresponding path program 1 times [2023-11-06 22:30:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:05,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428746066] [2023-11-06 22:30:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:05,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:06,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:06,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:06,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428746066] [2023-11-06 22:30:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428746066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:30:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469984335] [2023-11-06 22:30:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:06,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:30:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:06,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:30:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:30:06,114 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:30:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:06,207 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-11-06 22:30:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:30:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-11-06 22:30:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:06,211 INFO L225 Difference]: With dead ends: 85 [2023-11-06 22:30:06,214 INFO L226 Difference]: Without dead ends: 85 [2023-11-06 22:30:06,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:30:06,216 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:06,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 206 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-06 22:30:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-11-06 22:30:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 75 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2023-11-06 22:30:06,238 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 13 [2023-11-06 22:30:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:06,239 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2023-11-06 22:30:06,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:30:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2023-11-06 22:30:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:30:06,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:06,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:06,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:30:06,243 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:06,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash -469621220, now seen corresponding path program 1 times [2023-11-06 22:30:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512935695] [2023-11-06 22:30:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:30:06,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:06,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512935695] [2023-11-06 22:30:06,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512935695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:06,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:30:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542807364] [2023-11-06 22:30:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:06,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:30:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:30:06,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:30:06,588 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:06,774 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2023-11-06 22:30:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:30:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-11-06 22:30:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:06,781 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:30:06,782 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 22:30:06,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:30:06,791 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:06,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 322 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 22:30:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-06 22:30:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-11-06 22:30:06,808 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 22 [2023-11-06 22:30:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:06,808 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-11-06 22:30:06,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-11-06 22:30:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:30:06,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:06,810 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:06,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:30:06,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:06,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash -469621219, now seen corresponding path program 1 times [2023-11-06 22:30:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:06,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304043874] [2023-11-06 22:30:06,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:06,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:30:07,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:07,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304043874] [2023-11-06 22:30:07,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304043874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:07,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:07,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:30:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177044081] [2023-11-06 22:30:07,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:07,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:30:07,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:07,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:30:07,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:30:07,201 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:07,376 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2023-11-06 22:30:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:30:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-11-06 22:30:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:07,380 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:30:07,380 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:30:07,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:30:07,387 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 3 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:07,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 344 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:30:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-06 22:30:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2023-11-06 22:30:07,402 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 22 [2023-11-06 22:30:07,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:07,402 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2023-11-06 22:30:07,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2023-11-06 22:30:07,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:30:07,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:07,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:07,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:30:07,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:07,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1777293115, now seen corresponding path program 1 times [2023-11-06 22:30:07,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:07,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624856781] [2023-11-06 22:30:07,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:30:07,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:07,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624856781] [2023-11-06 22:30:07,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624856781] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063615228] [2023-11-06 22:30:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:07,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:07,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:07,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:07,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:30:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:07,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:30:07,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:07,953 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:30:08,081 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:30:08,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-06 22:30:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:30:08,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:30:08,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063615228] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:08,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:08,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-11-06 22:30:08,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153135020] [2023-11-06 22:30:08,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:08,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:30:08,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:08,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:30:08,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:30:08,473 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:30:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:08,766 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2023-11-06 22:30:08,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:30:08,767 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-11-06 22:30:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:08,768 INFO L225 Difference]: With dead ends: 76 [2023-11-06 22:30:08,768 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 22:30:08,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:30:08,770 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 9 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:08,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 604 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:30:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 22:30:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-06 22:30:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2023-11-06 22:30:08,776 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 25 [2023-11-06 22:30:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:08,776 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2023-11-06 22:30:08,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:30:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2023-11-06 22:30:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:30:08,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:08,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:08,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:08,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:08,984 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:08,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1777293114, now seen corresponding path program 1 times [2023-11-06 22:30:08,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:08,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569830090] [2023-11-06 22:30:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:09,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:30:09,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:09,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569830090] [2023-11-06 22:30:09,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569830090] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:09,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881897723] [2023-11-06 22:30:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:09,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:09,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:09,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:09,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:30:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:09,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 22:30:09,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:09,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:30:09,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:30:09,871 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:30:09,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:30:09,879 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:30:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:09,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:10,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881897723] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:10,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:30:10,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-11-06 22:30:10,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047102490] [2023-11-06 22:30:10,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:10,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:30:10,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:30:10,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:30:10,097 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:30:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:10,377 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-11-06 22:30:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:30:10,378 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-11-06 22:30:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:10,379 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:30:10,379 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:30:10,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:30:10,380 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 13 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:10,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 409 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:30:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:30:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-11-06 22:30:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2023-11-06 22:30:10,389 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 25 [2023-11-06 22:30:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:10,389 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2023-11-06 22:30:10,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:30:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2023-11-06 22:30:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:30:10,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:10,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:10,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:10,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:10,597 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:10,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:10,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1307976759, now seen corresponding path program 1 times [2023-11-06 22:30:10,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:10,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137935465] [2023-11-06 22:30:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:10,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:30:10,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:10,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137935465] [2023-11-06 22:30:10,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137935465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:10,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:10,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:30:10,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203682952] [2023-11-06 22:30:10,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:10,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:30:10,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:10,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:30:10,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:10,866 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:11,150 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-11-06 22:30:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:30:11,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-06 22:30:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:11,153 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:30:11,153 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 22:30:11,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:30:11,154 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 139 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:11,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 393 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:30:11,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 22:30:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2023-11-06 22:30:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 74 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2023-11-06 22:30:11,159 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 30 [2023-11-06 22:30:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:11,160 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2023-11-06 22:30:11,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2023-11-06 22:30:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:30:11,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:11,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:11,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:30:11,162 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:11,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1307976758, now seen corresponding path program 1 times [2023-11-06 22:30:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:11,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603648027] [2023-11-06 22:30:11,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:11,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:11,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:30:11,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603648027] [2023-11-06 22:30:11,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603648027] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361195454] [2023-11-06 22:30:11,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:11,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:11,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:30:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:11,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:30:11,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:30:11,525 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:30:11,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361195454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:11,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:30:11,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-11-06 22:30:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563991441] [2023-11-06 22:30:11,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:11,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:11,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:11,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:30:11,528 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:11,583 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2023-11-06 22:30:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:11,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-06 22:30:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:11,585 INFO L225 Difference]: With dead ends: 108 [2023-11-06 22:30:11,585 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:30:11,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:30:11,587 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 128 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:11,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 221 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:30:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2023-11-06 22:30:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.5) internal successors, (87), 77 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2023-11-06 22:30:11,600 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 30 [2023-11-06 22:30:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:11,600 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2023-11-06 22:30:11,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2023-11-06 22:30:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:30:11,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:11,605 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:11,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:11,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:11,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:11,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1307976703, now seen corresponding path program 1 times [2023-11-06 22:30:11,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:11,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768560438] [2023-11-06 22:30:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:12,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:12,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:30:12,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:12,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768560438] [2023-11-06 22:30:12,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768560438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:12,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:12,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:30:12,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452481835] [2023-11-06 22:30:12,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:12,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:30:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:12,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:30:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:12,247 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:12,537 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-11-06 22:30:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:30:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-06 22:30:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:12,539 INFO L225 Difference]: With dead ends: 84 [2023-11-06 22:30:12,539 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 22:30:12,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:30:12,540 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 134 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:12,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 431 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:30:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 22:30:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2023-11-06 22:30:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-11-06 22:30:12,548 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 30 [2023-11-06 22:30:12,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:12,551 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-11-06 22:30:12,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-11-06 22:30:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:30:12,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:12,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:12,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:30:12,556 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:12,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1990660867, now seen corresponding path program 1 times [2023-11-06 22:30:12,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:12,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201991894] [2023-11-06 22:30:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:13,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:30:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201991894] [2023-11-06 22:30:13,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201991894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122851582] [2023-11-06 22:30:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:13,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:13,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:13,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:13,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:30:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:13,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-06 22:30:13,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:13,396 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:30:13,529 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:30:13,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:30:13,601 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 22:30:13,701 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:30:13,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:30:13,907 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:30:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:13,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:14,269 INFO L322 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-11-06 22:30:14,269 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:30:14,519 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:14,519 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 18 treesize of output 19 [2023-11-06 22:30:14,530 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:14,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2023-11-06 22:30:14,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-06 22:30:14,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122851582] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:14,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:30:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 29 [2023-11-06 22:30:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015569237] [2023-11-06 22:30:14,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:14,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-06 22:30:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:14,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:30:14,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1391, Unknown=0, NotChecked=0, Total=1482 [2023-11-06 22:30:14,816 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 25 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:30:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:15,785 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2023-11-06 22:30:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:30:15,786 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 25 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-11-06 22:30:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:15,788 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:30:15,788 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:30:15,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=186, Invalid=2166, Unknown=0, NotChecked=0, Total=2352 [2023-11-06 22:30:15,790 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 91 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:15,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1218 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:30:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:30:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2023-11-06 22:30:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 91 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:30:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2023-11-06 22:30:15,796 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 33 [2023-11-06 22:30:15,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:15,796 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2023-11-06 22:30:15,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 25 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:30:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2023-11-06 22:30:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:30:15,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:15,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:15,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-06 22:30:16,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:30:16,010 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:16,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1990660866, now seen corresponding path program 1 times [2023-11-06 22:30:16,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:16,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983199894] [2023-11-06 22:30:16,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:16,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:30:17,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:17,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983199894] [2023-11-06 22:30:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983199894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:17,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717703496] [2023-11-06 22:30:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:17,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:17,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:17,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:17,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:30:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:17,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-06 22:30:17,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:17,226 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:30:17,551 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:30:17,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:30:17,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:30:17,674 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 22:30:17,683 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:30:17,816 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:30:17,816 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2023-11-06 22:30:17,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 39 treesize of output 24 [2023-11-06 22:30:18,067 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-11-06 22:30:18,071 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-06 22:30:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:18,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:18,674 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_819 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)))) is different from false [2023-11-06 22:30:18,684 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:18,684 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 20 treesize of output 21 [2023-11-06 22:30:18,688 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 34 treesize of output 26 [2023-11-06 22:30:18,705 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:18,705 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 37 treesize of output 38 [2023-11-06 22:30:18,712 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:18,716 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 29 treesize of output 30 [2023-11-06 22:30:18,719 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:30:18,721 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 27 treesize of output 19 [2023-11-06 22:30:18,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:30:18,727 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 20 treesize of output 12 [2023-11-06 22:30:19,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717703496] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:19,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:30:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2023-11-06 22:30:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374340219] [2023-11-06 22:30:19,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:19,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-06 22:30:19,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:19,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-06 22:30:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2006, Unknown=27, NotChecked=90, Total=2256 [2023-11-06 22:30:19,014 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:30:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:20,344 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2023-11-06 22:30:20,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:30:20,344 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-11-06 22:30:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:20,345 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:30:20,345 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:30:20,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=218, Invalid=2729, Unknown=27, NotChecked=106, Total=3080 [2023-11-06 22:30:20,347 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 82 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:20,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1567 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:30:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:30:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2023-11-06 22:30:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 88 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:30:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2023-11-06 22:30:20,353 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 33 [2023-11-06 22:30:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:20,353 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2023-11-06 22:30:20,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:30:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2023-11-06 22:30:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 22:30:20,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:20,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:20,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:20,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:30:20,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:20,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:20,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1132191561, now seen corresponding path program 2 times [2023-11-06 22:30:20,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:20,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378399577] [2023-11-06 22:30:20,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:20,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:20,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:30:20,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:20,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378399577] [2023-11-06 22:30:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378399577] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416079451] [2023-11-06 22:30:20,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:30:20,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:20,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:20,744 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:20,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:30:20,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:30:20,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:30:20,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:30:20,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:30:20,964 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:30:20,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416079451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:20,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:30:20,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2023-11-06 22:30:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551955046] [2023-11-06 22:30:20,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:20,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:30:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:20,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:30:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:30:20,967 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:21,019 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-11-06 22:30:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:21,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-06 22:30:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:21,020 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:30:21,021 INFO L226 Difference]: Without dead ends: 91 [2023-11-06 22:30:21,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:21,022 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 120 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:21,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 223 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-06 22:30:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-06 22:30:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 86 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:30:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2023-11-06 22:30:21,027 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 36 [2023-11-06 22:30:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:21,028 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2023-11-06 22:30:21,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2023-11-06 22:30:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 22:30:21,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:21,031 INFO L195 NwaCegarLoop]: trace histogram [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 22:30:21,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:21,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:30:21,242 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:21,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:21,242 INFO L85 PathProgramCache]: Analyzing trace with hash -929319762, now seen corresponding path program 1 times [2023-11-06 22:30:21,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:21,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826822016] [2023-11-06 22:30:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:21,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:30:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826822016] [2023-11-06 22:30:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826822016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:21,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:21,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:30:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848031400] [2023-11-06 22:30:21,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:21,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:30:21,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:21,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:30:21,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:21,460 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:21,735 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2023-11-06 22:30:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:30:21,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2023-11-06 22:30:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:21,737 INFO L225 Difference]: With dead ends: 116 [2023-11-06 22:30:21,737 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:30:21,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:30:21,738 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 126 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:21,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 385 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:30:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:30:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2023-11-06 22:30:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 89 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:30:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2023-11-06 22:30:21,742 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 40 [2023-11-06 22:30:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:21,742 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2023-11-06 22:30:21,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2023-11-06 22:30:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 22:30:21,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:21,743 INFO L195 NwaCegarLoop]: trace histogram [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 22:30:21,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:30:21,744 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:21,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash -929319761, now seen corresponding path program 1 times [2023-11-06 22:30:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:21,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262168387] [2023-11-06 22:30:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:21,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:21,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:30:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262168387] [2023-11-06 22:30:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262168387] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990992259] [2023-11-06 22:30:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:21,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:21,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:21,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:21,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:30:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:22,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:30:22,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:30:22,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:30:22,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990992259] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:22,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:22,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2023-11-06 22:30:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393289423] [2023-11-06 22:30:22,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:22,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:30:22,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:30:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:30:22,184 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:30:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:22,282 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2023-11-06 22:30:22,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:30:22,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-11-06 22:30:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:22,284 INFO L225 Difference]: With dead ends: 124 [2023-11-06 22:30:22,284 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:30:22,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:30:22,287 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 149 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:22,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 247 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:30:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2023-11-06 22:30:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.423913043478261) internal successors, (131), 109 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:30:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2023-11-06 22:30:22,292 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 40 [2023-11-06 22:30:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:22,293 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2023-11-06 22:30:22,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:30:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2023-11-06 22:30:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:30:22,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:22,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:22,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:22,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:30:22,499 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:22,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1295717653, now seen corresponding path program 1 times [2023-11-06 22:30:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:22,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969557667] [2023-11-06 22:30:22,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:22,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:30:22,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969557667] [2023-11-06 22:30:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969557667] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:22,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576727901] [2023-11-06 22:30:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:22,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:22,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:22,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:22,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:30:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:22,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:30:22,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:30:22,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:30:22,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576727901] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:22,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:22,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2023-11-06 22:30:22,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978406316] [2023-11-06 22:30:22,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:22,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:30:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:30:22,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:30:22,957 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:30:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:23,096 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2023-11-06 22:30:23,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:30:23,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-11-06 22:30:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:23,098 INFO L225 Difference]: With dead ends: 118 [2023-11-06 22:30:23,098 INFO L226 Difference]: Without dead ends: 118 [2023-11-06 22:30:23,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:30:23,099 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 160 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:23,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 342 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:23,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-06 22:30:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2023-11-06 22:30:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 105 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:30:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2023-11-06 22:30:23,105 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 41 [2023-11-06 22:30:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:23,106 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2023-11-06 22:30:23,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:30:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2023-11-06 22:30:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:30:23,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:23,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:23,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:23,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:30:23,313 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:23,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash 874580459, now seen corresponding path program 3 times [2023-11-06 22:30:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:23,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887568292] [2023-11-06 22:30:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:23,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:23,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:30:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:30:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887568292] [2023-11-06 22:30:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887568292] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250002125] [2023-11-06 22:30:23,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:30:23,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:23,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:23,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:30:23,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 22:30:23,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:30:23,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:30:23,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:30:23,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:30:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250002125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:23,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:30:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-06 22:30:23,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978644419] [2023-11-06 22:30:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:23,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:30:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:23,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:30:23,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:30:23,717 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:30:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:23,729 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2023-11-06 22:30:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:30:23,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2023-11-06 22:30:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:23,730 INFO L225 Difference]: With dead ends: 94 [2023-11-06 22:30:23,731 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 22:30:23,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:30:23,732 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:23,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 22:30:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-06 22:30:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 90 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2023-11-06 22:30:23,736 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 45 [2023-11-06 22:30:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:23,736 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2023-11-06 22:30:23,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:30:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2023-11-06 22:30:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:30:23,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:23,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:23,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:23,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:30:23,949 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:23,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:23,949 INFO L85 PathProgramCache]: Analyzing trace with hash -789371781, now seen corresponding path program 2 times [2023-11-06 22:30:23,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:23,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809555542] [2023-11-06 22:30:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:24,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:30:24,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:24,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809555542] [2023-11-06 22:30:24,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809555542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:24,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:24,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:30:24,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758681889] [2023-11-06 22:30:24,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:24,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:30:24,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:24,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:30:24,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:24,356 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:24,599 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2023-11-06 22:30:24,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:30:24,600 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-11-06 22:30:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:24,601 INFO L225 Difference]: With dead ends: 100 [2023-11-06 22:30:24,601 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 22:30:24,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:30:24,602 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 124 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:24,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 392 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:30:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 22:30:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2023-11-06 22:30:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 90 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2023-11-06 22:30:24,609 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 45 [2023-11-06 22:30:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:24,609 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2023-11-06 22:30:24,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2023-11-06 22:30:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:30:24,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:24,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:24,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:30:24,611 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:24,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:24,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1228758467, now seen corresponding path program 1 times [2023-11-06 22:30:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:24,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929014257] [2023-11-06 22:30:24,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:24,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:24,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:30:24,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:24,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929014257] [2023-11-06 22:30:24,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929014257] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:24,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574539425] [2023-11-06 22:30:24,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:24,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:24,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:24,807 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:24,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:30:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:25,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:30:25,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:30:25,073 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:30:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574539425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:25,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:30:25,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2023-11-06 22:30:25,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002251808] [2023-11-06 22:30:25,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:25,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:30:25,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:25,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:30:25,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:30:25,079 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:25,126 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2023-11-06 22:30:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:25,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-11-06 22:30:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:25,128 INFO L225 Difference]: With dead ends: 90 [2023-11-06 22:30:25,128 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 22:30:25,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:25,129 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 100 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:25,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 209 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 22:30:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-06 22:30:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 86 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2023-11-06 22:30:25,134 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 48 [2023-11-06 22:30:25,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:25,135 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2023-11-06 22:30:25,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2023-11-06 22:30:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:30:25,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:25,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:25,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:25,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:25,342 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:25,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1228758522, now seen corresponding path program 1 times [2023-11-06 22:30:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:25,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865645154] [2023-11-06 22:30:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:26,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:26,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:30:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865645154] [2023-11-06 22:30:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865645154] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730689704] [2023-11-06 22:30:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:26,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:26,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:26,547 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:26,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:30:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:26,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-06 22:30:26,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:26,816 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:30:26,964 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:30:26,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:30:27,039 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 22:30:27,150 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:30:27,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:30:27,464 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:30:27,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:30:27,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:30:27,557 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 37 treesize of output 17 [2023-11-06 22:30:27,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:30:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:30:27,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:28,748 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2023-11-06 22:30:28,758 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2023-11-06 22:30:28,865 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1756) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2023-11-06 22:30:29,065 INFO L322 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-11-06 22:30:29,066 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 29 treesize of output 28 [2023-11-06 22:30:29,071 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1755))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1756)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2023-11-06 22:30:29,205 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:29,205 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 36 treesize of output 29 [2023-11-06 22:30:29,211 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 236 treesize of output 200 [2023-11-06 22:30:29,223 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 155 treesize of output 147 [2023-11-06 22:30:29,229 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 147 treesize of output 135 [2023-11-06 22:30:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730689704] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:29,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:30:29,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 39 [2023-11-06 22:30:29,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300750230] [2023-11-06 22:30:29,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:29,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-06 22:30:29,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:29,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-06 22:30:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1869, Unknown=72, NotChecked=364, Total=2450 [2023-11-06 22:30:29,369 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:30:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:30,822 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2023-11-06 22:30:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:30:30,823 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2023-11-06 22:30:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:30,824 INFO L225 Difference]: With dead ends: 113 [2023-11-06 22:30:30,824 INFO L226 Difference]: Without dead ends: 113 [2023-11-06 22:30:30,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=304, Invalid=3300, Unknown=72, NotChecked=484, Total=4160 [2023-11-06 22:30:30,827 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 89 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:30,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1240 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:30:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-06 22:30:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 89. [2023-11-06 22:30:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2023-11-06 22:30:30,832 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 48 [2023-11-06 22:30:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:30,832 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2023-11-06 22:30:30,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:30:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2023-11-06 22:30:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:30:30,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:30,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:30,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:31,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:31,040 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:31,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1228758521, now seen corresponding path program 1 times [2023-11-06 22:30:31,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:31,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367241306] [2023-11-06 22:30:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:32,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:30:32,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:32,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367241306] [2023-11-06 22:30:32,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367241306] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:32,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251636946] [2023-11-06 22:30:32,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:32,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:32,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:32,963 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:32,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:30:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:33,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-06 22:30:33,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:33,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:30:33,538 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:30:33,538 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:30:33,643 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 22:30:33,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:30:33,776 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:30:33,776 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 41 treesize of output 38 [2023-11-06 22:30:33,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:30:34,209 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:30:34,210 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2023-11-06 22:30:34,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2023-11-06 22:30:34,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:30:34,424 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 23 [2023-11-06 22:30:34,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:30:34,432 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2023-11-06 22:30:34,567 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-11-06 22:30:34,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-06 22:30:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:30:34,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:35,038 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_1901 (Array Int Int))) (or (forall ((v_ArrVal_1902 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1902)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= (store .cse1 .cse0 (select v_ArrVal_1901 .cse0)) v_ArrVal_1901)))) (forall ((v_ArrVal_1901 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= (store .cse1 .cse0 (select v_ArrVal_1901 .cse0)) v_ArrVal_1901)))))) is different from false [2023-11-06 22:30:35,327 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:35,328 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 42 treesize of output 46 [2023-11-06 22:30:35,363 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1898 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1899 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1899) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 1)))) is different from false [2023-11-06 22:30:35,396 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1899 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1899) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (+ 1 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|))) (forall ((v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1898 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|))) is different from false [2023-11-06 22:30:35,417 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1899 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1899) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 1))) (forall ((v_ArrVal_1898 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (forall ((v_prenex_3 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2023-11-06 22:30:35,761 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1898 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0)) (forall ((v_ArrVal_1899 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1899) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1))) (forall ((v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))))) is different from false [2023-11-06 22:30:35,784 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1896 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1897) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1897))) (< (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1899) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (+ (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1))))) is different from false [2023-11-06 22:30:35,816 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1897) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (forall ((v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1897))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1899) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (+ (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 1)))) (forall ((v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1896 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) is different from false [2023-11-06 22:30:35,835 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:35,835 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 143 treesize of output 128 [2023-11-06 22:30:35,853 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:35,853 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 117 treesize of output 86 [2023-11-06 22:30:35,859 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 254 treesize of output 210 [2023-11-06 22:30:35,871 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 851 treesize of output 767 [2023-11-06 22:30:35,885 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 131 [2023-11-06 22:30:35,891 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 131 treesize of output 127 [2023-11-06 22:30:35,897 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 127 treesize of output 123 [2023-11-06 22:30:35,903 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 123 treesize of output 121 [2023-11-06 22:30:35,909 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 121 treesize of output 117 [2023-11-06 22:30:35,916 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 117 treesize of output 115 [2023-11-06 22:30:35,923 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 115 treesize of output 111 [2023-11-06 22:30:35,936 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 111 treesize of output 107 [2023-11-06 22:30:36,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251636946] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:36,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:30:36,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2023-11-06 22:30:36,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291481279] [2023-11-06 22:30:36,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:36,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-06 22:30:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:36,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-06 22:30:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3007, Unknown=21, NotChecked=812, Total=4032 [2023-11-06 22:30:36,219 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:30:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:37,907 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2023-11-06 22:30:37,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:30:37,908 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2023-11-06 22:30:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:37,909 INFO L225 Difference]: With dead ends: 92 [2023-11-06 22:30:37,909 INFO L226 Difference]: Without dead ends: 92 [2023-11-06 22:30:37,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=343, Invalid=4220, Unknown=21, NotChecked=966, Total=5550 [2023-11-06 22:30:37,912 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 300 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:37,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1560 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:30:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-06 22:30:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2023-11-06 22:30:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 82 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2023-11-06 22:30:37,916 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 48 [2023-11-06 22:30:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:37,917 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2023-11-06 22:30:37,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:30:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2023-11-06 22:30:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 22:30:37,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:37,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:37,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:38,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:38,124 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:38,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1292317738, now seen corresponding path program 1 times [2023-11-06 22:30:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191601783] [2023-11-06 22:30:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:38,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:38,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:30:38,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:38,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191601783] [2023-11-06 22:30:38,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191601783] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:38,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747568774] [2023-11-06 22:30:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:38,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:38,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:38,383 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:38,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:30:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:38,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:30:38,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:30:38,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:30:38,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747568774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:38,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:30:38,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-11-06 22:30:38,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903436236] [2023-11-06 22:30:38,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:38,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:38,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:38,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:30:38,681 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:38,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:38,733 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2023-11-06 22:30:38,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:38,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2023-11-06 22:30:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:38,735 INFO L225 Difference]: With dead ends: 90 [2023-11-06 22:30:38,735 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 22:30:38,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:30:38,736 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 80 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:38,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 196 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 22:30:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2023-11-06 22:30:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-11-06 22:30:38,740 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 51 [2023-11-06 22:30:38,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:38,740 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-11-06 22:30:38,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-11-06 22:30:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 22:30:38,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:38,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:38,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:38,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 22:30:38,948 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:38,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2010491737, now seen corresponding path program 1 times [2023-11-06 22:30:38,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:38,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303282783] [2023-11-06 22:30:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:41,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:30:41,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:41,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303282783] [2023-11-06 22:30:41,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303282783] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:41,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653840724] [2023-11-06 22:30:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:41,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:41,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:41,547 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:41,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:30:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:41,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-06 22:30:41,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:41,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:30:42,206 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:30:42,206 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:30:42,327 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 22:30:42,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:30:42,471 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:30:42,472 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 41 treesize of output 38 [2023-11-06 22:30:42,478 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 16 treesize of output 1 [2023-11-06 22:30:42,955 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:30:42,955 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 66 treesize of output 59 [2023-11-06 22:30:42,960 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 25 treesize of output 17 [2023-11-06 22:30:42,963 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 21 [2023-11-06 22:30:43,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:30:43,183 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2023-11-06 22:30:43,189 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 21 [2023-11-06 22:30:43,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:30:43,197 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 37 treesize of output 21 [2023-11-06 22:30:43,406 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 21 [2023-11-06 22:30:43,409 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 21 treesize of output 13 [2023-11-06 22:30:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:30:43,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:44,053 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (or (not (= v_ArrVal_2180 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2180 .cse0)))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2179) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_2177)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2180) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from false [2023-11-06 22:30:44,081 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (v_DerPreprocessor_3 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2179) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_3) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2023-11-06 22:30:44,119 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:44,120 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2023-11-06 22:30:44,133 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:44,133 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 104 treesize of output 103 [2023-11-06 22:30:44,143 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 39 treesize of output 23 [2023-11-06 22:30:45,020 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2177 Int) (v_ArrVal_2174 (Array Int Int))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2174) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2177 Int) (v_ArrVal_2174 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2174) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2176 (Array Int Int)) (v_DerPreprocessor_3 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2176) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_DerPreprocessor_3) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))))))) is different from false [2023-11-06 22:30:45,417 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_2177 Int) (v_ArrVal_2174 (Array Int Int))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2174) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int)) (or (forall ((v_ArrVal_2176 (Array Int Int)) (v_DerPreprocessor_3 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2176) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_DerPreprocessor_3) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int)) (or (forall ((v_ArrVal_2177 Int) (v_ArrVal_2174 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2174) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) is different from false [2023-11-06 22:30:45,448 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2177 Int) (v_ArrVal_2174 (Array Int Int))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2174) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2176 (Array Int Int)) (v_DerPreprocessor_3 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2176) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_DerPreprocessor_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int)) (or (forall ((v_ArrVal_2177 Int) (v_ArrVal_2174 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2174) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-11-06 22:30:45,484 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int) (v_ArrVal_2173 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2177 Int) (v_ArrVal_2174 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2173))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse0 (select (store (select (store .cse1 .cse0 v_ArrVal_2174) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (or (forall ((v_ArrVal_2176 (Array Int Int)) (v_DerPreprocessor_3 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2172))) (= (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (store (select (store .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2173) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2176) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_DerPreprocessor_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int) (v_ArrVal_2173 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2177 Int) (v_ArrVal_2174 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2173))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2174)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2023-11-06 22:30:45,575 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int) (v_ArrVal_2173 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2177 Int) (v_ArrVal_2174 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2173))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2174)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2176 (Array Int Int)) (v_DerPreprocessor_3 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2172))) (= (select (store (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2173) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2176) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_DerPreprocessor_3) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| Int) (v_ArrVal_2173 (Array Int Int))) (or (forall ((v_ArrVal_2177 Int) (v_ArrVal_2174 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2173))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= .cse2 (select (store (select (store .cse3 .cse2 v_ArrVal_2174) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| 4) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2023-11-06 22:30:45,600 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:30:45,600 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 42 treesize of output 35 [2023-11-06 22:30:45,604 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 161 treesize of output 149 [2023-11-06 22:30:45,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:30:45,612 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 72 treesize of output 68 [2023-11-06 22:30:45,615 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:30:45,617 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 56 treesize of output 52 [2023-11-06 22:30:45,621 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:30:45,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-06 22:30:45,635 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:30:45,635 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 1 [2023-11-06 22:30:45,645 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:30:45,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 1 [2023-11-06 22:30:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-06 22:30:46,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653840724] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:46,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:46,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 29] total 81 [2023-11-06 22:30:46,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300208861] [2023-11-06 22:30:46,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:46,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-11-06 22:30:46,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:46,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-11-06 22:30:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=5083, Unknown=101, NotChecked=1050, Total=6480 [2023-11-06 22:30:46,290 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 81 states, 79 states have (on average 1.6708860759493671) internal successors, (132), 72 states have internal predecessors, (132), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:30:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:51,464 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2023-11-06 22:30:51,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 22:30:51,465 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 79 states have (on average 1.6708860759493671) internal successors, (132), 72 states have internal predecessors, (132), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2023-11-06 22:30:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:51,465 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:30:51,466 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:30:51,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=589, Invalid=8840, Unknown=105, NotChecked=1386, Total=10920 [2023-11-06 22:30:51,470 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 384 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 587 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:51,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 2034 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2040 Invalid, 0 Unknown, 587 Unchecked, 1.7s Time] [2023-11-06 22:30:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:30:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-06 22:30:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 82 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2023-11-06 22:30:51,474 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 54 [2023-11-06 22:30:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:51,475 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2023-11-06 22:30:51,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 79 states have (on average 1.6708860759493671) internal successors, (132), 72 states have internal predecessors, (132), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:30:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2023-11-06 22:30:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 22:30:51,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:51,476 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:51,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:51,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:51,687 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:51,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash 756204572, now seen corresponding path program 1 times [2023-11-06 22:30:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:51,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9252088] [2023-11-06 22:30:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:51,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:52,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:52,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:30:52,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:52,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9252088] [2023-11-06 22:30:52,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9252088] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:52,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345995109] [2023-11-06 22:30:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:52,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:52,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:52,803 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:52,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 22:30:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:53,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-06 22:30:53,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:53,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:30:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:30:53,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:53,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-11-06 22:30:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:30:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345995109] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:53,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:53,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 39 [2023-11-06 22:30:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032216605] [2023-11-06 22:30:53,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:53,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-06 22:30:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-06 22:30:53,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2023-11-06 22:30:53,919 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 39 states, 39 states have (on average 3.5128205128205128) internal successors, (137), 37 states have internal predecessors, (137), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 22:30:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:54,942 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2023-11-06 22:30:54,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:30:54,943 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.5128205128205128) internal successors, (137), 37 states have internal predecessors, (137), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 61 [2023-11-06 22:30:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:54,944 INFO L225 Difference]: With dead ends: 95 [2023-11-06 22:30:54,944 INFO L226 Difference]: Without dead ends: 95 [2023-11-06 22:30:54,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=337, Invalid=2525, Unknown=0, NotChecked=0, Total=2862 [2023-11-06 22:30:54,947 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 490 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:54,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1116 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:30:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-06 22:30:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2023-11-06 22:30:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 86 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2023-11-06 22:30:54,956 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 61 [2023-11-06 22:30:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:54,956 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2023-11-06 22:30:54,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.5128205128205128) internal successors, (137), 37 states have internal predecessors, (137), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 22:30:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2023-11-06 22:30:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:30:54,960 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:54,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:54,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:55,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:55,163 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:55,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash 876365713, now seen corresponding path program 1 times [2023-11-06 22:30:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:55,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521970542] [2023-11-06 22:30:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:55,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:55,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:55,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:30:55,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:55,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521970542] [2023-11-06 22:30:55,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521970542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:55,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:55,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:30:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688403115] [2023-11-06 22:30:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:55,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:30:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:55,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:30:55,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:55,387 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:55,614 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2023-11-06 22:30:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:30:55,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-11-06 22:30:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:55,615 INFO L225 Difference]: With dead ends: 108 [2023-11-06 22:30:55,615 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:30:55,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:30:55,616 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 99 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:55,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 314 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:30:55,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:30:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2023-11-06 22:30:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 89 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2023-11-06 22:30:55,620 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 63 [2023-11-06 22:30:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:55,621 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2023-11-06 22:30:55,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2023-11-06 22:30:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:30:55,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:55,622 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:55,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:30:55,623 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:55,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:55,623 INFO L85 PathProgramCache]: Analyzing trace with hash 876365714, now seen corresponding path program 1 times [2023-11-06 22:30:55,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:55,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077776993] [2023-11-06 22:30:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:55,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:55,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:30:56,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:56,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077776993] [2023-11-06 22:30:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077776993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:56,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:56,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:30:56,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291792218] [2023-11-06 22:30:56,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:56,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:30:56,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:56,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:30:56,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:56,033 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:56,258 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2023-11-06 22:30:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:30:56,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-11-06 22:30:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:56,260 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:30:56,260 INFO L226 Difference]: Without dead ends: 91 [2023-11-06 22:30:56,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:30:56,261 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 101 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:56,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 287 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:30:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-06 22:30:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-06 22:30:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 87 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2023-11-06 22:30:56,266 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 63 [2023-11-06 22:30:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:56,266 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2023-11-06 22:30:56,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2023-11-06 22:30:56,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:30:56,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:56,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:56,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 22:30:56,268 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:56,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:56,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1946647213, now seen corresponding path program 2 times [2023-11-06 22:30:56,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:56,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113220128] [2023-11-06 22:30:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:56,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:56,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:56,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:30:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113220128] [2023-11-06 22:30:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113220128] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52132546] [2023-11-06 22:30:56,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:30:56,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:56,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:56,462 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:56,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 22:30:56,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:30:56,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:30:56,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:30:56,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:30:56,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:30:56,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52132546] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:56,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:56,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2023-11-06 22:30:56,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850125346] [2023-11-06 22:30:56,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:56,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:30:56,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:56,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:30:56,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:30:56,905 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:30:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:57,014 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2023-11-06 22:30:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:30:57,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2023-11-06 22:30:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:57,020 INFO L225 Difference]: With dead ends: 80 [2023-11-06 22:30:57,020 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:30:57,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:30:57,021 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 107 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:57,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 239 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:30:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-06 22:30:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-11-06 22:30:57,025 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 64 [2023-11-06 22:30:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:57,025 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-11-06 22:30:57,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:30:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-11-06 22:30:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:30:57,026 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:57,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:57,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:57,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:57,233 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:57,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1397567211, now seen corresponding path program 1 times [2023-11-06 22:30:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061733887] [2023-11-06 22:30:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:57,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:57,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:30:57,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:57,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061733887] [2023-11-06 22:30:57,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061733887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:57,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:57,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:30:57,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116343237] [2023-11-06 22:30:57,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:57,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:30:57,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:57,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:30:57,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:57,476 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:57,643 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2023-11-06 22:30:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:30:57,644 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2023-11-06 22:30:57,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:57,645 INFO L225 Difference]: With dead ends: 80 [2023-11-06 22:30:57,645 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:30:57,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:30:57,646 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 91 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:57,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 327 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:30:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-06 22:30:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.173913043478261) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2023-11-06 22:30:57,649 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 64 [2023-11-06 22:30:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:57,649 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2023-11-06 22:30:57,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:30:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2023-11-06 22:30:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:30:57,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:57,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:57,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 22:30:57,651 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:57,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:57,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1295155679, now seen corresponding path program 1 times [2023-11-06 22:30:57,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:57,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292977894] [2023-11-06 22:30:57,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:57,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:57,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:30:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:57,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:30:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:30:57,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:57,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292977894] [2023-11-06 22:30:57,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292977894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:57,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631435071] [2023-11-06 22:30:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:57,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:57,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:57,939 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:57,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 22:30:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:58,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 22:30:58,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:58,585 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 22:30:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:30:58,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:58,716 INFO L322 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-06 22:30:58,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-06 22:30:58,798 INFO L322 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-06 22:30:58,798 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 11 treesize of output 11 [2023-11-06 22:30:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:30:58,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631435071] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:58,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:58,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2023-11-06 22:30:58,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559795950] [2023-11-06 22:30:58,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:58,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 22:30:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:58,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 22:30:58,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:30:58,866 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:30:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:59,469 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2023-11-06 22:30:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:30:59,470 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2023-11-06 22:30:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:59,470 INFO L225 Difference]: With dead ends: 88 [2023-11-06 22:30:59,470 INFO L226 Difference]: Without dead ends: 88 [2023-11-06 22:30:59,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=1369, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 22:30:59,472 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 183 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:59,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 565 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:30:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-06 22:30:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2023-11-06 22:30:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:30:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-11-06 22:30:59,488 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 66 [2023-11-06 22:30:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:59,489 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-11-06 22:30:59,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:30:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-11-06 22:30:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:30:59,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:59,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:30:59,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:59,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:59,690 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:30:59,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1295155678, now seen corresponding path program 1 times [2023-11-06 22:30:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:59,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751698365] [2023-11-06 22:30:59,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:31:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:01,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:31:01,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:01,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751698365] [2023-11-06 22:31:01,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751698365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:01,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725272010] [2023-11-06 22:31:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:01,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:01,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:01,210 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:01,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 22:31:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:01,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-06 22:31:01,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:01,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:31:01,679 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:31:01,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:31:01,773 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 22:31:01,781 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 22:31:01,900 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:31:01,900 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 41 treesize of output 38 [2023-11-06 22:31:01,905 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:31:02,135 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:02,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 22:31:02,283 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:31:02,283 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-06 22:31:02,443 INFO L322 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-06 22:31:02,462 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 32 treesize of output 22 [2023-11-06 22:31:03,015 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 22:31:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:31:03,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:03,485 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:03,485 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2023-11-06 22:31:03,688 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:03,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2023-11-06 22:31:04,565 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~s~0#1.offset_19| Int) (v_ArrVal_2958 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_19|) v_ArrVal_2958) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_19|) 1)) (< |v_ULTIMATE.start_main_~s~0#1.offset_19| 0) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_19|))) is different from false [2023-11-06 22:31:04,581 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_19| Int) (v_ArrVal_2958 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2957) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2956) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_19|) v_ArrVal_2958) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_19|) 1)) (< |v_ULTIMATE.start_main_~s~0#1.offset_19| 0) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_19|))) is different from false [2023-11-06 22:31:04,609 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_19| Int) (v_ArrVal_2958 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_19|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2957) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2956) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_19|) v_ArrVal_2958) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_19|) 1)) (< |v_ULTIMATE.start_main_~s~0#1.offset_19| 0))) is different from false [2023-11-06 22:31:04,620 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:04,620 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 38 treesize of output 39 [2023-11-06 22:31:04,627 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:04,627 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 30 treesize of output 31 [2023-11-06 22:31:04,637 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:04,638 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 54 treesize of output 54 [2023-11-06 22:31:04,652 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:04,653 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 196 treesize of output 188 [2023-11-06 22:31:04,663 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 52 treesize of output 48 [2023-11-06 22:31:04,672 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 26 treesize of output 22 [2023-11-06 22:31:04,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-06 22:31:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725272010] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:05,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:31:05,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 49 [2023-11-06 22:31:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378768303] [2023-11-06 22:31:05,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:05,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 22:31:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:05,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 22:31:05,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=4176, Unknown=27, NotChecked=396, Total=4830 [2023-11-06 22:31:05,049 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 50 states, 49 states have (on average 2.122448979591837) internal successors, (104), 45 states have internal predecessors, (104), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:31:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:07,072 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2023-11-06 22:31:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-06 22:31:07,073 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.122448979591837) internal successors, (104), 45 states have internal predecessors, (104), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 66 [2023-11-06 22:31:07,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:07,073 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:31:07,074 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:31:07,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=515, Invalid=6780, Unknown=27, NotChecked=510, Total=7832 [2023-11-06 22:31:07,077 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 404 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:07,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 956 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:31:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:31:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2023-11-06 22:31:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 78 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:31:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-11-06 22:31:07,081 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 66 [2023-11-06 22:31:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:07,081 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-11-06 22:31:07,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.122448979591837) internal successors, (104), 45 states have internal predecessors, (104), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:31:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-11-06 22:31:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:31:07,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:07,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:07,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:07,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:07,283 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:31:07,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1495121768, now seen corresponding path program 1 times [2023-11-06 22:31:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:07,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115205584] [2023-11-06 22:31:07,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:07,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:07,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:31:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:07,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:31:07,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:07,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115205584] [2023-11-06 22:31:07,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115205584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:07,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:07,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:31:07,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436743212] [2023-11-06 22:31:07,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:07,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:31:07,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:07,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:31:07,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:31:07,533 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:31:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:07,738 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2023-11-06 22:31:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:31:07,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2023-11-06 22:31:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:07,739 INFO L225 Difference]: With dead ends: 81 [2023-11-06 22:31:07,739 INFO L226 Difference]: Without dead ends: 81 [2023-11-06 22:31:07,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:31:07,740 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 80 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:07,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 284 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:31:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-06 22:31:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-06 22:31:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.125) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:31:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2023-11-06 22:31:07,743 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 67 [2023-11-06 22:31:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:07,743 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2023-11-06 22:31:07,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:31:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2023-11-06 22:31:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 22:31:07,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:07,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:07,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 22:31:07,744 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:31:07,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:07,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2003447581, now seen corresponding path program 1 times [2023-11-06 22:31:07,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:07,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286923022] [2023-11-06 22:31:07,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:07,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:08,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:31:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:08,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:31:09,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:09,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286923022] [2023-11-06 22:31:09,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286923022] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:09,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860101548] [2023-11-06 22:31:09,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:09,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:09,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:09,021 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:09,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 22:31:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:09,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-06 22:31:09,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:09,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:31:09,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:31:09,537 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:31:09,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:31:09,637 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 22:31:09,769 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:31:09,770 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:31:09,983 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:31:09,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:31:10,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:31:10,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-11-06 22:31:10,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:31:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:31:10,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:10,806 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3176 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3176) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:31:10,812 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3176 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3176) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:31:11,226 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3175 (Array Int Int)) (v_ArrVal_3176 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3175))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3176)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:31:11,233 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:11,234 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 36 treesize of output 29 [2023-11-06 22:31:11,237 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 200 [2023-11-06 22:31:11,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 159 [2023-11-06 22:31:11,254 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 159 treesize of output 151 [2023-11-06 22:31:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860101548] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:11,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:31:11,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 37 [2023-11-06 22:31:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753952745] [2023-11-06 22:31:11,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:11,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-06 22:31:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:11,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-06 22:31:11,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2020, Unknown=81, NotChecked=282, Total=2550 [2023-11-06 22:31:11,519 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 33 states have internal predecessors, (99), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:31:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:12,654 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2023-11-06 22:31:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:31:12,655 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 33 states have internal predecessors, (99), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 69 [2023-11-06 22:31:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:12,656 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:31:12,656 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 22:31:12,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=290, Invalid=3180, Unknown=82, NotChecked=354, Total=3906 [2023-11-06 22:31:12,657 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 106 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:12,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 696 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:31:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 22:31:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2023-11-06 22:31:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 78 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:31:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2023-11-06 22:31:12,661 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 69 [2023-11-06 22:31:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:12,661 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2023-11-06 22:31:12,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 33 states have internal predecessors, (99), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:31:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2023-11-06 22:31:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-06 22:31:12,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:12,663 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:12,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:12,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-06 22:31:12,869 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:31:12,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1933404287, now seen corresponding path program 1 times [2023-11-06 22:31:12,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:12,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406585189] [2023-11-06 22:31:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:31:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:31:13,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:13,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406585189] [2023-11-06 22:31:13,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406585189] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:13,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742718228] [2023-11-06 22:31:13,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:13,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:13,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:13,875 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:13,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-06 22:31:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:14,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-06 22:31:14,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:14,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:31:14,316 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:31:14,317 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:31:14,385 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:31:14,475 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:31:14,475 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 22:31:14,649 INFO L322 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2023-11-06 22:31:14,650 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 40 treesize of output 30 [2023-11-06 22:31:14,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:31:14,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-06 22:31:14,834 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:14,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 16 treesize of output 16 [2023-11-06 22:31:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:31:14,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:16,247 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3319 Int) (v_ArrVal_3317 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_57| Int) (v_ArrVal_3316 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_60| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_60| 4))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3316))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3317)))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_57| 4) v_ArrVal_3319) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_57| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< .cse2 0)))) is different from false [2023-11-06 22:31:16,276 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3319 Int) (v_ArrVal_3317 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_57| Int) (v_ArrVal_3316 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_60| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_60| 4))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_57| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3316))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3317)))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_57| 4) v_ArrVal_3319) 0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (< .cse2 0)))) is different from false [2023-11-06 22:31:16,291 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:16,291 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 75 treesize of output 52 [2023-11-06 22:31:16,317 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:16,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 605 treesize of output 571 [2023-11-06 22:31:16,341 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:31:16,353 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:16,354 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 241 [2023-11-06 22:31:16,744 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:31:16,754 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:16,754 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 134 treesize of output 112 [2023-11-06 22:31:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 1 not checked. [2023-11-06 22:31:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742718228] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:31:17,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:31:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 60 [2023-11-06 22:31:17,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607024134] [2023-11-06 22:31:17,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:17,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-11-06 22:31:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:17,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-06 22:31:17,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3094, Unknown=2, NotChecked=226, Total=3540 [2023-11-06 22:31:17,548 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 60 states, 60 states have (on average 2.3) internal successors, (138), 52 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 22:31:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:19,365 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2023-11-06 22:31:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:31:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.3) internal successors, (138), 52 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 70 [2023-11-06 22:31:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:19,366 INFO L225 Difference]: With dead ends: 80 [2023-11-06 22:31:19,366 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:31:19,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=360, Invalid=4616, Unknown=2, NotChecked=278, Total=5256 [2023-11-06 22:31:19,367 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 156 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:19,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1181 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1361 Invalid, 0 Unknown, 135 Unchecked, 1.2s Time] [2023-11-06 22:31:19,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:31:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-11-06 22:31:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:31:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2023-11-06 22:31:19,371 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 70 [2023-11-06 22:31:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:19,371 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2023-11-06 22:31:19,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.3) internal successors, (138), 52 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 22:31:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2023-11-06 22:31:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:31:19,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:19,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:19,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:19,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-06 22:31:19,583 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:31:19,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:19,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1841498918, now seen corresponding path program 1 times [2023-11-06 22:31:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:19,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782530521] [2023-11-06 22:31:19,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:19,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:21,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:31:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:31:21,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:21,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782530521] [2023-11-06 22:31:21,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782530521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:21,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072635957] [2023-11-06 22:31:21,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:21,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:21,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:21,571 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:21,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-06 22:31:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:21,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-06 22:31:21,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:21,918 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:31:22,077 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:31:22,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:31:22,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:31:22,198 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 22:31:22,331 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:31:22,332 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 47 treesize of output 33 [2023-11-06 22:31:22,339 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 22:31:22,832 INFO L322 Elim1Store]: treesize reduction 62, result has 25.3 percent of original size [2023-11-06 22:31:22,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 72 [2023-11-06 22:31:22,860 INFO L322 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2023-11-06 22:31:22,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2023-11-06 22:31:23,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:31:23,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2023-11-06 22:31:23,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:31:23,092 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:31:23,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2023-11-06 22:31:23,718 INFO L322 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2023-11-06 22:31:23,719 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 47 [2023-11-06 22:31:23,729 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:31:23,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2023-11-06 22:31:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:31:24,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:24,958 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_3467 (Array Int Int)) (v_ArrVal_3466 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3467))) (or (< (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= v_ArrVal_3467 (store .cse2 .cse3 (select v_ArrVal_3467 .cse3)))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse4 .cse3 v_ArrVal_3466)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 0)))))) (forall ((v_ArrVal_3467 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3467))) (or (< (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= v_ArrVal_3467 (store .cse2 .cse3 (select v_ArrVal_3467 .cse3)))) (forall ((v_ArrVal_3466 Int)) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse4 .cse3 v_ArrVal_3466)) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select .cse5 (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|)) 0)) (= (select .cse6 0) |c_ULTIMATE.start_main_~s~0#1.base|))))))) (or (and (forall ((v_ArrVal_3466 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse4 .cse3 v_ArrVal_3466)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select .cse7 (select .cse8 |c_ULTIMATE.start_main_~s~0#1.offset|)) 0)) (= (select .cse8 0) |c_ULTIMATE.start_main_~s~0#1.base|))))) (or .cse0 (forall ((v_ArrVal_3466 Int)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse4 .cse3 v_ArrVal_3466)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) 0))))) (forall ((v_ArrVal_3467 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3467) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= v_ArrVal_3467 (store .cse2 .cse3 (select v_ArrVal_3467 .cse3))))))))) is different from false [2023-11-06 22:32:04,318 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse4 (select (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse9 (select .cse8 .cse4)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse6 (select .cse3 .cse4)) (.cse14 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| Int) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3466 Int) (v_DerPreprocessor_5 Int) (v_ArrVal_3464 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| 4))) (let ((.cse0 (store .cse8 .cse4 (store .cse9 .cse7 v_ArrVal_3464))) (.cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| 4))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5 v_ArrVal_3466))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| .cse2) (< (select (store (select (store .cse3 .cse4 v_ArrVal_3463) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5 v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (not (= (store .cse6 .cse7 (select v_ArrVal_3463 .cse7)) v_ArrVal_3463)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select .cse1 0))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| Int) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3467 (Array Int Int)) (v_ArrVal_3466 Int) (v_ArrVal_3464 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| 4)) (.cse11 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| 4))) (let ((.cse10 (store .cse3 .cse4 v_ArrVal_3463)) (.cse12 (store (select (store .cse8 .cse4 (store .cse9 .cse13 v_ArrVal_3464)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse11 v_ArrVal_3466))) (or (not (= (store (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse11 (select v_ArrVal_3467 .cse11)) v_ArrVal_3467)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3467) (select .cse12 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| .cse2) (< (select v_ArrVal_3467 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (not (= (store .cse6 .cse13 (select v_ArrVal_3463 .cse13)) v_ArrVal_3463)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select .cse12 0)))))) (or .cse14 (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| Int) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3466 Int) (v_DerPreprocessor_5 Int) (v_ArrVal_3464 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| Int)) (let ((.cse17 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| 4)) (.cse18 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| 4))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse15 (store .cse8 .cse4 (store .cse9 .cse18 v_ArrVal_3464)))) (let ((.cse16 (store (select .cse15 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse17 v_ArrVal_3466))) (select (store .cse15 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse16) (select .cse16 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| .cse2) (< (select (store (select (store .cse3 .cse4 v_ArrVal_3463) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse17 v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (not (= (store .cse6 .cse18 (select v_ArrVal_3463 .cse18)) v_ArrVal_3463)))))) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| Int) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3467 (Array Int Int)) (v_ArrVal_3466 Int) (v_ArrVal_3464 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| Int)) (let ((.cse19 (store .cse3 .cse4 v_ArrVal_3463)) (.cse20 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| 4)) (.cse21 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| 4))) (or (not (= (store (select .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse20 (select v_ArrVal_3467 .cse20)) v_ArrVal_3467)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3467) (select (store (select (store .cse8 .cse4 (store .cse9 .cse21 v_ArrVal_3464)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse20 v_ArrVal_3466) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| .cse2) (< (select v_ArrVal_3467 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (not (= (store .cse6 .cse21 (select v_ArrVal_3463 .cse21)) v_ArrVal_3463))))) .cse14))))) is different from false [2023-11-06 22:32:04,841 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (let ((.cse9 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse6 (select (select .cse8 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse7 (select .cse8 .cse2)) (.cse3 (select .cse1 .cse2))) (and (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| Int) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3467 (Array Int Int)) (v_ArrVal_3466 Int) (v_ArrVal_3464 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| Int)) (let ((.cse0 (store .cse8 .cse2 v_ArrVal_3463)) (.cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| 4)) (.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| 4))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3467) (select (store (select (store .cse1 .cse2 (store .cse3 .cse4 v_ArrVal_3464)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse5 v_ArrVal_3466) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| .cse6) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_3467 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse5 (select v_ArrVal_3467 .cse5)))) (not (= (store .cse7 .cse4 (select v_ArrVal_3463 .cse4)) v_ArrVal_3463)) (< (select v_ArrVal_3467 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0)))) .cse9) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| Int) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3467 (Array Int Int)) (v_ArrVal_3466 Int) (v_ArrVal_3464 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| 4)) (.cse12 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| 4))) (let ((.cse11 (store (select (store .cse1 .cse2 (store .cse3 .cse13 v_ArrVal_3464)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse12 v_ArrVal_3466)) (.cse10 (store .cse8 .cse2 v_ArrVal_3463))) (or (= (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3467) (select .cse11 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| .cse6) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select .cse11 0)) (not (= v_ArrVal_3467 (store (select .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse12 (select v_ArrVal_3467 .cse12)))) (not (= (store .cse7 .cse13 (select v_ArrVal_3463 .cse13)) v_ArrVal_3463)) (< (select v_ArrVal_3467 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0))))) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| Int) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3466 Int) (v_DerPreprocessor_5 Int) (v_ArrVal_3464 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| 4)) (.cse17 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| 4))) (or (< (select (store (select (store .cse8 .cse2 v_ArrVal_3463) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse14 v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| .cse6) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (let ((.cse15 (store .cse1 .cse2 (store .cse3 .cse17 v_ArrVal_3464)))) (let ((.cse16 (store (select .cse15 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse14 v_ArrVal_3466))) (select (store .cse15 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse16) (select .cse16 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= (store .cse7 .cse17 (select v_ArrVal_3463 .cse17)) v_ArrVal_3463))))) .cse9) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| Int) (v_ArrVal_3463 (Array Int Int)) (v_ArrVal_3466 Int) (v_DerPreprocessor_5 Int) (v_ArrVal_3464 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| Int)) (let ((.cse21 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| 4))) (let ((.cse19 (store .cse1 .cse2 (store .cse3 .cse21 v_ArrVal_3464))) (.cse18 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| 4))) (let ((.cse20 (store (select .cse19 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse18 v_ArrVal_3466))) (or (< (select (store (select (store .cse8 .cse2 v_ArrVal_3463) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse18 v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_65| .cse6) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store .cse19 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse20) (select .cse20 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_63| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select .cse20 0)) (not (= (store .cse7 .cse21 (select v_ArrVal_3463 .cse21)) v_ArrVal_3463))))))))))) is different from false [2023-11-06 22:32:05,113 INFO L322 Elim1Store]: treesize reduction 409, result has 42.1 percent of original size [2023-11-06 22:32:05,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 4804 treesize of output 4796 [2023-11-06 22:32:05,442 INFO L322 Elim1Store]: treesize reduction 75, result has 53.4 percent of original size [2023-11-06 22:32:05,442 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 2360 treesize of output 1070 [2023-11-06 22:32:05,663 INFO L322 Elim1Store]: treesize reduction 40, result has 38.5 percent of original size [2023-11-06 22:32:05,663 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 case distinctions, treesize of input 973 treesize of output 910 [2023-11-06 22:32:05,731 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:05,731 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 867 treesize of output 841 [2023-11-06 22:32:06,005 INFO L322 Elim1Store]: treesize reduction 54, result has 68.8 percent of original size [2023-11-06 22:32:06,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2070 treesize of output 1960 [2023-11-06 22:32:06,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 22:32:06,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 22:32:08,177 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 25 treesize of output 21 [2023-11-06 22:32:08,240 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 25 treesize of output 21 [2023-11-06 22:32:08,291 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:08,300 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:08,300 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 56 treesize of output 45 [2023-11-06 22:32:08,489 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 57 treesize of output 51 [2023-11-06 22:32:08,602 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 57 treesize of output 51 [2023-11-06 22:32:08,698 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:08,708 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:08,708 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 88 treesize of output 75 [2023-11-06 22:32:08,863 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 67 treesize of output 61 [2023-11-06 22:32:09,278 INFO L322 Elim1Store]: treesize reduction 39, result has 45.1 percent of original size [2023-11-06 22:32:09,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 419 [2023-11-06 22:32:09,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:32:09,434 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2023-11-06 22:32:09,589 INFO L322 Elim1Store]: treesize reduction 11, result has 47.6 percent of original size [2023-11-06 22:32:09,590 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 186 treesize of output 180 [2023-11-06 22:32:09,934 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:32:09,935 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 72 treesize of output 68 [2023-11-06 22:32:10,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:32:10,152 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 113 [2023-11-06 22:32:10,279 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:32:10,279 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 1 case distinctions, treesize of input 72 treesize of output 64 [2023-11-06 22:32:11,550 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:32:11,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-06 22:32:11,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:32:11,923 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:32:11,969 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:32:12,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:32:12,051 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:32:12,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:32:12,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:12,498 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:12,571 INFO L322 Elim1Store]: treesize reduction 79, result has 38.3 percent of original size [2023-11-06 22:32:12,572 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 127 treesize of output 139 [2023-11-06 22:32:12,599 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:32:12,676 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-06 22:32:12,676 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 3 case distinctions, treesize of input 47 treesize of output 17 [2023-11-06 22:32:12,806 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:12,815 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:12,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 10 [2023-11-06 22:32:12,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:32:12,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:12,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 [2023-11-06 22:32:12,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:12,917 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:12,917 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 10 [2023-11-06 22:32:12,949 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:12,956 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:13,091 INFO L322 Elim1Store]: treesize reduction 168, result has 27.0 percent of original size [2023-11-06 22:32:13,091 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 436 treesize of output 407 [2023-11-06 22:32:13,503 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:13,542 INFO L322 Elim1Store]: treesize reduction 58, result has 9.4 percent of original size [2023-11-06 22:32:13,543 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 5 case distinctions, treesize of input 215 treesize of output 187 [2023-11-06 22:32:13,693 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:13,696 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:13,718 INFO L322 Elim1Store]: treesize reduction 25, result has 19.4 percent of original size [2023-11-06 22:32:13,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 26 [2023-11-06 22:32:13,815 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-06 22:32:13,815 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 3 case distinctions, treesize of input 47 treesize of output 17 [2023-11-06 22:32:14,026 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:14,048 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:14,049 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 194 treesize of output 202 [2023-11-06 22:32:16,233 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:16,233 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 406 treesize of output 386 [2023-11-06 22:32:16,512 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:32:16,519 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:32:16,525 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:32:16,561 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 19 treesize of output 15 [2023-11-06 22:32:17,559 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:17,597 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:17,598 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 1929 treesize of output 1919 [2023-11-06 22:32:19,428 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:19,470 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:19,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:19,511 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:19,512 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 1585 treesize of output 1437 [2023-11-06 22:32:27,326 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:27,381 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:27,381 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 3 case distinctions, treesize of input 1395 treesize of output 1225 [2023-11-06 22:32:28,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:28,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:28,616 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-06 22:32:28,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 1 [2023-11-06 22:32:28,666 INFO L322 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-11-06 22:32:28,666 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 2 case distinctions, treesize of input 158 treesize of output 126 [2023-11-06 22:32:29,190 INFO L322 Elim1Store]: treesize reduction 511, result has 15.8 percent of original size [2023-11-06 22:32:29,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 5850 treesize of output 2396 [2023-11-06 22:32:29,849 INFO L322 Elim1Store]: treesize reduction 389, result has 17.4 percent of original size [2023-11-06 22:32:29,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 12715 treesize of output 12176 [2023-11-06 22:32:30,570 INFO L322 Elim1Store]: treesize reduction 151, result has 48.8 percent of original size [2023-11-06 22:32:30,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 7912 treesize of output 7421 [2023-11-06 22:32:31,165 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:31,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 136 [2023-11-06 22:32:31,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 22:32:31,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 22:32:31,552 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 22:32:31,881 INFO L322 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-06 22:32:31,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-06 22:32:32,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 13 treesize of output 1 [2023-11-06 22:32:33,662 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:33,663 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 26 treesize of output 22 [2023-11-06 22:32:33,927 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 22:32:34,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 22:32:34,202 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 22:32:34,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 22:32:34,682 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:34,683 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 15 treesize of output 11 [2023-11-06 22:32:36,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:32:36,122 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1692 treesize of output 1686 [2023-11-06 22:32:37,548 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:37,558 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:37,559 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 19 treesize of output 15 [2023-11-06 22:32:37,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2023-11-06 22:32:37,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 22:32:37,911 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:37,941 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:37,941 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 128 treesize of output 118 [2023-11-06 22:32:38,737 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 134 treesize of output 126 [2023-11-06 22:32:38,868 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:32:38,905 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 134 treesize of output 126 [2023-11-06 22:32:38,982 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 64 treesize of output 58 [2023-11-06 22:32:39,203 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:39,222 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:39,222 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 200 treesize of output 196 [2023-11-06 22:32:39,494 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:39,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:39,511 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:32:39,511 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 195 treesize of output 191 [2023-11-06 22:32:39,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:39,806 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:39,806 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 120 treesize of output 122 [2023-11-06 22:32:39,996 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:39,997 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 154 treesize of output 162 [2023-11-06 22:32:40,004 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:40,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:40,036 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-06 22:32:40,036 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 159 treesize of output 159 [2023-11-06 22:32:40,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:40,579 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:40,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:32:40,604 INFO L322 Elim1Store]: treesize reduction 697, result has 0.1 percent of original size [2023-11-06 22:32:40,605 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1198 treesize of output 1 [2023-11-06 22:32:41,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072635957] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:32:41,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:32:41,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 50 [2023-11-06 22:32:41,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859621691] [2023-11-06 22:32:41,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:32:41,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 22:32:41,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:41,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 22:32:41,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4045, Unknown=153, NotChecked=396, Total=4830 [2023-11-06 22:32:41,874 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 50 states, 50 states have (on average 2.18) internal successors, (109), 45 states have internal predecessors, (109), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:32:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:32:46,917 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2023-11-06 22:32:46,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:32:46,917 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.18) internal successors, (109), 45 states have internal predecessors, (109), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2023-11-06 22:32:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:32:46,918 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:32:46,918 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 22:32:46,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 45.3s TimeCoverageRelationStatistics Valid=484, Invalid=6014, Unknown=156, NotChecked=486, Total=7140 [2023-11-06 22:32:46,919 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 193 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:32:46,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 882 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:32:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 22:32:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-06 22:32:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:32:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2023-11-06 22:32:46,922 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 72 [2023-11-06 22:32:46,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:32:46,922 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2023-11-06 22:32:46,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.18) internal successors, (109), 45 states have internal predecessors, (109), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:32:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2023-11-06 22:32:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-06 22:32:46,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:32:46,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:46,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:32:47,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-06 22:32:47,131 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:32:47,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:47,131 INFO L85 PathProgramCache]: Analyzing trace with hash 153891542, now seen corresponding path program 1 times [2023-11-06 22:32:47,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:47,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69847659] [2023-11-06 22:32:47,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:47,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:32:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:32:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:32:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69847659] [2023-11-06 22:32:48,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69847659] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:32:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106720594] [2023-11-06 22:32:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:48,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:32:48,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:32:48,292 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:32:48,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-06 22:32:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:48,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:32:48,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:48,858 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:32:48,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-06 22:32:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-06 22:32:48,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:32:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-06 22:32:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106720594] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:32:49,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:32:49,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 7, 7] total 34 [2023-11-06 22:32:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782906034] [2023-11-06 22:32:49,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:32:49,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 22:32:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 22:32:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:32:49,201 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 35 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 32 states have internal predecessors, (120), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:32:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:32:50,288 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2023-11-06 22:32:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:32:50,289 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 32 states have internal predecessors, (120), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2023-11-06 22:32:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:32:50,289 INFO L225 Difference]: With dead ends: 70 [2023-11-06 22:32:50,290 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 22:32:50,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=242, Invalid=2110, Unknown=0, NotChecked=0, Total=2352 [2023-11-06 22:32:50,290 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 65 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:32:50,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 456 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:32:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 22:32:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-06 22:32:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:32:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2023-11-06 22:32:50,293 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 74 [2023-11-06 22:32:50,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:32:50,293 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2023-11-06 22:32:50,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 32 states have internal predecessors, (120), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:32:50,293 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2023-11-06 22:32:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:32:50,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:32:50,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:50,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-06 22:32:50,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-06 22:32:50,495 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:32:50,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:50,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1860889348, now seen corresponding path program 1 times [2023-11-06 22:32:50,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:50,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999154829] [2023-11-06 22:32:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:50,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:32:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:52,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:32:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:32:52,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:52,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999154829] [2023-11-06 22:32:52,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999154829] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:32:52,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422887896] [2023-11-06 22:32:52,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:52,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:32:52,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:32:52,547 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:32:52,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-06 22:32:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:52,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-06 22:32:52,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:53,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:32:53,567 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:32:53,567 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 53 treesize of output 50 [2023-11-06 22:32:54,184 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:32:54,185 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 53 treesize of output 50 [2023-11-06 22:32:54,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:32:54,335 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 56 treesize of output 32 [2023-11-06 22:32:54,681 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:54,681 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 44 treesize of output 36 [2023-11-06 22:32:55,645 WARN L861 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_sll_circular_destroy_~head#1.base| Int) (|v_ULTIMATE.start_sll_circular_destroy_~p~0#1.base_30| Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_circular_destroy_~p~0#1.base_30| 0) |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_circular_destroy_~p~0#1.base_30| 1) |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_circular_destroy_~p~0#1.base_30|) 0))) is different from true [2023-11-06 22:32:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:32:55,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:32:56,152 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3746 Int)) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_3746)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0))) is different from false [2023-11-06 22:32:56,164 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3746 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (store (store |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4) v_ArrVal_3746) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-11-06 22:32:56,185 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3746 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_3745 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3745) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4) v_ArrVal_3746) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-11-06 22:32:56,201 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3746 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_3745 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3745) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4) v_ArrVal_3746) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-11-06 22:32:56,211 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3746 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_3745 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3745) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4) v_ArrVal_3746) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-11-06 22:32:56,228 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3746 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_3745 (Array Int Int))) (or (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3745) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4) v_ArrVal_3746) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-11-06 22:32:56,238 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3746 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_3745 (Array Int Int))) (or (= (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3745) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4) v_ArrVal_3746) 0) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2023-11-06 22:32:56,248 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3746 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_3745 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3745) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4) v_ArrVal_3746) 0) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)))) is different from false [2023-11-06 22:32:56,268 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3746 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_3744 (Array Int Int)) (v_ArrVal_3745 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (store (store |c_#valid| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3744))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3745)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4) v_ArrVal_3746) 0) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-11-06 22:32:56,288 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3746 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_3744 (Array Int Int)) (v_ArrVal_3745 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= (store (store |c_#valid| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3744))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3745)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4) v_ArrVal_3746) 0) 0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-11-06 22:32:56,300 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:56,301 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 51 treesize of output 44 [2023-11-06 22:32:56,305 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 196 treesize of output 184 [2023-11-06 22:32:56,310 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:56,313 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 108 treesize of output 104 [2023-11-06 22:32:56,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:56,330 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:56,330 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 54 treesize of output 54 [2023-11-06 22:32:56,335 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:32:56,345 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:32:56,345 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 46 treesize of output 49 [2023-11-06 22:32:58,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422887896] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:32:58,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:32:58,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2023-11-06 22:32:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702692928] [2023-11-06 22:32:58,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:32:58,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-06 22:32:58,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:58,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-06 22:32:58,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3150, Unknown=11, NotChecked=1342, Total=4692 [2023-11-06 22:32:58,027 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 51 states, 50 states have (on average 2.42) internal successors, (121), 45 states have internal predecessors, (121), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:33:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:03,520 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2023-11-06 22:33:03,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 22:33:03,521 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.42) internal successors, (121), 45 states have internal predecessors, (121), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 76 [2023-11-06 22:33:03,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:03,521 INFO L225 Difference]: With dead ends: 69 [2023-11-06 22:33:03,521 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:33:03,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=421, Invalid=5774, Unknown=11, NotChecked=1804, Total=8010 [2023-11-06 22:33:03,523 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 122 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:03,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 813 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1497 Invalid, 1 Unknown, 59 Unchecked, 1.9s Time] [2023-11-06 22:33:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:33:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:33:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:33:03,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2023-11-06 22:33:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:03,524 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:33:03,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.42) internal successors, (121), 45 states have internal predecessors, (121), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:33:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:33:03,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:33:03,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 28 remaining) [2023-11-06 22:33:03,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 28 remaining) [2023-11-06 22:33:03,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 28 remaining) [2023-11-06 22:33:03,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 28 remaining) [2023-11-06 22:33:03,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 28 remaining) [2023-11-06 22:33:03,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 28 remaining) [2023-11-06 22:33:03,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 28 remaining) [2023-11-06 22:33:03,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 28 remaining) [2023-11-06 22:33:03,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 28 remaining) [2023-11-06 22:33:03,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 28 remaining) [2023-11-06 22:33:03,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 28 remaining) [2023-11-06 22:33:03,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 28 remaining) [2023-11-06 22:33:03,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 28 remaining) [2023-11-06 22:33:03,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 28 remaining) [2023-11-06 22:33:03,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 28 remaining) [2023-11-06 22:33:03,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 28 remaining) [2023-11-06 22:33:03,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (11 of 28 remaining) [2023-11-06 22:33:03,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (10 of 28 remaining) [2023-11-06 22:33:03,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (9 of 28 remaining) [2023-11-06 22:33:03,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (8 of 28 remaining) [2023-11-06 22:33:03,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (7 of 28 remaining) [2023-11-06 22:33:03,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (6 of 28 remaining) [2023-11-06 22:33:03,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (5 of 28 remaining) [2023-11-06 22:33:03,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (4 of 28 remaining) [2023-11-06 22:33:03,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 28 remaining) [2023-11-06 22:33:03,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 28 remaining) [2023-11-06 22:33:03,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 28 remaining) [2023-11-06 22:33:03,533 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 28 remaining) [2023-11-06 22:33:03,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-06 22:33:03,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-06 22:33:03,741 INFO L445 BasicCegarLoop]: Path program histogram: [3, 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 22:33:03,743 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:33:03,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:33:03 BoogieIcfgContainer [2023-11-06 22:33:03,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:33:03,746 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:33:03,746 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:33:03,747 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:33:03,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:30:04" (3/4) ... [2023-11-06 22:33:03,748 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:33:03,752 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-06 22:33:03,760 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-06 22:33:03,760 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-06 22:33:03,761 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:33:03,761 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:33:03,832 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:33:03,832 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:33:03,832 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:33:03,833 INFO L158 Benchmark]: Toolchain (without parser) took 180172.31ms. Allocated memory was 161.5MB in the beginning and 627.0MB in the end (delta: 465.6MB). Free memory was 129.4MB in the beginning and 491.5MB in the end (delta: -362.1MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2023-11-06 22:33:03,833 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 125.8MB. Free memory was 84.5MB in the beginning and 84.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:33:03,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.71ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 111.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:33:03,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.49ms. Allocated memory is still 161.5MB. Free memory was 111.6MB in the beginning and 109.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:33:03,834 INFO L158 Benchmark]: Boogie Preprocessor took 83.35ms. Allocated memory is still 161.5MB. Free memory was 109.2MB in the beginning and 107.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:33:03,834 INFO L158 Benchmark]: RCFGBuilder took 530.75ms. Allocated memory is still 161.5MB. Free memory was 107.4MB in the beginning and 88.3MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:33:03,834 INFO L158 Benchmark]: TraceAbstraction took 178864.74ms. Allocated memory was 161.5MB in the beginning and 627.0MB in the end (delta: 465.6MB). Free memory was 87.6MB in the beginning and 496.2MB in the end (delta: -408.6MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2023-11-06 22:33:03,834 INFO L158 Benchmark]: Witness Printer took 86.27ms. Allocated memory is still 627.0MB. Free memory was 496.2MB in the beginning and 491.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:33:03,836 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 125.8MB. Free memory was 84.5MB in the beginning and 84.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.71ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 111.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.49ms. Allocated memory is still 161.5MB. Free memory was 111.6MB in the beginning and 109.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.35ms. Allocated memory is still 161.5MB. Free memory was 109.2MB in the beginning and 107.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 530.75ms. Allocated memory is still 161.5MB. Free memory was 107.4MB in the beginning and 88.3MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 178864.74ms. Allocated memory was 161.5MB in the beginning and 627.0MB in the end (delta: 465.6MB). Free memory was 87.6MB in the beginning and 496.2MB in the end (delta: -408.6MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. * Witness Printer took 86.27ms. Allocated memory is still 627.0MB. Free memory was 496.2MB in the beginning and 491.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 178.8s, OverallIterations: 36, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 32.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 4457 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4456 mSDsluCounter, 21081 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 781 IncrementalHoareTripleChecker+Unchecked, 19057 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18468 IncrementalHoareTripleChecker+Invalid, 19481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 2024 mSDtfsCounter, 18468 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2761 GetRequests, 1642 SyntacticMatches, 30 SemanticMatches, 1089 ConstructedPredicates, 41 IntricatePredicates, 0 DeprecatedPredicates, 10076 ImplicationChecksByTransitivity, 86.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=15, InterpolantAutomatonStates: 477, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 200 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 133.5s InterpolantComputationTime, 2821 NumberOfCodeBlocks, 2811 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 3248 ConstructedInterpolants, 65 QuantifiedInterpolants, 31281 SizeOfPredicates, 352 NumberOfNonLiveVariables, 8086 ConjunctsInSsa, 1112 ConjunctsInUnsatCore, 68 InterpolantComputations, 18 PerfectInterpolantSequences, 860/1277 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-06 22:33:03,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2182987-af44-4f5d-bee4-297bf58e226e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE