./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/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_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/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_c8544739-7be7-452d-8bfc-6da898381aa0/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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:58:51,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:58:51,948 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:58:51,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:58:51,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:58:51,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:58:51,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:58:51,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:58:51,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:58:51,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:58:51,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:58:51,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:58:51,987 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:58:51,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:58:51,988 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:58:51,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:58:51,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:58:51,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:58:51,990 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:58:51,991 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:58:51,992 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:58:51,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:58:51,993 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:58:51,994 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:58:51,995 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:58:51,995 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:58:51,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:58:51,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:58:51,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:58:51,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:58:51,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:58:51,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:58:52,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:58:52,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:58:52,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:58:52,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:58:52,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:58:52,002 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:58:52,003 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_c8544739-7be7-452d-8bfc-6da898381aa0/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_c8544739-7be7-452d-8bfc-6da898381aa0/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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2023-11-06 22:58:52,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:58:52,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:58:52,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:58:52,385 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:58:52,387 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:58:52,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/dll2c_update_all.i [2023-11-06 22:58:55,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:58:55,947 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:58:55,948 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/sv-benchmarks/c/list-simple/dll2c_update_all.i [2023-11-06 22:58:55,967 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/data/8e441ba4e/1058d492a19743afa8410c986a91cdd4/FLAG94ba0e898 [2023-11-06 22:58:55,986 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/data/8e441ba4e/1058d492a19743afa8410c986a91cdd4 [2023-11-06 22:58:55,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:58:55,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:58:55,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:58:55,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:58:55,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:58:56,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:58:55" (1/1) ... [2023-11-06 22:58:56,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791b23a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56, skipping insertion in model container [2023-11-06 22:58:56,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:58:55" (1/1) ... [2023-11-06 22:58:56,078 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:58:56,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:58:56,499 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:58:56,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:58:56,604 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:58:56,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56 WrapperNode [2023-11-06 22:58:56,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:58:56,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:58:56,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:58:56,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:58:56,614 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:58:56" (1/1) ... [2023-11-06 22:58:56,636 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:58:56" (1/1) ... [2023-11-06 22:58:56,670 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2023-11-06 22:58:56,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:58:56,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:58:56,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:58:56,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:58:56,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56" (1/1) ... [2023-11-06 22:58:56,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56" (1/1) ... [2023-11-06 22:58:56,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56" (1/1) ... [2023-11-06 22:58:56,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56" (1/1) ... [2023-11-06 22:58:56,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56" (1/1) ... [2023-11-06 22:58:56,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56" (1/1) ... [2023-11-06 22:58:56,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56" (1/1) ... [2023-11-06 22:58:56,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56" (1/1) ... [2023-11-06 22:58:56,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:58:56,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:58:56,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:58:56,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:58:56,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56" (1/1) ... [2023-11-06 22:58:56,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:58:56,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:58:56,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/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:58:56,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/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:58:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:58:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:58:56,860 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 22:58:56,860 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 22:58:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:58:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:58:56,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:58:56,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:58:56,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:58:56,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:58:56,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:58:56,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:58:57,033 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:58:57,036 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:58:57,418 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:58:57,426 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:58:57,426 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 22:58:57,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:58:57 BoogieIcfgContainer [2023-11-06 22:58:57,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:58:57,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:58:57,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:58:57,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:58:57,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:58:55" (1/3) ... [2023-11-06 22:58:57,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11768073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:58:57, skipping insertion in model container [2023-11-06 22:58:57,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:56" (2/3) ... [2023-11-06 22:58:57,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11768073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:58:57, skipping insertion in model container [2023-11-06 22:58:57,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:58:57" (3/3) ... [2023-11-06 22:58:57,449 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2023-11-06 22:58:57,472 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:58:57,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-06 22:58:57,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:58:57,536 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;@742dbf3a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:58:57,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2023-11-06 22:58:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 92 states have internal predecessors, (109), 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:58:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:58:57,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:58:57,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:58:57,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:58:57,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash 895210802, now seen corresponding path program 1 times [2023-11-06 22:58:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:57,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009928139] [2023-11-06 22:58:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:58:57,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:57,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009928139] [2023-11-06 22:58:57,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009928139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:58:57,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:58:57,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:58:57,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954517575] [2023-11-06 22:58:57,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:58:57,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:58:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:58:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:58:57,980 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 92 states have internal predecessors, (109), 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:58:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:58:58,164 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2023-11-06 22:58:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:58:58,167 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:58:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:58:58,176 INFO L225 Difference]: With dead ends: 92 [2023-11-06 22:58:58,176 INFO L226 Difference]: Without dead ends: 89 [2023-11-06 22:58:58,178 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:58:58,182 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:58:58,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 151 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:58:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-06 22:58:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-06 22:58:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.690909090909091) 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:58:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2023-11-06 22:58:58,244 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 6 [2023-11-06 22:58:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:58:58,245 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2023-11-06 22:58:58,245 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:58:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2023-11-06 22:58:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:58:58,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:58:58,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:58:58,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:58:58,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:58:58,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash 895210803, now seen corresponding path program 1 times [2023-11-06 22:58:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:58,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538648886] [2023-11-06 22:58:58,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:58,475 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:58:58,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:58,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538648886] [2023-11-06 22:58:58,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538648886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:58:58,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:58:58,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:58:58,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927221108] [2023-11-06 22:58:58,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:58:58,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:58:58,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:58,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:58:58,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:58:58,484 INFO L87 Difference]: Start difference. First operand 89 states and 97 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:58:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:58:58,608 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-11-06 22:58:58,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:58:58,609 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:58:58,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:58:58,612 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:58:58,613 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:58:58,617 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:58:58,620 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:58:58,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 153 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:58:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:58:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-06 22:58:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 82 states have internal predecessors, (90), 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:58:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-11-06 22:58:58,641 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 6 [2023-11-06 22:58:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:58:58,641 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-11-06 22:58:58,641 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:58:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-11-06 22:58:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:58:58,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:58:58,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:58,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:58:58,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:58:58,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1540658031, now seen corresponding path program 1 times [2023-11-06 22:58:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105680513] [2023-11-06 22:58:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:58:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:58,794 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:58:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:58,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105680513] [2023-11-06 22:58:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105680513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:58:58,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:58:58,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:58:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703794935] [2023-11-06 22:58:58,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:58:58,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:58:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:58,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:58:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:58:58,799 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:58:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:58:58,934 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2023-11-06 22:58:58,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:58:58,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-06 22:58:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:58:58,941 INFO L225 Difference]: With dead ends: 97 [2023-11-06 22:58:58,942 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:58:58,943 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:58:58,945 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 10 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:58:58,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 226 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:58:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:58:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2023-11-06 22:58:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.625) internal successors, (91), 83 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:58:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2023-11-06 22:58:58,958 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 14 [2023-11-06 22:58:58,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:58:58,959 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2023-11-06 22:58:58,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:58:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2023-11-06 22:58:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:58:58,960 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:58:58,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:58,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:58:58,961 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:58:58,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash -673728128, now seen corresponding path program 1 times [2023-11-06 22:58:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:58,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822161071] [2023-11-06 22:58:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:59,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:58:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:58:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:59,237 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:58:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:59,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822161071] [2023-11-06 22:58:59,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822161071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:58:59,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:58:59,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:58:59,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870664132] [2023-11-06 22:58:59,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:58:59,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:58:59,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:59,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:58:59,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:58:59,242 INFO L87 Difference]: Start difference. First operand 87 states and 95 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:58:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:58:59,444 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-11-06 22:58:59,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:58:59,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-06 22:58:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:58:59,447 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:58:59,447 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:58:59,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:58:59,459 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:58:59,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 343 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:58:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:58:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-06 22:58:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 82 states have internal predecessors, (90), 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:58:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-11-06 22:58:59,468 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 24 [2023-11-06 22:58:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:58:59,468 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-11-06 22:58:59,469 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:58:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-11-06 22:58:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:58:59,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:58:59,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:59,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:58:59,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:58:59,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:59,471 INFO L85 PathProgramCache]: Analyzing trace with hash -673728127, now seen corresponding path program 1 times [2023-11-06 22:58:59,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:59,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946757874] [2023-11-06 22:58:59,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:59,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:58:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:58:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:00,003 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:59:00,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:00,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946757874] [2023-11-06 22:59:00,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946757874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:00,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:59:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997167455] [2023-11-06 22:59:00,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:00,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:59:00,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:00,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:59:00,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:59:00,009 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:59:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:00,198 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-11-06 22:59:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:59:00,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-06 22:59:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:00,200 INFO L225 Difference]: With dead ends: 85 [2023-11-06 22:59:00,200 INFO L226 Difference]: Without dead ends: 85 [2023-11-06 22:59:00,201 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:59:00,201 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 8 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:00,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 365 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-06 22:59:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-06 22:59:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 81 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:59:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2023-11-06 22:59:00,219 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 24 [2023-11-06 22:59:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:00,220 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2023-11-06 22:59:00,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:59:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2023-11-06 22:59:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:59:00,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:00,222 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:00,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:59:00,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:00,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:00,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1087330401, now seen corresponding path program 1 times [2023-11-06 22:59:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:00,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045160606] [2023-11-06 22:59:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:00,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:00,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:00,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:00,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045160606] [2023-11-06 22:59:00,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045160606] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:00,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897341103] [2023-11-06 22:59:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:00,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:00,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:00,614 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:00,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:59:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:00,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:59:00,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:00,829 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:59:00,923 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 22:59:00,997 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:59:00,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-06 22:59:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-06 22:59:01,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897341103] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:01,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:59:01,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-11-06 22:59:01,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136542721] [2023-11-06 22:59:01,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:01,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:59:01,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:01,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:59:01,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-11-06 22:59:01,085 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:59:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:01,391 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-11-06 22:59:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:59:01,392 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-11-06 22:59:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:01,393 INFO L225 Difference]: With dead ends: 92 [2023-11-06 22:59:01,393 INFO L226 Difference]: Without dead ends: 92 [2023-11-06 22:59:01,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-06 22:59:01,395 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:01,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 424 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 95 Unchecked, 0.2s Time] [2023-11-06 22:59:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-06 22:59:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2023-11-06 22:59:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 85 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:59:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2023-11-06 22:59:01,404 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 26 [2023-11-06 22:59:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:01,404 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2023-11-06 22:59:01,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:59:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2023-11-06 22:59:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:59:01,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:01,406 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:01,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:01,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:59:01,613 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:01,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1087330402, now seen corresponding path program 1 times [2023-11-06 22:59:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:01,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172050944] [2023-11-06 22:59:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:01,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:02,310 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:59:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172050944] [2023-11-06 22:59:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172050944] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231033113] [2023-11-06 22:59:02,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:02,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:02,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:02,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:02,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:59:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:02,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:59:02,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:02,487 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:59:02,612 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 22:59:02,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:02,692 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:59:02,702 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:59:02,702 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:59:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-06 22:59:02,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:02,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231033113] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:02,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:59:02,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2023-11-06 22:59:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014101160] [2023-11-06 22:59:02,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:02,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:59:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:02,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:59:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2023-11-06 22:59:02,890 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:59:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:03,285 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-11-06 22:59:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:59:03,285 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-11-06 22:59:03,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:03,287 INFO L225 Difference]: With dead ends: 92 [2023-11-06 22:59:03,287 INFO L226 Difference]: Without dead ends: 92 [2023-11-06 22:59:03,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=1, NotChecked=30, Total=306 [2023-11-06 22:59:03,289 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 8 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:03,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 541 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 359 Invalid, 0 Unknown, 95 Unchecked, 0.3s Time] [2023-11-06 22:59:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-06 22:59:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2023-11-06 22:59:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 85 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:59:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2023-11-06 22:59:03,299 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 26 [2023-11-06 22:59:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:03,299 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2023-11-06 22:59:03,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:59:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2023-11-06 22:59:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:59:03,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:03,301 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:03,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:03,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:03,508 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:03,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1247616567, now seen corresponding path program 1 times [2023-11-06 22:59:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:03,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884542894] [2023-11-06 22:59:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:03,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:03,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:03,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884542894] [2023-11-06 22:59:03,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884542894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:03,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216818678] [2023-11-06 22:59:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:03,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:03,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:03,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:03,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:59:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:03,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:59:03,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:03,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216818678] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:03,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:03,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-06 22:59:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107926751] [2023-11-06 22:59:03,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:03,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:59:03,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:03,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:59:03,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:59:03,959 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:59:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:04,090 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-11-06 22:59:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:59:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-06 22:59:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:04,091 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:59:04,092 INFO L226 Difference]: Without dead ends: 91 [2023-11-06 22:59:04,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:04,093 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:04,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 441 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-06 22:59:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-11-06 22:59:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.55) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:59:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2023-11-06 22:59:04,099 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 28 [2023-11-06 22:59:04,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:04,100 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2023-11-06 22:59:04,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:59:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2023-11-06 22:59:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:59:04,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:04,101 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:04,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:04,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:59:04,313 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:04,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash 16627250, now seen corresponding path program 1 times [2023-11-06 22:59:04,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:04,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011195647] [2023-11-06 22:59:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:04,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:04,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:59:04,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:04,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011195647] [2023-11-06 22:59:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011195647] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:04,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169644992] [2023-11-06 22:59:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:04,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:04,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:04,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:04,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:59:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:04,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:59:04,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:59:04,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:04,649 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 22:59:04,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2023-11-06 22:59:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:59:04,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169644992] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:04,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-11-06 22:59:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656329070] [2023-11-06 22:59:04,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:04,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:59:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:04,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:59:04,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:59:04,674 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:59:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:04,815 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2023-11-06 22:59:04,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:59:04,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-06 22:59:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:04,818 INFO L225 Difference]: With dead ends: 95 [2023-11-06 22:59:04,818 INFO L226 Difference]: Without dead ends: 95 [2023-11-06 22:59:04,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:04,821 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 10 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:04,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 244 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-06 22:59:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2023-11-06 22:59:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 88 states have internal predecessors, (98), 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:59:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2023-11-06 22:59:04,831 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 29 [2023-11-06 22:59:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:04,832 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2023-11-06 22:59:04,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:59:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2023-11-06 22:59:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:59:04,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:04,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:04,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:05,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:05,047 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:05,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 16627251, now seen corresponding path program 1 times [2023-11-06 22:59:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045762506] [2023-11-06 22:59:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:05,436 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:59:05,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:05,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045762506] [2023-11-06 22:59:05,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045762506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:05,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563727810] [2023-11-06 22:59:05,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:05,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:05,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:05,439 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:05,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:59:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:05,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:59:05,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:05,761 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:59:05,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:05,805 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:05,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-11-06 22:59:05,971 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:59:05,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563727810] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:05,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-06 22:59:05,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004821747] [2023-11-06 22:59:05,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:05,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:59:05,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:59:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:59:05,975 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 22:59:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:06,221 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2023-11-06 22:59:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:59:06,222 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-11-06 22:59:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:06,223 INFO L225 Difference]: With dead ends: 99 [2023-11-06 22:59:06,223 INFO L226 Difference]: Without dead ends: 99 [2023-11-06 22:59:06,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:59:06,224 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 24 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:06,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 787 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-06 22:59:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2023-11-06 22:59:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.5396825396825398) 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:59:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2023-11-06 22:59:06,235 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 29 [2023-11-06 22:59:06,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:06,236 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2023-11-06 22:59:06,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 22:59:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2023-11-06 22:59:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:59:06,238 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:06,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:06,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:06,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:59:06,439 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:06,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:06,439 INFO L85 PathProgramCache]: Analyzing trace with hash 515444755, now seen corresponding path program 1 times [2023-11-06 22:59:06,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622175648] [2023-11-06 22:59:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:06,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:59:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:06,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622175648] [2023-11-06 22:59:06,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622175648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:06,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:06,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:59:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045833210] [2023-11-06 22:59:06,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:06,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:59:06,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:59:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:06,628 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:59:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:06,833 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2023-11-06 22:59:06,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:59:06,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-06 22:59:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:06,835 INFO L225 Difference]: With dead ends: 93 [2023-11-06 22:59:06,835 INFO L226 Difference]: Without dead ends: 93 [2023-11-06 22:59:06,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:59:06,836 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 12 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:06,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 383 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-06 22:59:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2023-11-06 22:59:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:59:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2023-11-06 22:59:06,840 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 30 [2023-11-06 22:59:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:06,841 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2023-11-06 22:59:06,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:59:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2023-11-06 22:59:06,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:59:06,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:06,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:06,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:59:06,843 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:06,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash 515444756, now seen corresponding path program 1 times [2023-11-06 22:59:06,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:06,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339843097] [2023-11-06 22:59:06,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:06,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:07,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339843097] [2023-11-06 22:59:07,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339843097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:07,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:07,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:59:07,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178240867] [2023-11-06 22:59:07,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:07,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:59:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:07,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:59:07,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:07,211 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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:59:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:07,409 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2023-11-06 22:59:07,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:59:07,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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:59:07,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:07,411 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:59:07,411 INFO L226 Difference]: Without dead ends: 91 [2023-11-06 22:59:07,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:59:07,412 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 10 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:07,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 410 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-06 22:59:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-06 22:59:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.507936507936508) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:59:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2023-11-06 22:59:07,416 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 30 [2023-11-06 22:59:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:07,416 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2023-11-06 22:59:07,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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:59:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2023-11-06 22:59:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:59:07,417 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:07,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:07,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:59:07,418 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:07,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:07,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1689087417, now seen corresponding path program 1 times [2023-11-06 22:59:07,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:07,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338732756] [2023-11-06 22:59:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:59:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:07,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338732756] [2023-11-06 22:59:07,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338732756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:07,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:59:07,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209515267] [2023-11-06 22:59:07,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:07,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:59:07,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:07,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:59:07,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:59:07,664 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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:59:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:08,004 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2023-11-06 22:59:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:59:08,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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 35 [2023-11-06 22:59:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:08,006 INFO L225 Difference]: With dead ends: 117 [2023-11-06 22:59:08,006 INFO L226 Difference]: Without dead ends: 117 [2023-11-06 22:59:08,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:59:08,007 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 144 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:08,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 424 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:59:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-06 22:59:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2023-11-06 22:59:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 89 states have internal predecessors, (101), 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:59:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2023-11-06 22:59:08,012 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 35 [2023-11-06 22:59:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:08,013 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2023-11-06 22:59:08,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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:59:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2023-11-06 22:59:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:59:08,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:08,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:08,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:59:08,014 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:08,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1689087416, now seen corresponding path program 1 times [2023-11-06 22:59:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578057228] [2023-11-06 22:59:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:08,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:08,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:08,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:08,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578057228] [2023-11-06 22:59:08,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578057228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:08,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:08,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:59:08,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897489779] [2023-11-06 22:59:08,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:08,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:59:08,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:08,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:59:08,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:59:08,464 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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:59:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:08,788 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2023-11-06 22:59:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:59:08,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 35 [2023-11-06 22:59:08,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:08,790 INFO L225 Difference]: With dead ends: 96 [2023-11-06 22:59:08,790 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 22:59:08,790 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:59:08,791 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 145 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:08,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 448 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 22:59:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2023-11-06 22:59:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.5) internal successors, (99), 89 states have internal predecessors, (99), 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:59:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2023-11-06 22:59:08,795 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 35 [2023-11-06 22:59:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:08,795 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2023-11-06 22:59:08,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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:59:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2023-11-06 22:59:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:59:08,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:08,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:08,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:59:08,797 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:08,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:08,798 INFO L85 PathProgramCache]: Analyzing trace with hash 283398157, now seen corresponding path program 1 times [2023-11-06 22:59:08,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:08,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169507976] [2023-11-06 22:59:08,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:08,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:08,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:08,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:08,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:08,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169507976] [2023-11-06 22:59:08,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169507976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:08,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:08,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:59:08,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877572957] [2023-11-06 22:59:08,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:08,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:59:08,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:08,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:59:08,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:08,931 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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:59:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:09,020 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2023-11-06 22:59:09,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:59:09,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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 37 [2023-11-06 22:59:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:09,022 INFO L225 Difference]: With dead ends: 125 [2023-11-06 22:59:09,022 INFO L226 Difference]: Without dead ends: 125 [2023-11-06 22:59:09,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:09,025 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 123 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:09,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 206 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-06 22:59:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 96. [2023-11-06 22:59:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 91 states have internal predecessors, (101), 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:59:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2023-11-06 22:59:09,030 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 37 [2023-11-06 22:59:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:09,031 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2023-11-06 22:59:09,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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:59:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2023-11-06 22:59:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:59:09,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:09,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:09,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:59:09,035 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:09,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash 235269195, now seen corresponding path program 1 times [2023-11-06 22:59:09,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:09,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976172028] [2023-11-06 22:59:09,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:09,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:09,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:09,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976172028] [2023-11-06 22:59:09,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976172028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:09,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:09,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:59:09,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440557863] [2023-11-06 22:59:09,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:09,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:59:09,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:09,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:59:09,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:09,167 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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:59:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:09,253 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2023-11-06 22:59:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:59:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 38 [2023-11-06 22:59:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:09,255 INFO L225 Difference]: With dead ends: 116 [2023-11-06 22:59:09,255 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:59:09,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:59:09,256 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 23 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:09,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 291 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:59:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2023-11-06 22:59:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 92 states have internal predecessors, (102), 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:59:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2023-11-06 22:59:09,270 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 38 [2023-11-06 22:59:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:09,270 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2023-11-06 22:59:09,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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:59:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2023-11-06 22:59:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:59:09,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:09,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:09,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:59:09,283 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:09,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:09,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2061275484, now seen corresponding path program 1 times [2023-11-06 22:59:09,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:09,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446332803] [2023-11-06 22:59:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:09,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:09,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:09,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:09,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:59:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:59:09,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:09,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446332803] [2023-11-06 22:59:09,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446332803] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:09,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646609056] [2023-11-06 22:59:09,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:09,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:09,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:09,437 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:09,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:59:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:09,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:59:09,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:59:09,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:59:09,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646609056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:09,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:59:09,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-06 22:59:09,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345537111] [2023-11-06 22:59:09,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:09,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:59:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:09,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:59:09,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:59:09,721 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:59:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:09,735 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2023-11-06 22:59:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:59:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-11-06 22:59:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:09,737 INFO L225 Difference]: With dead ends: 85 [2023-11-06 22:59:09,737 INFO L226 Difference]: Without dead ends: 85 [2023-11-06 22:59:09,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:59:09,738 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 157 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:59:09,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 157 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:59:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-06 22:59:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-06 22:59:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 81 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:59:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-11-06 22:59:09,742 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 41 [2023-11-06 22:59:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:09,743 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-11-06 22:59:09,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:59:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-11-06 22:59:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:59:09,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:09,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:09,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:09,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:59:09,951 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:09,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash -176614535, now seen corresponding path program 1 times [2023-11-06 22:59:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:09,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444148346] [2023-11-06 22:59:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:10,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:10,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:59:10,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444148346] [2023-11-06 22:59:10,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444148346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:10,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:10,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:59:10,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499628975] [2023-11-06 22:59:10,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:10,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:59:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:10,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:59:10,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:59:10,219 INFO L87 Difference]: Start difference. First operand 85 states and 92 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:59:10,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:10,520 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2023-11-06 22:59:10,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:59:10,521 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 42 [2023-11-06 22:59:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:10,522 INFO L225 Difference]: With dead ends: 110 [2023-11-06 22:59:10,522 INFO L226 Difference]: Without dead ends: 110 [2023-11-06 22:59:10,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:59:10,523 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 132 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:10,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 389 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:10,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-06 22:59:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2023-11-06 22:59:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 84 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:59:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2023-11-06 22:59:10,528 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 42 [2023-11-06 22:59:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:10,529 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2023-11-06 22:59:10,529 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:59:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2023-11-06 22:59:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:59:10,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:10,530 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:10,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:59:10,530 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:10,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash -176614534, now seen corresponding path program 1 times [2023-11-06 22:59:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103162961] [2023-11-06 22:59:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:10,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:10,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:10,710 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:59:10,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:10,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103162961] [2023-11-06 22:59:10,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103162961] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:10,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800452323] [2023-11-06 22:59:10,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:10,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:10,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:10,713 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:10,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:59:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:10,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:59:10,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:11,049 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:59:11,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:11,109 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:59:11,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800452323] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:11,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-06 22:59:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938739889] [2023-11-06 22:59:11,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:11,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:59:11,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:11,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:59:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:59:11,115 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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:59:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:11,215 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2023-11-06 22:59:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:59:11,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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 42 [2023-11-06 22:59:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:11,217 INFO L225 Difference]: With dead ends: 112 [2023-11-06 22:59:11,217 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:59:11,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:59:11,218 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 169 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:11,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 324 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:59:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2023-11-06 22:59:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 100 states have internal predecessors, (119), 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:59:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2023-11-06 22:59:11,224 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 42 [2023-11-06 22:59:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:11,224 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2023-11-06 22:59:11,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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:59:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2023-11-06 22:59:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:59:11,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:11,225 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:11,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:11,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:11,438 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:11,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1140222369, now seen corresponding path program 1 times [2023-11-06 22:59:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:11,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925681646] [2023-11-06 22:59:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:11,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:12,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:12,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:12,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925681646] [2023-11-06 22:59:12,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925681646] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:12,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904282004] [2023-11-06 22:59:12,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:12,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:12,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:12,548 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:12,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:59:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:12,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-06 22:59:12,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:12,841 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:59:12,971 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:59:12,971 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:59:13,051 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:59:13,109 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:13,110 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 32 treesize of output 31 [2023-11-06 22:59:13,227 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:13,228 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:59:13,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-11-06 22:59:13,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:13,459 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:59:13,529 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:59:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:13,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:13,561 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2204 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2204) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2204 .cse0))) v_ArrVal_2204)))) is different from false [2023-11-06 22:59:13,719 INFO L322 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-11-06 22:59:13,719 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:59:13,801 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2023-11-06 22:59:15,992 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:15,993 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 21 treesize of output 22 [2023-11-06 22:59:15,998 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 60 treesize of output 52 [2023-11-06 22:59:16,005 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 24 treesize of output 22 [2023-11-06 22:59:16,017 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-11-06 22:59:16,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904282004] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:16,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:59:16,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 35 [2023-11-06 22:59:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707677385] [2023-11-06 22:59:16,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:16,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-06 22:59:16,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:16,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-06 22:59:16,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1514, Unknown=22, NotChecked=158, Total=1806 [2023-11-06 22:59:16,162 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 31 states have internal predecessors, (67), 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:59:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:17,713 INFO L93 Difference]: Finished difference Result 184 states and 222 transitions. [2023-11-06 22:59:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:59:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 31 states have internal predecessors, (67), 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 43 [2023-11-06 22:59:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:17,716 INFO L225 Difference]: With dead ends: 184 [2023-11-06 22:59:17,716 INFO L226 Difference]: Without dead ends: 184 [2023-11-06 22:59:17,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=234, Invalid=2404, Unknown=22, NotChecked=202, Total=2862 [2023-11-06 22:59:17,720 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 349 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:17,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1119 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:59:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-11-06 22:59:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 114. [2023-11-06 22:59:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 110 states have internal predecessors, (134), 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:59:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2023-11-06 22:59:17,731 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 43 [2023-11-06 22:59:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:17,731 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2023-11-06 22:59:17,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 31 states have internal predecessors, (67), 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:59:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2023-11-06 22:59:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:59:17,732 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:17,732 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:17,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:17,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:17,939 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:17,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1140222368, now seen corresponding path program 1 times [2023-11-06 22:59:17,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:17,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124342147] [2023-11-06 22:59:17,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:19,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:19,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:19,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:19,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124342147] [2023-11-06 22:59:19,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124342147] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:19,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916179177] [2023-11-06 22:59:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:19,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:19,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:19,837 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:19,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:59:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:20,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-06 22:59:20,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:20,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:59:20,647 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:59:20,647 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:59:20,676 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:59:20,676 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:59:20,825 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:59:20,843 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:59:20,962 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:20,962 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 57 treesize of output 50 [2023-11-06 22:59:20,975 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:59:21,217 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:21,218 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-06 22:59:21,226 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:59:21,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-11-06 22:59:21,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 22:59:21,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:21,606 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:59:21,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:21,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 22:59:21,742 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:59:21,747 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:59:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:21,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:22,285 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_2398 (Array Int Int))) (or (not (= v_ArrVal_2398 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2398 .cse0)))) (forall ((v_ArrVal_2399 Int)) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse1 .cse0 v_ArrVal_2399)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2398) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((v_ArrVal_2399 Int)) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse1 .cse0 v_ArrVal_2399)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2023-11-06 22:59:23,288 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:23,290 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 43 treesize of output 44 [2023-11-06 22:59:23,300 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:23,300 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-06 22:59:23,309 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 234 treesize of output 222 [2023-11-06 22:59:23,345 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 670 treesize of output 634 [2023-11-06 22:59:23,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 22:59:23,365 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 31 treesize of output 29 [2023-11-06 22:59:23,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-11-06 22:59:23,376 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 24 [2023-11-06 22:59:23,397 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:23,397 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 23 treesize of output 24 [2023-11-06 22:59:23,403 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:23,404 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:23,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-06 22:59:23,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916179177] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:23,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:59:23,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2023-11-06 22:59:23,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722267936] [2023-11-06 22:59:23,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:23,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-06 22:59:23,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:23,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-06 22:59:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2814, Unknown=3, NotChecked=106, Total=3080 [2023-11-06 22:59:23,867 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 37 states have internal predecessors, (76), 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:59:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:26,437 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2023-11-06 22:59:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:59:26,438 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 37 states have internal predecessors, (76), 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 43 [2023-11-06 22:59:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:26,439 INFO L225 Difference]: With dead ends: 196 [2023-11-06 22:59:26,440 INFO L226 Difference]: Without dead ends: 196 [2023-11-06 22:59:26,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=298, Invalid=4259, Unknown=3, NotChecked=132, Total=4692 [2023-11-06 22:59:26,443 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 364 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:26,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1712 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:59:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-06 22:59:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 122. [2023-11-06 22:59:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 states have internal predecessors, (145), 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:59:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2023-11-06 22:59:26,450 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 43 [2023-11-06 22:59:26,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:26,451 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2023-11-06 22:59:26,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 37 states have internal predecessors, (76), 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:59:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2023-11-06 22:59:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:59:26,452 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:26,452 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] [2023-11-06 22:59:26,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:26,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 22:59:26,659 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:26,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:26,660 INFO L85 PathProgramCache]: Analyzing trace with hash 533418291, now seen corresponding path program 2 times [2023-11-06 22:59:26,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:26,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703185239] [2023-11-06 22:59:26,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:26,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:26,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:26,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703185239] [2023-11-06 22:59:26,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703185239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:26,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811674528] [2023-11-06 22:59:26,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:59:26,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:26,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:26,855 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:26,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:59:27,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:59:27,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:59:27,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:59:27,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:59:27,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:59:27,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811674528] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:27,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:27,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2023-11-06 22:59:27,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370938574] [2023-11-06 22:59:27,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:27,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:59:27,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:27,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:59:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:27,393 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 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:59:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:27,550 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-11-06 22:59:27,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:59:27,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 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 46 [2023-11-06 22:59:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:27,552 INFO L225 Difference]: With dead ends: 116 [2023-11-06 22:59:27,552 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:59:27,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:59:27,553 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 134 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:27,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 328 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:59:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2023-11-06 22:59:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 104 states have internal predecessors, (124), 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:59:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2023-11-06 22:59:27,557 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 46 [2023-11-06 22:59:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:27,558 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2023-11-06 22:59:27,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 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:59:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2023-11-06 22:59:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 22:59:27,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:27,558 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] [2023-11-06 22:59:27,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:27,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:27,766 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:27,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1186042766, now seen corresponding path program 2 times [2023-11-06 22:59:27,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:27,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749542258] [2023-11-06 22:59:27,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:27,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:27,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:27,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:27,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749542258] [2023-11-06 22:59:27,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749542258] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834958767] [2023-11-06 22:59:27,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:59:27,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:27,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:27,931 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:27,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:59:28,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:59:28,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:59:28,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-06 22:59:28,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:59:28,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:59:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834958767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:28,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:59:28,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2023-11-06 22:59:28,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472587195] [2023-11-06 22:59:28,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:28,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:59:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:28,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:59:28,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:59:28,555 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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:59:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:28,882 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2023-11-06 22:59:28,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:59:28,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 47 [2023-11-06 22:59:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:28,884 INFO L225 Difference]: With dead ends: 114 [2023-11-06 22:59:28,884 INFO L226 Difference]: Without dead ends: 114 [2023-11-06 22:59:28,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:59:28,885 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 132 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:28,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 423 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-06 22:59:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-11-06 22:59:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 104 states have internal predecessors, (120), 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:59:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2023-11-06 22:59:28,890 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 47 [2023-11-06 22:59:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:28,890 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2023-11-06 22:59:28,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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:59:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2023-11-06 22:59:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 22:59:28,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:28,891 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, 1, 1] [2023-11-06 22:59:28,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:29,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:29,101 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:29,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1294228216, now seen corresponding path program 1 times [2023-11-06 22:59:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:29,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133987658] [2023-11-06 22:59:29,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:29,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:29,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:59:29,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:29,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133987658] [2023-11-06 22:59:29,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133987658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:29,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:29,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:59:29,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687466233] [2023-11-06 22:59:29,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:29,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:59:29,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:29,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:59:29,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:29,238 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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:59:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:29,334 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2023-11-06 22:59:29,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:59:29,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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 50 [2023-11-06 22:59:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:29,336 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:59:29,336 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:59:29,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:59:29,337 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 17 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:29,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 266 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:59:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2023-11-06 22:59:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 99 states have internal predecessors, (109), 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:59:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2023-11-06 22:59:29,340 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 50 [2023-11-06 22:59:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:29,340 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2023-11-06 22:59:29,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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:59:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2023-11-06 22:59:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 22:59:29,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:29,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:29,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:59:29,341 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:29,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash 770114167, now seen corresponding path program 3 times [2023-11-06 22:59:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:29,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991435644] [2023-11-06 22:59:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:29,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:29,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:29,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:59:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991435644] [2023-11-06 22:59:29,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991435644] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055426099] [2023-11-06 22:59:29,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:59:29,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:29,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:29,525 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:29,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:59:30,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:59:30,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:59:30,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:59:30,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:59:30,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:59:30,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055426099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:30,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:59:30,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2023-11-06 22:59:30,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062339762] [2023-11-06 22:59:30,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:30,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:59:30,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:30,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:59:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:59:30,558 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:59:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:30,602 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2023-11-06 22:59:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:59:30,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:59:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:30,604 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:59:30,604 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 22:59:30,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:59:30,605 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 75 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 186 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:59:30,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 186 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:59:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 22:59:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2023-11-06 22:59:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 89 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:59:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2023-11-06 22:59:30,608 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 51 [2023-11-06 22:59:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:30,608 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2023-11-06 22:59:30,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:59:30,609 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2023-11-06 22:59:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 22:59:30,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:30,609 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, 1, 1, 1, 1, 1] [2023-11-06 22:59:30,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:30,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:30,810 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:30,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1784807392, now seen corresponding path program 1 times [2023-11-06 22:59:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:30,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034484554] [2023-11-06 22:59:30,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:30,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:31,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034484554] [2023-11-06 22:59:31,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034484554] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:31,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047382486] [2023-11-06 22:59:31,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:31,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:31,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:31,038 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:31,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:59:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:31,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:59:31,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:31,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:31,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047382486] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:31,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:31,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-11-06 22:59:31,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634290323] [2023-11-06 22:59:31,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:31,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:59:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:59:31,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:31,445 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:59:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:31,567 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2023-11-06 22:59:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:59:31,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2023-11-06 22:59:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:31,569 INFO L225 Difference]: With dead ends: 97 [2023-11-06 22:59:31,569 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:59:31,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:31,570 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 125 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:31,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:59:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2023-11-06 22:59:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 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:59:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2023-11-06 22:59:31,573 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 53 [2023-11-06 22:59:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:31,574 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2023-11-06 22:59:31,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:59:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2023-11-06 22:59:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 22:59:31,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:31,574 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:31,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:31,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:31,775 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:31,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1935884788, now seen corresponding path program 1 times [2023-11-06 22:59:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:31,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439760274] [2023-11-06 22:59:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:33,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:33,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:33,858 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:59:33,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:33,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439760274] [2023-11-06 22:59:33,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439760274] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:33,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704211576] [2023-11-06 22:59:33,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:33,861 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:33,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:59:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:34,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-06 22:59:34,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:34,271 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:59:34,565 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:59:34,566 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:59:34,687 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:59:34,791 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:34,792 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 32 treesize of output 31 [2023-11-06 22:59:34,951 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:34,951 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:59:35,026 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-06 22:59:35,271 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-06 22:59:35,277 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:59:35,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-06 22:59:35,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:59:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:36,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:36,188 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3477 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3477) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2023-11-06 22:59:36,594 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:36,595 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 29 treesize of output 30 [2023-11-06 22:59:36,607 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:36,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-11-06 22:59:36,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-11-06 22:59:36,979 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3472 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3472) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-06 22:59:41,475 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:41,475 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 22 treesize of output 23 [2023-11-06 22:59:41,478 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 131 treesize of output 119 [2023-11-06 22:59:41,487 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:59:41,495 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:59:41,501 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:59:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-06 22:59:42,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704211576] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:42,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:42,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 28] total 74 [2023-11-06 22:59:42,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946178680] [2023-11-06 22:59:42,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:42,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-06 22:59:42,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:42,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-06 22:59:42,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4790, Unknown=81, NotChecked=282, Total=5402 [2023-11-06 22:59:42,166 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 74 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 65 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 22:59:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:45,682 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2023-11-06 22:59:45,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:59:45,683 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 65 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2023-11-06 22:59:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:45,685 INFO L225 Difference]: With dead ends: 93 [2023-11-06 22:59:45,685 INFO L226 Difference]: Without dead ends: 93 [2023-11-06 22:59:45,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1862 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=641, Invalid=8598, Unknown=81, NotChecked=382, Total=9702 [2023-11-06 22:59:45,689 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 293 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:45,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1858 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1619 Invalid, 0 Unknown, 176 Unchecked, 1.6s Time] [2023-11-06 22:59:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-06 22:59:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-06 22:59:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 89 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:59:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2023-11-06 22:59:45,693 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 56 [2023-11-06 22:59:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:45,693 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2023-11-06 22:59:45,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 65 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 22:59:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2023-11-06 22:59:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:59:45,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:45,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:45,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:45,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:45,914 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:45,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1543015525, now seen corresponding path program 1 times [2023-11-06 22:59:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474303926] [2023-11-06 22:59:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:47,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:59:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474303926] [2023-11-06 22:59:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474303926] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:47,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884304984] [2023-11-06 22:59:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:47,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:47,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:47,536 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:47,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 22:59:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:47,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-06 22:59:47,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:47,922 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:59:48,029 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:59:48,030 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:59:48,062 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:59:48,130 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:48,130 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 32 treesize of output 31 [2023-11-06 22:59:48,204 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:48,205 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:59:48,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-06 22:59:48,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:48,344 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:59:48,592 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:48,592 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:59:48,775 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:59:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:59:48,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:48,823 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3679 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3679) |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:59:48,837 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3679 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3679) |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:59:48,960 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3679 (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_3679) |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:59:48,979 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3678))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3679)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_3678 (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_3678 .cse1))))))) is different from false [2023-11-06 22:59:49,004 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3678) (select v_ArrVal_3678 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3679) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_3678 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_3678 .cse0))))))) is different from false [2023-11-06 22:59:49,022 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_3678 .cse0))) v_ArrVal_3678)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3678) (select v_ArrVal_3678 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3679) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1))) is different from false [2023-11-06 22:59:49,038 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3678) (select v_ArrVal_3678 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3679) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_3678 .cse0))) v_ArrVal_3678)))) is different from false [2023-11-06 22:59:49,060 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_3678 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8))) (store (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_3678 .cse0))) .cse1 (select v_ArrVal_3678 .cse1))))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3678) (select v_ArrVal_3678 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3679) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2023-11-06 22:59:49,082 INFO L322 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2023-11-06 22:59:49,082 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 27 treesize of output 26 [2023-11-06 22:59:49,098 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3675 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3675))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3678) (select v_ArrVal_3678 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3679) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= v_ArrVal_3678 (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8))) (store (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_3678 .cse1))) .cse2 (select v_ArrVal_3678 .cse2)))))))) is different from false [2023-11-06 22:59:49,132 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3675 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3675))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_3678 (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8))) (store (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_3678 .cse1))) .cse2 (select v_ArrVal_3678 .cse2))))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3678) (select v_ArrVal_3678 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3679) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2023-11-06 22:59:49,152 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3674 (Array Int Int)) (v_ArrVal_3675 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int) (v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3674) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3675))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3678) (select v_ArrVal_3678 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3679) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= v_ArrVal_3678 (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8))) (store (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_3678 .cse1))) .cse2 (select v_ArrVal_3678 .cse2)))))))) is different from false [2023-11-06 22:59:49,182 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:49,183 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 62 treesize of output 62 [2023-11-06 22:59:49,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2023-11-06 22:59:49,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:49,213 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:49,213 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 125 [2023-11-06 22:59:49,222 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:49,233 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:49,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 89 [2023-11-06 22:59:49,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:49,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:49,255 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:59:49,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 81 [2023-11-06 22:59:49,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-06 22:59:49,319 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:49,320 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 25 treesize of output 17 [2023-11-06 22:59:49,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:49,339 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 25 treesize of output 17 [2023-11-06 22:59:49,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:49,364 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 25 treesize of output 17 [2023-11-06 22:59:49,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:49,383 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 25 treesize of output 17 [2023-11-06 22:59:49,394 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:49,395 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:59:49,396 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-11-06 22:59:49,407 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:59:49,410 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-06 22:59:49,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884304984] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:49,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:59:49,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 33 [2023-11-06 22:59:49,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703215325] [2023-11-06 22:59:49,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:49,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-06 22:59:49,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:49,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-06 22:59:49,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1288, Unknown=26, NotChecked=902, Total=2352 [2023-11-06 22:59:49,637 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 34 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:59:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:50,966 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2023-11-06 22:59:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:59:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2023-11-06 22:59:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:50,967 INFO L225 Difference]: With dead ends: 121 [2023-11-06 22:59:50,968 INFO L226 Difference]: Without dead ends: 121 [2023-11-06 22:59:50,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=239, Invalid=2228, Unknown=27, NotChecked=1166, Total=3660 [2023-11-06 22:59:50,970 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:50,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1146 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:59:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-06 22:59:50,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2023-11-06 22:59:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 93 states have internal predecessors, (100), 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:59:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2023-11-06 22:59:50,974 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 60 [2023-11-06 22:59:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:50,974 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2023-11-06 22:59:50,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:59:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2023-11-06 22:59:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:59:50,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:50,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:50,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:51,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:51,183 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 22:59:51,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1543015524, now seen corresponding path program 1 times [2023-11-06 22:59:51,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:51,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049822118] [2023-11-06 22:59:51,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:51,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:59:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:53,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:59:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:59:53,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049822118] [2023-11-06 22:59:53,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049822118] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638278451] [2023-11-06 22:59:53,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:53,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:53,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:53,496 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:53,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 22:59:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:53,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-06 22:59:53,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:53,888 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:59:54,206 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:59:54,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:59:54,233 WARN L839 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse0 (select |c_#length| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) is different from false [2023-11-06 22:59:54,236 WARN L861 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse0 (select |c_#length| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) is different from true [2023-11-06 22:59:54,341 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:59:54,356 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:59:54,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:59:54,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:59:54,672 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:54,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-06 22:59:54,677 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:59:54,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:59:54,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-06 22:59:54,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:54,830 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:59:54,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:54,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 22:59:55,195 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:59:55,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-06 22:59:55,206 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:59:55,403 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:59:55,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:59:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:59:55,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:58,717 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((v_DerPreprocessor_8 Int) (v_ArrVal_3886 Int) (v_ArrVal_3889 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8))) (let ((.cse0 (store .cse3 .cse2 v_ArrVal_3886))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select (store .cse1 .cse2 v_DerPreprocessor_8) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3889) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 9)) (< (+ (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) 8) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_3886 Int)) (let ((.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8))) (let ((.cse4 (store .cse3 .cse6 v_ArrVal_3886))) (or (forall ((v_ArrVal_3887 (Array Int Int))) (or (forall ((v_ArrVal_3888 (Array Int Int)) (v_ArrVal_3889 (Array Int Int))) (let ((.cse5 (select v_ArrVal_3887 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) .cse5 v_ArrVal_3889) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3887) .cse5 v_ArrVal_3888) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (not (= (store .cse1 .cse6 (select v_ArrVal_3887 .cse6)) v_ArrVal_3887)))) (< (+ (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|) 8) 0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2023-11-06 22:59:58,775 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_3886 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8))) (let ((.cse2 (store .cse4 .cse1 v_ArrVal_3886))) (or (forall ((v_ArrVal_3887 (Array Int Int))) (or (not (= v_ArrVal_3887 (store .cse0 .cse1 (select v_ArrVal_3887 .cse1)))) (forall ((v_ArrVal_3888 (Array Int Int)) (v_ArrVal_3889 (Array Int Int))) (let ((.cse3 (select v_ArrVal_3887 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2) .cse3 v_ArrVal_3889) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_3887) .cse3 v_ArrVal_3888) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) (< (+ (select .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8) 0))))))) (forall ((v_DerPreprocessor_8 Int) (v_ArrVal_3886 Int) (v_ArrVal_3889 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8))) (let ((.cse5 (store .cse4 .cse6 v_ArrVal_3886))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse5) (select (store .cse0 .cse6 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3889) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (< (+ (select .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8) 0))))))) is different from false [2023-11-06 22:59:58,831 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((v_DerPreprocessor_8 Int) (v_ArrVal_3886 Int) (v_ArrVal_3889 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8))) (let ((.cse0 (store .cse3 .cse2 v_ArrVal_3886))) (or (< (+ (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8) 0) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select (store .cse1 .cse2 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3889) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 9)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3886 Int)) (let ((.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8))) (let ((.cse4 (store .cse3 .cse6 v_ArrVal_3886))) (or (< (+ (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8) 0) (forall ((v_ArrVal_3887 (Array Int Int))) (or (forall ((v_ArrVal_3888 (Array Int Int)) (v_ArrVal_3889 (Array Int Int))) (let ((.cse5 (select v_ArrVal_3887 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse4) .cse5 v_ArrVal_3889) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3887) .cse5 v_ArrVal_3888) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= (store .cse1 .cse6 (select v_ArrVal_3887 .cse6)) v_ArrVal_3887)))))))))))) is different from false [2023-11-06 22:59:58,893 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_DerPreprocessor_8 Int) (v_ArrVal_3886 Int) (v_ArrVal_3881 Int) (v_ArrVal_3882 Int) (v_ArrVal_3889 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8))) (let ((.cse0 (store (store .cse4 .cse2 v_ArrVal_3882) .cse3 v_ArrVal_3886))) (or (< (+ (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select (store (store .cse1 .cse2 v_ArrVal_3881) .cse3 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3889) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_3886 Int) (v_ArrVal_3887 (Array Int Int)) (v_ArrVal_3882 Int) (v_ArrVal_3888 (Array Int Int)) (v_ArrVal_3889 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8))) (let ((.cse5 (store (store .cse4 .cse2 v_ArrVal_3882) .cse6 v_ArrVal_3886))) (or (< (+ (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8) 0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (store (store .cse1 .cse2 (select v_ArrVal_3887 .cse2)) .cse6 (select v_ArrVal_3887 .cse6)) v_ArrVal_3887)) (let ((.cse7 (select v_ArrVal_3887 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse5) .cse7 v_ArrVal_3889) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 11) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3887) .cse7 v_ArrVal_3888) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))))) is different from false [2023-11-06 23:00:00,060 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:00,060 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 127 treesize of output 119 [2023-11-06 23:00:00,076 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 295 treesize of output 289 [2023-11-06 23:00:00,110 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:00,110 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 342 treesize of output 342 [2023-11-06 23:00:00,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,130 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 150 treesize of output 146 [2023-11-06 23:00:00,148 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,153 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 23:00:00,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,166 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 109 treesize of output 103 [2023-11-06 23:00:00,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2023-11-06 23:00:00,200 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,200 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,218 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:00,219 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 135 [2023-11-06 23:00:00,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,255 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:00,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 89 [2023-11-06 23:00:00,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,286 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:00,287 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 71 [2023-11-06 23:00:00,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-11-06 23:00:00,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-11-06 23:00:00,404 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,405 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 25 treesize of output 17 [2023-11-06 23:00:00,429 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,430 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 25 treesize of output 17 [2023-11-06 23:00:00,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,472 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 25 treesize of output 17 [2023-11-06 23:00:00,499 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,500 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,501 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2023-11-06 23:00:00,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,514 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,515 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2023-11-06 23:00:00,533 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 23:00:00,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:00,581 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:00:00,582 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 139 treesize of output 1 [2023-11-06 23:00:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638278451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:01,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:00:01,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 39 [2023-11-06 23:00:01,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986997760] [2023-11-06 23:00:01,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:01,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-06 23:00:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:01,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-06 23:00:01,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2667, Unknown=10, NotChecked=540, Total=3422 [2023-11-06 23:00:01,079 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 40 states, 39 states have (on average 2.358974358974359) internal successors, (92), 35 states have internal predecessors, (92), 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 23:00:01,549 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse0 (select |c_#length| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (< 11 .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (<= 12 .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0))) is different from false [2023-11-06 23:00:01,552 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse0 (select |c_#length| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (< 11 .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (<= 12 .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0))) is different from true [2023-11-06 23:00:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:03,222 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2023-11-06 23:00:03,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:00:03,223 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.358974358974359) internal successors, (92), 35 states have internal predecessors, (92), 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 60 [2023-11-06 23:00:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:03,224 INFO L225 Difference]: With dead ends: 102 [2023-11-06 23:00:03,224 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 23:00:03,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=356, Invalid=4078, Unknown=12, NotChecked=810, Total=5256 [2023-11-06 23:00:03,226 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 172 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:03,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1256 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 957 Invalid, 0 Unknown, 134 Unchecked, 1.0s Time] [2023-11-06 23:00:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 23:00:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2023-11-06 23:00:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 92 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 23:00:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2023-11-06 23:00:03,230 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 60 [2023-11-06 23:00:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:03,230 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2023-11-06 23:00:03,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.358974358974359) internal successors, (92), 35 states have internal predecessors, (92), 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 23:00:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2023-11-06 23:00:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 23:00:03,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:03,231 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 23:00:03,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:03,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-06 23:00:03,432 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:03,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash -293976915, now seen corresponding path program 1 times [2023-11-06 23:00:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:03,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821805507] [2023-11-06 23:00:03,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:03,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:03,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 23:00:03,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821805507] [2023-11-06 23:00:03,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821805507] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458172940] [2023-11-06 23:00:03,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:03,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:03,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:03,605 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:03,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 23:00:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:04,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:00:04,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 23:00:04,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 23:00:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458172940] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:04,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-11-06 23:00:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808085155] [2023-11-06 23:00:04,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:04,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:00:04,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:04,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:00:04,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:00:04,087 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 23:00:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:04,224 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2023-11-06 23:00:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:00:04,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-11-06 23:00:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:04,226 INFO L225 Difference]: With dead ends: 96 [2023-11-06 23:00:04,226 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 23:00:04,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:00:04,227 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 114 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:04,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:00:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 23:00:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-06 23:00:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 92 states have internal predecessors, (96), 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 23:00:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2023-11-06 23:00:04,231 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 63 [2023-11-06 23:00:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:04,232 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2023-11-06 23:00:04,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 23:00:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2023-11-06 23:00:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 23:00:04,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:04,233 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 23:00:04,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:04,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:04,440 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:04,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:04,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1061167674, now seen corresponding path program 2 times [2023-11-06 23:00:04,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:04,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930943644] [2023-11-06 23:00:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:04,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 23:00:04,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:04,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930943644] [2023-11-06 23:00:04,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930943644] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:04,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593933668] [2023-11-06 23:00:04,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:00:04,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:04,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:04,624 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:04,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 23:00:05,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:00:05,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:00:05,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:00:05,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 23:00:05,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 23:00:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593933668] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:05,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:05,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2023-11-06 23:00:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831908816] [2023-11-06 23:00:05,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:05,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:00:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:05,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:00:05,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:00:05,350 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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 23:00:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:05,507 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-11-06 23:00:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:00:05,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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 63 [2023-11-06 23:00:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:05,509 INFO L225 Difference]: With dead ends: 87 [2023-11-06 23:00:05,509 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 23:00:05,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:00:05,509 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 71 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:05,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 294 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:00:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 23:00:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-06 23:00:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 83 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 23:00:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2023-11-06 23:00:05,514 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 63 [2023-11-06 23:00:05,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:05,514 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2023-11-06 23:00:05,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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 23:00:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2023-11-06 23:00:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 23:00:05,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:05,515 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 23:00:05,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:05,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:05,722 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:05,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:05,723 INFO L85 PathProgramCache]: Analyzing trace with hash 933436846, now seen corresponding path program 1 times [2023-11-06 23:00:05,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:05,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211832020] [2023-11-06 23:00:05,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:05,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:08,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:08,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:00:08,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:08,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211832020] [2023-11-06 23:00:08,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211832020] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:08,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098778736] [2023-11-06 23:00:08,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:08,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:08,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:08,637 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:08,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 23:00:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:09,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-06 23:00:09,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:09,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:00:09,653 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:00:09,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 23:00:09,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:00:09,903 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:00:09,904 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 32 treesize of output 31 [2023-11-06 23:00:10,104 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:00:10,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-06 23:00:10,187 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-06 23:00:10,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:10,538 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 23:00:11,024 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:00:11,025 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 23:00:11,029 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 23:00:11,033 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 23:00:11,618 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 23:00:11,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-06 23:00:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:12,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:12,712 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 76 treesize of output 56 [2023-11-06 23:00:12,732 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4478 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4478) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_4479 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4479) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) is different from false [2023-11-06 23:00:12,765 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4479 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4479) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_4478 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4478) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) is different from false [2023-11-06 23:00:12,786 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:12,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-11-06 23:00:12,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-11-06 23:00:13,147 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4476 (Array Int Int))) (or (not (= v_ArrVal_4476 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_4476 .cse0))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4476) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2023-11-06 23:00:13,813 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4473 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4473) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2023-11-06 23:00:13,823 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4472 (Array Int Int)) (v_ArrVal_4473 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4472) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4473) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2023-11-06 23:00:13,837 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:13,837 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 22 treesize of output 23 [2023-11-06 23:00:13,843 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 65 treesize of output 57 [2023-11-06 23:00:13,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 23:00:13,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 23:00:13,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 6 treesize of output 4 [2023-11-06 23:00:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-06 23:00:14,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098778736] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:14,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:14,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 31] total 87 [2023-11-06 23:00:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177315003] [2023-11-06 23:00:14,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:14,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2023-11-06 23:00:14,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:14,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2023-11-06 23:00:14,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=6369, Unknown=32, NotChecked=820, Total=7482 [2023-11-06 23:00:14,866 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 87 states, 86 states have (on average 1.9534883720930232) internal successors, (168), 78 states have internal predecessors, (168), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 23:00:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:21,497 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2023-11-06 23:00:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-06 23:00:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 1.9534883720930232) internal successors, (168), 78 states have internal predecessors, (168), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 66 [2023-11-06 23:00:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:21,499 INFO L225 Difference]: With dead ends: 83 [2023-11-06 23:00:21,499 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 23:00:21,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2090 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=671, Invalid=11307, Unknown=32, NotChecked=1100, Total=13110 [2023-11-06 23:00:21,503 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 280 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:21,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 2214 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2492 Invalid, 0 Unknown, 399 Unchecked, 2.9s Time] [2023-11-06 23:00:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 23:00:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-06 23:00:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.173913043478261) internal successors, (81), 79 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 23:00:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2023-11-06 23:00:21,507 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 66 [2023-11-06 23:00:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:21,508 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2023-11-06 23:00:21,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 1.9534883720930232) internal successors, (168), 78 states have internal predecessors, (168), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 23:00:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2023-11-06 23:00:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 23:00:21,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:21,509 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] [2023-11-06 23:00:21,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:21,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-06 23:00:21,716 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:21,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:21,716 INFO L85 PathProgramCache]: Analyzing trace with hash -602110429, now seen corresponding path program 1 times [2023-11-06 23:00:21,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:21,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944336116] [2023-11-06 23:00:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:21,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:21,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:21,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 23:00:22,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:22,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944336116] [2023-11-06 23:00:22,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944336116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:22,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:22,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 23:00:22,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521191410] [2023-11-06 23:00:22,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:22,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:00:22,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:22,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:00:22,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:00:22,029 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 23:00:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:22,534 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2023-11-06 23:00:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:00:22,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 68 [2023-11-06 23:00:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:22,535 INFO L225 Difference]: With dead ends: 101 [2023-11-06 23:00:22,536 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 23:00:22,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:00:22,536 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 91 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:22,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 290 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:00:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 23:00:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2023-11-06 23:00:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.1917808219178083) 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 23:00:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2023-11-06 23:00:22,544 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 68 [2023-11-06 23:00:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:22,545 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2023-11-06 23:00:22,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 23:00:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2023-11-06 23:00:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 23:00:22,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:22,546 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] [2023-11-06 23:00:22,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-06 23:00:22,546 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:22,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:22,547 INFO L85 PathProgramCache]: Analyzing trace with hash -602110428, now seen corresponding path program 1 times [2023-11-06 23:00:22,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:22,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948404712] [2023-11-06 23:00:22,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:22,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:23,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:23,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 23:00:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:23,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948404712] [2023-11-06 23:00:23,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948404712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:23,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:23,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 23:00:23,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251211137] [2023-11-06 23:00:23,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:23,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:00:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:23,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:00:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:00:23,125 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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 23:00:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:23,565 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2023-11-06 23:00:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:00:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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 68 [2023-11-06 23:00:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:23,567 INFO L225 Difference]: With dead ends: 84 [2023-11-06 23:00:23,567 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 23:00:23,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:00:23,568 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 93 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:23,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 263 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:00:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 23:00:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-06 23:00:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 80 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 23:00:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2023-11-06 23:00:23,578 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 68 [2023-11-06 23:00:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:23,578 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2023-11-06 23:00:23,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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 23:00:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2023-11-06 23:00:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 23:00:23,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:23,581 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] [2023-11-06 23:00:23,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-06 23:00:23,581 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:23,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:23,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1485520219, now seen corresponding path program 1 times [2023-11-06 23:00:23,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:23,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299687593] [2023-11-06 23:00:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:23,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 23:00:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:23,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299687593] [2023-11-06 23:00:23,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299687593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:23,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:23,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 23:00:23,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455297931] [2023-11-06 23:00:23,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:23,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:00:23,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:23,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:00:23,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:00:23,860 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 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 23:00:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:24,190 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2023-11-06 23:00:24,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:00:24,190 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 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 69 [2023-11-06 23:00:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:24,191 INFO L225 Difference]: With dead ends: 84 [2023-11-06 23:00:24,191 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 23:00:24,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:00:24,192 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 91 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:24,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 335 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:00:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 23:00:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-06 23:00:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 80 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 23:00:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2023-11-06 23:00:24,195 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 69 [2023-11-06 23:00:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:24,195 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2023-11-06 23:00:24,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 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 23:00:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2023-11-06 23:00:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 23:00:24,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:24,196 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] [2023-11-06 23:00:24,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-06 23:00:24,197 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:24,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1688269605, now seen corresponding path program 1 times [2023-11-06 23:00:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:24,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882940872] [2023-11-06 23:00:24,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:24,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:24,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:24,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 23:00:24,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:24,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882940872] [2023-11-06 23:00:24,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882940872] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:24,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73425579] [2023-11-06 23:00:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:24,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:24,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:24,557 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:24,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-06 23:00:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:25,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-06 23:00:25,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:25,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 23:00:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 23:00:25,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:25,708 INFO L322 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-06 23:00:25,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-06 23:00:25,827 INFO L322 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-06 23:00:25,827 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 23:00:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 23:00:25,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73425579] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:25,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:25,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2023-11-06 23:00:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072056024] [2023-11-06 23:00:25,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:25,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 23:00:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:25,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 23:00:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2023-11-06 23:00:25,929 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 27 states, 26 states have (on average 4.538461538461538) internal successors, (118), 25 states have internal predecessors, (118), 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 23:00:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:26,900 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2023-11-06 23:00:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 23:00:26,901 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.538461538461538) internal successors, (118), 25 states have internal predecessors, (118), 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 71 [2023-11-06 23:00:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:26,902 INFO L225 Difference]: With dead ends: 92 [2023-11-06 23:00:26,902 INFO L226 Difference]: Without dead ends: 92 [2023-11-06 23:00:26,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2023-11-06 23:00:26,903 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 185 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:26,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 655 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:00:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-06 23:00:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2023-11-06 23:00:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.135135135135135) internal successors, (84), 80 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 23:00:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2023-11-06 23:00:26,906 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 71 [2023-11-06 23:00:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:26,907 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2023-11-06 23:00:26,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.538461538461538) internal successors, (118), 25 states have internal predecessors, (118), 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 23:00:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2023-11-06 23:00:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 23:00:26,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:26,908 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] [2023-11-06 23:00:26,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:27,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-06 23:00:27,112 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:27,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1688269604, now seen corresponding path program 1 times [2023-11-06 23:00:27,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:27,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703265119] [2023-11-06 23:00:27,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:27,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:29,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:00:29,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703265119] [2023-11-06 23:00:29,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703265119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203727067] [2023-11-06 23:00:29,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:29,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:29,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:29,291 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:29,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-06 23:00:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:29,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-06 23:00:29,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:29,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:00:30,171 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:00:30,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 23:00:30,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:00:30,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:00:30,479 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:00:30,479 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 48 treesize of output 43 [2023-11-06 23:00:30,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 23:00:30,707 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:00:30,707 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 23:00:30,715 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 23:00:30,798 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 23:00:30,805 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 23:00:31,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:31,131 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 23:00:31,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:31,141 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 23:00:31,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-06 23:00:31,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:00:32,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 23:00:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:00:32,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:32,530 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:32,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2023-11-06 23:00:32,772 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:32,772 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 23:00:34,937 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:34,937 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 91 treesize of output 91 [2023-11-06 23:00:34,947 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:34,948 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 79 treesize of output 71 [2023-11-06 23:00:34,957 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 181 treesize of output 175 [2023-11-06 23:00:34,972 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 155 treesize of output 151 [2023-11-06 23:00:34,982 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:34,986 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 146 treesize of output 142 [2023-11-06 23:00:34,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:35,007 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 23:00:35,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:35,019 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 118 treesize of output 116 [2023-11-06 23:00:35,027 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:35,030 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 183 treesize of output 179 [2023-11-06 23:00:35,036 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:35,039 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 175 treesize of output 169 [2023-11-06 23:00:35,049 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:35,052 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 125 treesize of output 117 [2023-11-06 23:00:35,062 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 38 treesize of output 36 [2023-11-06 23:00:35,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203727067] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:35,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:00:35,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 54 [2023-11-06 23:00:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622990235] [2023-11-06 23:00:35,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:35,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-06 23:00:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:35,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-06 23:00:35,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=5535, Unknown=22, NotChecked=0, Total=5852 [2023-11-06 23:00:35,683 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 55 states, 54 states have (on average 2.3703703703703702) internal successors, (128), 50 states have internal predecessors, (128), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 23:00:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:39,089 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2023-11-06 23:00:39,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 23:00:39,090 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.3703703703703702) internal successors, (128), 50 states have internal predecessors, (128), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2023-11-06 23:00:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:39,091 INFO L225 Difference]: With dead ends: 90 [2023-11-06 23:00:39,091 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 23:00:39,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=592, Invalid=8892, Unknown=22, NotChecked=0, Total=9506 [2023-11-06 23:00:39,093 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 210 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:39,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1030 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 23:00:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 23:00:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2023-11-06 23:00:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.118421052631579) internal successors, (85), 82 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 23:00:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2023-11-06 23:00:39,097 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 71 [2023-11-06 23:00:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:39,098 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2023-11-06 23:00:39,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.3703703703703702) internal successors, (128), 50 states have internal predecessors, (128), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 23:00:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2023-11-06 23:00:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 23:00:39,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:39,099 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 23:00:39,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:39,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-11-06 23:00:39,307 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:39,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash -796751574, now seen corresponding path program 1 times [2023-11-06 23:00:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:39,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246777191] [2023-11-06 23:00:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:39,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:39,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 23:00:39,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:39,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246777191] [2023-11-06 23:00:39,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246777191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:39,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:39,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 23:00:39,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371149330] [2023-11-06 23:00:39,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:39,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:00:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:00:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:00:39,664 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 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 23:00:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:40,039 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2023-11-06 23:00:40,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:00:40,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 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 72 [2023-11-06 23:00:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:40,040 INFO L225 Difference]: With dead ends: 85 [2023-11-06 23:00:40,040 INFO L226 Difference]: Without dead ends: 85 [2023-11-06 23:00:40,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:00:40,041 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 80 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:40,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 292 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:00:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-06 23:00:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-06 23:00:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 81 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 23:00:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2023-11-06 23:00:40,043 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 72 [2023-11-06 23:00:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:40,044 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2023-11-06 23:00:40,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 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 23:00:40,044 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2023-11-06 23:00:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-06 23:00:40,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:40,045 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, 1, 1] [2023-11-06 23:00:40,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-06 23:00:40,045 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:40,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1172661073, now seen corresponding path program 1 times [2023-11-06 23:00:40,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:40,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267348588] [2023-11-06 23:00:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:40,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:41,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 23:00:41,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:41,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267348588] [2023-11-06 23:00:41,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267348588] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:41,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032239983] [2023-11-06 23:00:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:41,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:41,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:41,681 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:41,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-06 23:00:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:42,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-06 23:00:42,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:42,156 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:00:42,260 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 23:00:42,336 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:00:42,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 23:00:42,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:00:42,556 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:00:42,556 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 23:00:42,713 INFO L322 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-06 23:00:42,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-06 23:00:42,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-11-06 23:00:43,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:43,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:43,088 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:43,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 27 [2023-11-06 23:00:43,500 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:00:43,501 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 45 treesize of output 40 [2023-11-06 23:00:43,839 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:43,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2023-11-06 23:00:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:00:43,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:44,223 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5545 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5545) |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 23:00:44,234 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5545 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_5545) |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 23:00:44,241 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5545 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5545) |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 23:00:44,252 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5545 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5545) |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 23:00:44,276 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5544 (Array Int Int))) (or (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5544))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5545)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|) (not (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_5544 .cse1))) v_ArrVal_5544)))) is different from false [2023-11-06 23:00:44,305 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5544 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| Int)) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_5544 .cse0))) v_ArrVal_5544)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| |c_ULTIMATE.start_main_~s~0#1.offset|) (< (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5544) (select v_ArrVal_5544 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5545) |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 23:00:44,326 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5544 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_5544) (select v_ArrVal_5544 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5545) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) |c_#StackHeapBarrier|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_5544 .cse0))) v_ArrVal_5544)))) is different from false [2023-11-06 23:00:44,346 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5544 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5544) (select v_ArrVal_5544 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5545) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_5544 .cse0))) v_ArrVal_5544)))) is different from false [2023-11-06 23:00:44,365 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5544 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| Int)) (or (not (= v_ArrVal_5544 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| 8))) (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_5544 .cse0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5544) (select v_ArrVal_5544 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5545) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|))) is different from false [2023-11-06 23:00:44,383 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5541 (Array Int Int)) (v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5544 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5541))) (or (not (= v_ArrVal_5544 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_5544 .cse1))))) (< (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5544) (select v_ArrVal_5544 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5545) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-06 23:00:44,420 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5541 (Array Int Int)) (v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5544 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5541))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5544) (select v_ArrVal_5544 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5545) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_5544 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_5544 .cse1)))))))) is different from false [2023-11-06 23:00:44,441 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5541 (Array Int Int)) (v_ArrVal_5540 (Array Int Int)) (v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5544 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5540) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5541))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5544) (select v_ArrVal_5544 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5545) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_5544 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_62| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_5544 .cse1)))))))) is different from false [2023-11-06 23:00:44,479 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:44,480 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 58 treesize of output 58 [2023-11-06 23:00:44,486 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 113 treesize of output 109 [2023-11-06 23:00:44,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:44,506 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:44,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2023-11-06 23:00:44,515 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:44,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:44,530 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:44,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 91 [2023-11-06 23:00:44,542 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:44,553 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:44,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2023-11-06 23:00:44,567 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-11-06 23:00:44,703 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:44,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:44,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 160 [2023-11-06 23:00:44,797 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:44,798 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:44,798 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 108 [2023-11-06 23:00:44,848 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:44,849 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 63 treesize of output 51 [2023-11-06 23:00:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032239983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:45,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:00:45,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 43 [2023-11-06 23:00:45,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177015172] [2023-11-06 23:00:45,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:45,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-06 23:00:45,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:45,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-06 23:00:45,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2112, Unknown=12, NotChecked=1236, Total=3540 [2023-11-06 23:00:45,140 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 44 states, 43 states have (on average 2.558139534883721) internal successors, (110), 39 states have internal predecessors, (110), 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 23:00:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:47,223 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-11-06 23:00:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 23:00:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.558139534883721) internal successors, (110), 39 states have internal predecessors, (110), 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 74 [2023-11-06 23:00:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:47,225 INFO L225 Difference]: With dead ends: 87 [2023-11-06 23:00:47,225 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 23:00:47,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=317, Invalid=3501, Unknown=12, NotChecked=1572, Total=5402 [2023-11-06 23:00:47,226 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 124 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:47,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 749 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 23:00:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 23:00:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2023-11-06 23:00:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 82 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 23:00:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2023-11-06 23:00:47,230 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 74 [2023-11-06 23:00:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:47,230 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2023-11-06 23:00:47,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.558139534883721) internal successors, (110), 39 states have internal predecessors, (110), 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 23:00:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2023-11-06 23:00:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-06 23:00:47,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:47,232 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, 1, 1, 1] [2023-11-06 23:00:47,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:47,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-06 23:00:47,453 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:47,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:47,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2036683463, now seen corresponding path program 1 times [2023-11-06 23:00:47,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:47,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183182784] [2023-11-06 23:00:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 23:00:48,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:48,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183182784] [2023-11-06 23:00:48,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183182784] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:48,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340398297] [2023-11-06 23:00:48,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:48,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:48,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:48,898 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:48,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-06 23:00:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:49,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-06 23:00:49,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:49,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:00:49,499 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:00:49,500 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 23:00:49,602 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:00:49,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:00:49,811 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:00:49,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-06 23:00:49,820 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-06 23:00:49,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:49,909 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 23:00:50,094 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:00:50,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-06 23:00:50,233 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:50,234 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 23:00:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 23:00:50,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:50,640 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5748 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5748) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2023-11-06 23:00:50,865 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5748 (Array Int Int))) (not (= (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_5748) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2023-11-06 23:00:50,881 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5748 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5747))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5748)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= v_ArrVal_5747 (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_5747 .cse1))))))) is different from false [2023-11-06 23:00:50,904 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| Int) (v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5748 (Array Int Int))) (or (not (= v_ArrVal_5747 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_5747 .cse0))))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5747) (select v_ArrVal_5747 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5748) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-11-06 23:00:50,935 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| Int) (v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5748 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_5747) (select v_ArrVal_5747 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5748) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (= v_ArrVal_5747 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_5747 .cse0))))))) is different from false [2023-11-06 23:00:50,951 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| Int) (v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5748 (Array Int Int))) (or (not (= v_ArrVal_5747 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_5747 .cse0))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5747) (select v_ArrVal_5747 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5748) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2023-11-06 23:00:50,968 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| Int) (v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5748 (Array Int Int))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| 8))) (store (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_5747 .cse0))) .cse1 (select v_ArrVal_5747 .cse1))) v_ArrVal_5747)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5747) (select v_ArrVal_5747 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5748) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2023-11-06 23:00:50,987 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| Int) (v_ArrVal_5744 (Array Int Int)) (v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5748 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5744))) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| 8))) (store (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_5747 .cse1))) .cse2 (select v_ArrVal_5747 .cse2))) v_ArrVal_5747)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5747) (select v_ArrVal_5747 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5748) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-06 23:00:51,022 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| Int) (v_ArrVal_5744 (Array Int Int)) (v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5748 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5744))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5747) (select v_ArrVal_5747 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5748) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= v_ArrVal_5747 (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| 8))) (store (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_5747 .cse1))) .cse2 (select v_ArrVal_5747 .cse2)))))))) is different from false [2023-11-06 23:00:51,044 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| Int) (v_ArrVal_5743 (Array Int Int)) (v_ArrVal_5744 (Array Int Int)) (v_ArrVal_5747 (Array Int Int)) (v_ArrVal_5748 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5743) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5744))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5747) (select v_ArrVal_5747 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5748) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_67| 8))) (store (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_5747 .cse1))) .cse2 (select v_ArrVal_5747 .cse2))) v_ArrVal_5747))))) is different from false [2023-11-06 23:00:51,073 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:51,074 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 65 treesize of output 65 [2023-11-06 23:00:51,079 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 259 treesize of output 253 [2023-11-06 23:00:51,087 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:51,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:51,109 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:51,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 135 [2023-11-06 23:00:51,121 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:51,134 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:51,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 107 [2023-11-06 23:00:51,144 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:51,155 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:51,156 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 71 [2023-11-06 23:00:51,168 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 24 [2023-11-06 23:00:51,204 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:51,205 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 25 treesize of output 17 [2023-11-06 23:00:51,224 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:51,225 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 25 treesize of output 17 [2023-11-06 23:00:51,248 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:51,248 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 25 treesize of output 17 [2023-11-06 23:00:51,268 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:51,271 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:00:51,297 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:51,298 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 38 treesize of output 54 [2023-11-06 23:00:51,330 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 23:00:51,338 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:51,338 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 24 treesize of output 26 [2023-11-06 23:00:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2023-11-06 23:00:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340398297] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:51,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 28] total 63 [2023-11-06 23:00:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057191505] [2023-11-06 23:00:51,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:51,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-06 23:00:51,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:51,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-06 23:00:51,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2584, Unknown=41, NotChecked=1110, Total=3906 [2023-11-06 23:00:51,997 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 63 states, 63 states have (on average 2.3333333333333335) internal successors, (147), 56 states have internal predecessors, (147), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 23:00:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:54,667 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2023-11-06 23:00:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:00:54,668 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.3333333333333335) internal successors, (147), 56 states have internal predecessors, (147), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 75 [2023-11-06 23:00:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:54,668 INFO L225 Difference]: With dead ends: 84 [2023-11-06 23:00:54,669 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 23:00:54,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 117 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=315, Invalid=4375, Unknown=42, NotChecked=1430, Total=6162 [2023-11-06 23:00:54,670 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 175 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 754 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:54,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 958 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1231 Invalid, 0 Unknown, 754 Unchecked, 1.3s Time] [2023-11-06 23:00:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 23:00:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2023-11-06 23:00:54,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 79 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 23:00:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2023-11-06 23:00:54,673 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 75 [2023-11-06 23:00:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:54,674 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2023-11-06 23:00:54,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.3333333333333335) internal successors, (147), 56 states have internal predecessors, (147), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 23:00:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2023-11-06 23:00:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-06 23:00:54,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:54,675 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:54,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:54,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-06 23:00:54,881 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-06 23:00:54,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash 518130400, now seen corresponding path program 1 times [2023-11-06 23:00:54,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:54,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056967317] [2023-11-06 23:00:54,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:57,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:57,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:00:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 23:00:57,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:57,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056967317] [2023-11-06 23:00:57,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056967317] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:57,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074608646] [2023-11-06 23:00:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:57,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:57,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:57,883 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:57,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8544739-7be7-452d-8bfc-6da898381aa0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-06 23:00:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:58,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-06 23:00:58,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:58,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:00:58,532 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:00:58,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 23:00:58,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:00:58,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:00:58,697 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:00:58,697 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 48 treesize of output 43 [2023-11-06 23:00:58,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 23:00:58,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 19 treesize of output 18 [2023-11-06 23:00:58,788 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 23:00:58,906 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:00:58,906 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 46 treesize of output 39 [2023-11-06 23:00:58,917 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 34 treesize of output 25 [2023-11-06 23:00:59,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,349 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 38 treesize of output 25 [2023-11-06 23:00:59,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,360 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:00:59,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 42 [2023-11-06 23:00:59,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,835 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:00:59,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 79 [2023-11-06 23:00:59,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,858 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 50 treesize of output 25 [2023-11-06 23:01:00,684 INFO L322 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2023-11-06 23:01:00,684 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 42 [2023-11-06 23:01:00,696 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:01:00,696 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 22 treesize of output 18 [2023-11-06 23:01:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:01:01,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:01:27,991 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:01:27,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2023-11-06 23:01:28,051 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:01:28,051 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 218 treesize of output 216 [2023-11-06 23:01:28,070 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:01:28,076 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 202 treesize of output 194 [2023-11-06 23:01:28,288 INFO L322 Elim1Store]: treesize reduction 46, result has 56.6 percent of original size [2023-11-06 23:01:28,289 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 6882 treesize of output 6693 [2023-11-06 23:01:29,539 INFO L322 Elim1Store]: treesize reduction 114, result has 66.8 percent of original size [2023-11-06 23:01:29,541 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 9 new quantified variables, introduced 21 case distinctions, treesize of input 22679 treesize of output 21828 [2023-11-06 23:01:31,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:01:31,298 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:01:31,314 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:01:32,386 INFO L322 Elim1Store]: treesize reduction 548, result has 24.4 percent of original size [2023-11-06 23:01:32,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 16324 treesize of output 15794 [2023-11-06 23:02:11,852 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