./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.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_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/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_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/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_cbc44504-4767-4ec8-9660-b408106732db/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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:33:48,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:33:48,719 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:33:48,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:33:48,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:33:48,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:33:48,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:33:48,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:33:48,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:33:48,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:33:48,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:33:48,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:33:48,780 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:33:48,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:33:48,782 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:33:48,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:33:48,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:33:48,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:33:48,784 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:33:48,785 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:33:48,785 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:33:48,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:33:48,786 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:33:48,787 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:33:48,787 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:33:48,788 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:33:48,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:33:48,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:33:48,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:33:48,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:48,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:33:48,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:33:48,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:33:48,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:33:48,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:33:48,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:33:48,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:33:48,794 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:33:48,794 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_cbc44504-4767-4ec8-9660-b408106732db/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_cbc44504-4767-4ec8-9660-b408106732db/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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2023-11-06 22:33:49,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:33:49,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:33:49,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:33:49,150 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:33:49,151 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:33:49,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-11-06 22:33:52,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:33:52,577 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:33:52,578 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-11-06 22:33:52,600 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/data/d29c800a1/d21d61de067c4e06b01b9edf21ccff49/FLAG8b1f2f682 [2023-11-06 22:33:52,620 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/data/d29c800a1/d21d61de067c4e06b01b9edf21ccff49 [2023-11-06 22:33:52,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:33:52,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:33:52,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:52,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:33:52,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:33:52,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:52" (1/1) ... [2023-11-06 22:33:52,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed72b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52, skipping insertion in model container [2023-11-06 22:33:52,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:52" (1/1) ... [2023-11-06 22:33:52,699 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:33:53,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:53,049 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:33:53,129 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:53,175 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:33:53,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53 WrapperNode [2023-11-06 22:33:53,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:53,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:53,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:33:53,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:33:53,187 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:33:53" (1/1) ... [2023-11-06 22:33:53,206 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:33:53" (1/1) ... [2023-11-06 22:33:53,239 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2023-11-06 22:33:53,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:53,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:33:53,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:33:53,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:33:53,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53" (1/1) ... [2023-11-06 22:33:53,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53" (1/1) ... [2023-11-06 22:33:53,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53" (1/1) ... [2023-11-06 22:33:53,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53" (1/1) ... [2023-11-06 22:33:53,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53" (1/1) ... [2023-11-06 22:33:53,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53" (1/1) ... [2023-11-06 22:33:53,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53" (1/1) ... [2023-11-06 22:33:53,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53" (1/1) ... [2023-11-06 22:33:53,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:33:53,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:33:53,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:33:53,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:33:53,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53" (1/1) ... [2023-11-06 22:33:53,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:53,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:33:53,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/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:33:53,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/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:33:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:33:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:33:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 22:33:53,371 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 22:33:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:33:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:33:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:33:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:33:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:33:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:33:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:33:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:33:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:33:53,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:33:53,501 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:33:53,502 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:33:53,832 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:33:53,847 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:33:53,847 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:33:53,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:53 BoogieIcfgContainer [2023-11-06 22:33:53,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:33:53,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:33:53,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:33:53,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:33:53,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:33:52" (1/3) ... [2023-11-06 22:33:53,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d391ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:53, skipping insertion in model container [2023-11-06 22:33:53,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:53" (2/3) ... [2023-11-06 22:33:53,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d391ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:53, skipping insertion in model container [2023-11-06 22:33:53,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:53" (3/3) ... [2023-11-06 22:33:53,862 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2023-11-06 22:33:53,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:33:53,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-11-06 22:33:53,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:33:53,963 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;@2e990146, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:33:53,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-06 22:33:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 50 states have (on average 1.88) internal successors, (94), 81 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:33:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 22:33:53,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:53,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:53,976 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:33:53,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:53,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1814089465, now seen corresponding path program 1 times [2023-11-06 22:33:54,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:54,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338809314] [2023-11-06 22:33:54,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:54,303 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:33:54,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338809314] [2023-11-06 22:33:54,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338809314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:54,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:54,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:33:54,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275598633] [2023-11-06 22:33:54,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:54,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:33:54,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:54,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:33:54,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:33:54,369 INFO L87 Difference]: Start difference. First operand has 85 states, 50 states have (on average 1.88) internal successors, (94), 81 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:33:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:54,515 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-11-06 22:33:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:33:54,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2023-11-06 22:33:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:54,527 INFO L225 Difference]: With dead ends: 82 [2023-11-06 22:33:54,527 INFO L226 Difference]: Without dead ends: 79 [2023-11-06 22:33:54,529 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:33:54,537 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:54,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:33:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-06 22:33:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-06 22:33:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:33:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-11-06 22:33:54,575 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 7 [2023-11-06 22:33:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:54,575 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-11-06 22:33:54,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:33:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-11-06 22:33:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 22:33:54,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:54,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:54,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:33:54,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:33:54,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1814089466, now seen corresponding path program 1 times [2023-11-06 22:33:54,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:54,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782009524] [2023-11-06 22:33:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:54,723 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:33:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782009524] [2023-11-06 22:33:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782009524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:54,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:54,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:33:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248396460] [2023-11-06 22:33:54,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:54,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:33:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:33:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:33:54,727 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:33:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:54,793 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2023-11-06 22:33:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:33:54,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2023-11-06 22:33:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:54,795 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:33:54,795 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:33:54,796 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:33:54,797 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:54,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:33:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:33:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-06 22:33:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:33:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-11-06 22:33:54,808 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2023-11-06 22:33:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:54,808 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-11-06 22:33:54,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:33:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-11-06 22:33:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:33:54,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:54,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:54,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:33:54,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:33:54,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1602420288, now seen corresponding path program 1 times [2023-11-06 22:33:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:54,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948334107] [2023-11-06 22:33:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:54,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:33:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:55,090 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:33:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948334107] [2023-11-06 22:33:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948334107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:55,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:55,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:33:55,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219733336] [2023-11-06 22:33:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:55,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:33:55,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:55,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:33:55,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:33:55,095 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:33:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:55,324 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2023-11-06 22:33:55,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:33:55,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-11-06 22:33:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:55,328 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:33:55,328 INFO L226 Difference]: Without dead ends: 79 [2023-11-06 22:33:55,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:33:55,354 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:55,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 296 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:33:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-06 22:33:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2023-11-06 22:33:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:33:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-11-06 22:33:55,364 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2023-11-06 22:33:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:55,364 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-11-06 22:33:55,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:33:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-11-06 22:33:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:33:55,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:55,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:55,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:33:55,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:33:55,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1602420289, now seen corresponding path program 1 times [2023-11-06 22:33:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:55,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478517657] [2023-11-06 22:33:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:33:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:55,687 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:33:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478517657] [2023-11-06 22:33:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478517657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:55,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:55,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:33:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539364060] [2023-11-06 22:33:55,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:55,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:33:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:33:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:33:55,691 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:33:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:55,878 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-11-06 22:33:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:33:55,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-11-06 22:33:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:55,880 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:33:55,880 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 22:33:55,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:33:55,882 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:55,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 312 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:33:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 22:33:55,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-11-06 22:33:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 71 states have internal predecessors, (77), 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:33:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-11-06 22:33:55,890 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 13 [2023-11-06 22:33:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:55,891 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-11-06 22:33:55,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:33:55,891 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-11-06 22:33:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:33:55,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:55,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:55,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:33:55,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:33:55,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1040217920, now seen corresponding path program 1 times [2023-11-06 22:33:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302671564] [2023-11-06 22:33:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:55,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:33:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:55,972 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:33:55,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302671564] [2023-11-06 22:33:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302671564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:55,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:33:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509503124] [2023-11-06 22:33:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:55,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:33:55,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:55,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:33:55,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:33:55,976 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:33:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:56,054 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-11-06 22:33:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:33:56,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2023-11-06 22:33:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:56,056 INFO L225 Difference]: With dead ends: 81 [2023-11-06 22:33:56,056 INFO L226 Difference]: Without dead ends: 81 [2023-11-06 22:33:56,057 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:33:56,058 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:56,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 189 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:33:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-06 22:33:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-11-06 22:33:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.625) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:33:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-11-06 22:33:56,066 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 15 [2023-11-06 22:33:56,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:56,066 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-11-06 22:33:56,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:33:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-11-06 22:33:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:33:56,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:56,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:56,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:33:56,069 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:33:56,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:56,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1052200126, now seen corresponding path program 1 times [2023-11-06 22:33:56,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:56,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329083938] [2023-11-06 22:33:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:56,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:33:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:33:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:33:56,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:56,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329083938] [2023-11-06 22:33:56,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329083938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:33:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241417213] [2023-11-06 22:33:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:56,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:33:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:33:56,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:33:56,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:33:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:56,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:33:56,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:33:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:56,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:33:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:33:56,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241417213] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:33:56,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:33:56,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-11-06 22:33:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407450487] [2023-11-06 22:33:56,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:33:56,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:33:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:56,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:33:56,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:33:56,576 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:33:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:56,676 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-11-06 22:33:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:33:56,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-11-06 22:33:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:56,678 INFO L225 Difference]: With dead ends: 82 [2023-11-06 22:33:56,678 INFO L226 Difference]: Without dead ends: 82 [2023-11-06 22:33:56,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:33:56,679 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:56,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 262 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:33:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-06 22:33:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-06 22:33:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 77 states have internal predecessors, (83), 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:33:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2023-11-06 22:33:56,687 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 28 [2023-11-06 22:33:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:56,687 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2023-11-06 22:33:56,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:33:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2023-11-06 22:33:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:33:56,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:56,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:56,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:33:56,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:33:56,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:33:56,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1845654912, now seen corresponding path program 2 times [2023-11-06 22:33:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:56,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324934926] [2023-11-06 22:33:56,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:56,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:33:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:57,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:33:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:57,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:33:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:33:57,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:57,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324934926] [2023-11-06 22:33:57,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324934926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:57,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:57,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:33:57,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822132389] [2023-11-06 22:33:57,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:57,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:33:57,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:57,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:33:57,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:33:57,585 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:33:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:57,777 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2023-11-06 22:33:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:33:57,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 41 [2023-11-06 22:33:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:57,779 INFO L225 Difference]: With dead ends: 90 [2023-11-06 22:33:57,779 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 22:33:57,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:33:57,781 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 76 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:57,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 162 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:33:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 22:33:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-11-06 22:33:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.490566037735849) internal successors, (79), 73 states have internal predecessors, (79), 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:33:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-11-06 22:33:57,787 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 41 [2023-11-06 22:33:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:57,788 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-11-06 22:33:57,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:33:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-11-06 22:33:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:33:57,789 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:57,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:57,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:33:57,790 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:33:57,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:57,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1845654911, now seen corresponding path program 1 times [2023-11-06 22:33:57,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:57,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715755704] [2023-11-06 22:33:57,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:57,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:33:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:58,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:33:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:58,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:33:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:33:58,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:58,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715755704] [2023-11-06 22:33:58,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715755704] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:33:58,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971708445] [2023-11-06 22:33:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:58,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:33:58,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:33:58,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:33:58,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:33:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:58,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:33:58,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:33:58,955 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:33:58,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 5 treesize of output 3 [2023-11-06 22:33:59,012 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-06 22:33:59,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:33:59,069 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:33:59,120 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:33:59,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:33:59,178 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:33:59,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:33:59,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:33:59,308 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:33:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:33:59,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:33:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971708445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:59,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:33:59,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2023-11-06 22:33:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318825493] [2023-11-06 22:33:59,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:59,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:33:59,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:59,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:33:59,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2023-11-06 22:33:59,319 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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:33:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:59,444 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2023-11-06 22:33:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:33:59,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 41 [2023-11-06 22:33:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:59,445 INFO L225 Difference]: With dead ends: 76 [2023-11-06 22:33:59,445 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 22:33:59,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2023-11-06 22:33:59,447 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 18 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:59,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 209 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2023-11-06 22:33:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 22:33:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-06 22:33:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 71 states have internal predecessors, (77), 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:33:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2023-11-06 22:33:59,452 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 41 [2023-11-06 22:33:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:59,453 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2023-11-06 22:33:59,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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:33:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2023-11-06 22:33:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 22:33:59,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:59,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:59,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:33:59,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:33:59,661 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:33:59,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash 265840289, now seen corresponding path program 1 times [2023-11-06 22:33:59,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:59,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554966549] [2023-11-06 22:33:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:59,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:00,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:00,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:34:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554966549] [2023-11-06 22:34:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554966549] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639318953] [2023-11-06 22:34:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:00,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:00,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:00,637 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:00,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:34:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:00,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-06 22:34:00,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:01,073 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 9 treesize of output 5 [2023-11-06 22:34:01,156 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |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:34:01,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:01,202 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:34:01,227 INFO L322 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-06 22:34:01,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-06 22:34:01,269 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:34:01,275 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:34:01,275 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:01,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639318953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:01,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:34:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 24 [2023-11-06 22:34:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678649364] [2023-11-06 22:34:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:01,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:34:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:34:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2023-11-06 22:34:01,277 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:34:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:01,831 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2023-11-06 22:34:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:34:01,832 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-11-06 22:34:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:01,833 INFO L225 Difference]: With dead ends: 100 [2023-11-06 22:34:01,833 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 22:34:01,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=743, Unknown=1, NotChecked=56, Total=930 [2023-11-06 22:34:01,834 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 123 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:01,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 348 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 450 Invalid, 0 Unknown, 105 Unchecked, 0.4s Time] [2023-11-06 22:34:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 22:34:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2023-11-06 22:34:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 73 states have internal predecessors, (81), 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:34:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-11-06 22:34:01,840 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 44 [2023-11-06 22:34:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:01,840 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-11-06 22:34:01,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:34:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-11-06 22:34:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 22:34:01,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:01,842 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:01,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:02,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:02,055 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:02,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:02,056 INFO L85 PathProgramCache]: Analyzing trace with hash 265840290, now seen corresponding path program 1 times [2023-11-06 22:34:02,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:02,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515314334] [2023-11-06 22:34:02,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:02,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:02,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:02,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:34:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:03,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515314334] [2023-11-06 22:34:03,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515314334] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:03,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752906339] [2023-11-06 22:34:03,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:03,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:03,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:03,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:03,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:34:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:03,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-06 22:34:03,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:04,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-06 22:34:04,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-06 22:34:04,228 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |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:34:04,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:04,294 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 26 [2023-11-06 22:34:04,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:04,304 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 24 treesize of output 19 [2023-11-06 22:34:04,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:04,322 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 26 [2023-11-06 22:34:04,340 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:34:04,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:34:04,411 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 23 treesize of output 15 [2023-11-06 22:34:04,415 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 28 treesize of output 16 [2023-11-06 22:34:04,495 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:34:04,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:04,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752906339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:04,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:34:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 27 [2023-11-06 22:34:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33359979] [2023-11-06 22:34:04,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:04,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:34:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:04,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:34:04,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=630, Unknown=1, NotChecked=50, Total=756 [2023-11-06 22:34:04,499 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:34:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:05,210 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2023-11-06 22:34:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:34:05,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-11-06 22:34:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:05,212 INFO L225 Difference]: With dead ends: 87 [2023-11-06 22:34:05,212 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 22:34:05,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=1005, Unknown=1, NotChecked=64, Total=1190 [2023-11-06 22:34:05,214 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 105 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:05,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 346 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 419 Invalid, 0 Unknown, 88 Unchecked, 0.4s Time] [2023-11-06 22:34:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 22:34:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2023-11-06 22:34:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 73 states have internal predecessors, (80), 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:34:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-06 22:34:05,219 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 44 [2023-11-06 22:34:05,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:05,219 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-06 22:34:05,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:34:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-06 22:34:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:34:05,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:05,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:05,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-06 22:34:05,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:34:05,440 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:05,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash -348887256, now seen corresponding path program 1 times [2023-11-06 22:34:05,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:05,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306565961] [2023-11-06 22:34:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:05,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:34:05,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:05,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306565961] [2023-11-06 22:34:05,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306565961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:05,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:05,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:34:05,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13870341] [2023-11-06 22:34:05,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:05,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:05,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:05,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:05,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:05,545 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:34:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:05,619 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2023-11-06 22:34:05,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:34:05,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 45 [2023-11-06 22:34:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:05,621 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:34:05,621 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 22:34:05,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:34:05,622 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:05,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 172 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:34:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 22:34:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2023-11-06 22:34:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 74 states have internal predecessors, (81), 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:34:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2023-11-06 22:34:05,626 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 45 [2023-11-06 22:34:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:05,627 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2023-11-06 22:34:05,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:34:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2023-11-06 22:34:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:34:05,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:05,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:34:05,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:34:05,629 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:05,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:05,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2069401941, now seen corresponding path program 1 times [2023-11-06 22:34:05,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:05,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697764592] [2023-11-06 22:34:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:05,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:05,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:05,821 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 22:34:05,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:05,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697764592] [2023-11-06 22:34:05,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697764592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:05,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:05,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:34:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345781009] [2023-11-06 22:34:05,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:05,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:34:05,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:05,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:34:05,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:34:05,824 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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:34:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:05,962 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-11-06 22:34:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:34:05,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 46 [2023-11-06 22:34:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:05,964 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:34:05,964 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 22:34:05,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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:34:05,965 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:05,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 251 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:34:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 22:34:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-06 22:34:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 73 states have internal predecessors, (80), 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:34:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-06 22:34:05,969 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 46 [2023-11-06 22:34:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:05,970 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-06 22:34:05,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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:34:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-06 22:34:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:34:05,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:05,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:34:05,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:34:05,971 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:05,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2069401942, now seen corresponding path program 1 times [2023-11-06 22:34:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:05,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343703914] [2023-11-06 22:34:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:05,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:06,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:06,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:34:06,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:06,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343703914] [2023-11-06 22:34:06,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343703914] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:06,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477810347] [2023-11-06 22:34:06,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:06,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:06,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:06,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:06,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:34:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:06,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:34:06,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:34:06,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477810347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:06,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:34:06,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-06 22:34:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775276797] [2023-11-06 22:34:06,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:06,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:06,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:06,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:34:06,468 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:34:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:06,495 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2023-11-06 22:34:06,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:34:06,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) Word has length 46 [2023-11-06 22:34:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:06,496 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:34:06,496 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:34:06,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:34:06,498 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 60 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:06,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 138 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:34:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-06 22:34:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 72 states have internal predecessors, (78), 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:34:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2023-11-06 22:34:06,503 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 46 [2023-11-06 22:34:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:06,504 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2023-11-06 22:34:06,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:34:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2023-11-06 22:34:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 22:34:06,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:06,508 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:06,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-06 22:34:06,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:34:06,714 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:06,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash -271631443, now seen corresponding path program 1 times [2023-11-06 22:34:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:06,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524048140] [2023-11-06 22:34:06,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:06,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:06,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:06,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:34:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524048140] [2023-11-06 22:34:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524048140] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:06,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720649381] [2023-11-06 22:34:06,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:06,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:06,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:06,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:06,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:34:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:07,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:34:07,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:34:07,242 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:07,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720649381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:07,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:34:07,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-11-06 22:34:07,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564360430] [2023-11-06 22:34:07,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:07,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:34:07,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:07,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:34:07,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:34:07,245 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:34:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:07,274 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2023-11-06 22:34:07,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:34:07,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 47 [2023-11-06 22:34:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:07,276 INFO L225 Difference]: With dead ends: 74 [2023-11-06 22:34:07,276 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 22:34:07,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:34:07,277 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 62 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:07,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 183 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 22:34:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-06 22:34:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 69 states have internal predecessors, (74), 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:34:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-11-06 22:34:07,281 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 47 [2023-11-06 22:34:07,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:07,282 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-11-06 22:34:07,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:34:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-11-06 22:34:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:34:07,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:07,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:34:07,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:07,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:34:07,494 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:07,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash 169358236, now seen corresponding path program 1 times [2023-11-06 22:34:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:07,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703243591] [2023-11-06 22:34:07,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:07,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:07,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:34:07,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:07,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703243591] [2023-11-06 22:34:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703243591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:07,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:07,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:34:07,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028458568] [2023-11-06 22:34:07,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:07,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:34:07,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:07,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:34:07,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:34:07,606 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:34:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:07,701 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2023-11-06 22:34:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:34:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-11-06 22:34:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:07,702 INFO L225 Difference]: With dead ends: 73 [2023-11-06 22:34:07,702 INFO L226 Difference]: Without dead ends: 73 [2023-11-06 22:34:07,702 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:34:07,703 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:07,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 176 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:34:07,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-06 22:34:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-06 22:34:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 68 states have internal predecessors, (73), 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:34:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2023-11-06 22:34:07,706 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 48 [2023-11-06 22:34:07,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:07,707 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2023-11-06 22:34:07,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:34:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2023-11-06 22:34:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:34:07,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:07,708 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:34:07,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:34:07,709 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:07,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash 169358237, now seen corresponding path program 1 times [2023-11-06 22:34:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204432542] [2023-11-06 22:34:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:07,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:07,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:34:07,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204432542] [2023-11-06 22:34:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204432542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:07,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:07,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:34:07,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231671316] [2023-11-06 22:34:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:07,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:34:07,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:07,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:34:07,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:34:07,877 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:34:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:07,981 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2023-11-06 22:34:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:34:07,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2023-11-06 22:34:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:07,983 INFO L225 Difference]: With dead ends: 72 [2023-11-06 22:34:07,983 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 22:34:07,983 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:34:07,984 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:07,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 178 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:34:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 22:34:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-06 22:34:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 67 states have internal predecessors, (72), 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:34:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2023-11-06 22:34:07,988 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 48 [2023-11-06 22:34:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:07,988 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2023-11-06 22:34:07,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:34:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2023-11-06 22:34:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-06 22:34:07,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:07,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:07,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:34:07,990 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:07,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:07,991 INFO L85 PathProgramCache]: Analyzing trace with hash 955138050, now seen corresponding path program 1 times [2023-11-06 22:34:07,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:07,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111496825] [2023-11-06 22:34:07,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:07,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:08,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:34:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111496825] [2023-11-06 22:34:08,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111496825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:08,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:08,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:34:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341807057] [2023-11-06 22:34:08,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:08,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:34:08,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:08,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:34:08,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:34:08,287 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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:34:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:08,422 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2023-11-06 22:34:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:34:08,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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 49 [2023-11-06 22:34:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:08,424 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:34:08,424 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 22:34:08,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:34:08,425 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:08,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 251 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:34:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 22:34:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-06 22:34:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 66 states have internal predecessors, (71), 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:34:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2023-11-06 22:34:08,428 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 49 [2023-11-06 22:34:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:08,429 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2023-11-06 22:34:08,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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:34:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2023-11-06 22:34:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 22:34:08,430 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:08,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:08,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:34:08,430 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:08,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1235335197, now seen corresponding path program 1 times [2023-11-06 22:34:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:08,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103644554] [2023-11-06 22:34:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:08,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 22:34:08,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:08,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103644554] [2023-11-06 22:34:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103644554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:08,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:08,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:34:08,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122578142] [2023-11-06 22:34:08,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:08,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:34:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:08,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:34:08,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:34:08,677 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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:34:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:08,773 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2023-11-06 22:34:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:34:08,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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) Word has length 51 [2023-11-06 22:34:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:08,774 INFO L225 Difference]: With dead ends: 69 [2023-11-06 22:34:08,774 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 22:34:08,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:34:08,775 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 47 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:08,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 185 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:34:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 22:34:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-06 22:34:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 64 states have internal predecessors, (69), 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:34:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-11-06 22:34:08,779 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 51 [2023-11-06 22:34:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:08,779 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-11-06 22:34:08,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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:34:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-11-06 22:34:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 22:34:08,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:08,781 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:08,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:34:08,781 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:08,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1703912836, now seen corresponding path program 1 times [2023-11-06 22:34:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408162122] [2023-11-06 22:34:08,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:08,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:09,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:09,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:34:09,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:09,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408162122] [2023-11-06 22:34:09,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408162122] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:09,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479031770] [2023-11-06 22:34:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:09,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:09,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:09,861 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:09,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:34:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:10,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-06 22:34:10,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:10,341 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 9 treesize of output 5 [2023-11-06 22:34:10,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:10,537 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:34:10,556 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 22:34:10,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-06 22:34:10,765 INFO L322 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-11-06 22:34:10,766 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2023-11-06 22:34:10,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:10,906 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 22:34:10,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 36 [2023-11-06 22:34:10,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:34:11,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:34:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:34:11,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:11,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479031770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:11,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:34:11,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [23] total 35 [2023-11-06 22:34:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151229719] [2023-11-06 22:34:11,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:11,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:34:11,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:11,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:34:11,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2023-11-06 22:34:11,051 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:34:13,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:34:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:13,895 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2023-11-06 22:34:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:34:13,896 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2023-11-06 22:34:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:13,897 INFO L225 Difference]: With dead ends: 103 [2023-11-06 22:34:13,897 INFO L226 Difference]: Without dead ends: 103 [2023-11-06 22:34:13,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=167, Invalid=1995, Unknown=0, NotChecked=0, Total=2162 [2023-11-06 22:34:13,899 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 220 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:13,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 392 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 541 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2023-11-06 22:34:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-06 22:34:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 70. [2023-11-06 22:34:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 65 states have internal predecessors, (72), 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:34:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2023-11-06 22:34:13,902 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 54 [2023-11-06 22:34:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:13,903 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2023-11-06 22:34:13,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:34:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2023-11-06 22:34:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 22:34:13,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:13,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:13,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:14,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:14,117 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:14,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:14,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1703912837, now seen corresponding path program 1 times [2023-11-06 22:34:14,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:14,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278060770] [2023-11-06 22:34:14,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:14,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:15,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:15,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:34:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:15,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278060770] [2023-11-06 22:34:15,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278060770] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:15,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439434753] [2023-11-06 22:34:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:15,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:15,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:15,882 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:15,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:34:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:16,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-06 22:34:16,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:16,648 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 9 treesize of output 5 [2023-11-06 22:34:16,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:34:16,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:16,826 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:34:16,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:16,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:34:17,414 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:34:17,415 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 51 treesize of output 46 [2023-11-06 22:34:17,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:17,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:34:17,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:17,510 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:34:17,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:17,515 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 20 [2023-11-06 22:34:17,602 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 26 treesize of output 14 [2023-11-06 22:34:17,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:34:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:34:17,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:34:17,811 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2072 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2071 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2071) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-11-06 22:34:18,070 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:34:18,071 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 51 treesize of output 55 [2023-11-06 22:34:18,115 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_prenex_2) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 1))) (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2070 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2070) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2071) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2069 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2069) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-11-06 22:34:18,134 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_prenex_2) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 1))) (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2069 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2069) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2072) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2070 (Array Int Int))) (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2070) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2071) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-11-06 22:34:18,788 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14|)) (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_2080) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) v_prenex_2) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_2079) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 1))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14|)) (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2080 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_2080) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2070) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_2071) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| Int)) (or (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2069 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_2080) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) v_ArrVal_2069) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14| v_ArrVal_2072) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< |c_#StackHeapBarrier| (+ 1 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_14|))))) is different from false [2023-11-06 22:34:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439434753] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:18,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:34:18,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 39 [2023-11-06 22:34:18,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516842844] [2023-11-06 22:34:18,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:34:18,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-06 22:34:18,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:18,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-06 22:34:18,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1979, Unknown=45, NotChecked=372, Total=2550 [2023-11-06 22:34:18,797 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 40 states, 37 states have (on average 2.081081081081081) internal successors, (77), 34 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:34:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:20,859 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2023-11-06 22:34:20,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:34:20,860 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.081081081081081) internal successors, (77), 34 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2023-11-06 22:34:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:20,861 INFO L225 Difference]: With dead ends: 127 [2023-11-06 22:34:20,861 INFO L226 Difference]: Without dead ends: 127 [2023-11-06 22:34:20,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=394, Invalid=3997, Unknown=47, NotChecked=532, Total=4970 [2023-11-06 22:34:20,864 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 277 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:20,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 786 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:34:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-06 22:34:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 78. [2023-11-06 22:34:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.265625) internal successors, (81), 73 states have internal predecessors, (81), 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:34:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-11-06 22:34:20,871 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 54 [2023-11-06 22:34:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:20,871 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-11-06 22:34:20,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.081081081081081) internal successors, (77), 34 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:34:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-11-06 22:34:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 22:34:20,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:20,877 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:20,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:21,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:21,078 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:21,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1970581029, now seen corresponding path program 1 times [2023-11-06 22:34:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210484913] [2023-11-06 22:34:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:21,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:21,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:21,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:34:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210484913] [2023-11-06 22:34:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210484913] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:21,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685546582] [2023-11-06 22:34:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:21,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:21,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:21,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:34:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:21,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:34:21,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:21,705 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:34:21,723 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|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-11-06 22:34:21,748 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:34:21,788 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:34:21,831 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:34:21,837 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:34:21,859 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:34:21,859 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:34:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:34:21,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:34:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:34:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685546582] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:34:22,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:34:22,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2023-11-06 22:34:22,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081345578] [2023-11-06 22:34:22,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:34:22,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:34:22,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:22,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:34:22,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=157, Unknown=1, NotChecked=26, Total=240 [2023-11-06 22:34:22,283 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:34:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:22,440 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2023-11-06 22:34:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:34:22,440 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2023-11-06 22:34:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:22,441 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:34:22,441 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 22:34:22,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=245, Unknown=1, NotChecked=34, Total=380 [2023-11-06 22:34:22,442 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 135 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:22,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 181 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 131 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2023-11-06 22:34:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 22:34:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-06 22:34:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 66 states have internal predecessors, (71), 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:34:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2023-11-06 22:34:22,446 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 54 [2023-11-06 22:34:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:22,446 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2023-11-06 22:34:22,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:34:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2023-11-06 22:34:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-06 22:34:22,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:22,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:22,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-06 22:34:22,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:22,652 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:22,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:22,653 INFO L85 PathProgramCache]: Analyzing trace with hash -952420248, now seen corresponding path program 1 times [2023-11-06 22:34:22,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:22,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107295023] [2023-11-06 22:34:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:22,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:23,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:34:23,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:23,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107295023] [2023-11-06 22:34:23,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107295023] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202637161] [2023-11-06 22:34:23,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:23,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:23,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:23,661 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:23,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:34:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:23,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-06 22:34:23,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:24,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-06 22:34:24,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:24,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 22:34:24,585 INFO L322 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-11-06 22:34:24,586 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2023-11-06 22:34:24,680 INFO L322 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-11-06 22:34:24,680 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 56 [2023-11-06 22:34:24,687 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 10 [2023-11-06 22:34:24,701 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:34:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:34:24,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:24,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202637161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:24,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:34:24,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [23] total 37 [2023-11-06 22:34:24,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391996941] [2023-11-06 22:34:24,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:24,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 22:34:24,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:24,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 22:34:24,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1211, Unknown=0, NotChecked=0, Total=1332 [2023-11-06 22:34:24,710 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 17 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:34:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:25,293 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2023-11-06 22:34:25,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:34:25,294 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 17 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2023-11-06 22:34:25,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:25,295 INFO L225 Difference]: With dead ends: 76 [2023-11-06 22:34:25,295 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 22:34:25,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=1964, Unknown=0, NotChecked=0, Total=2162 [2023-11-06 22:34:25,297 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 212 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:25,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 408 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:34:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 22:34:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2023-11-06 22:34:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 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:34:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2023-11-06 22:34:25,300 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 57 [2023-11-06 22:34:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:25,301 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2023-11-06 22:34:25,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 17 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:34:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2023-11-06 22:34:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:34:25,302 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:25,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:34:25,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:25,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:25,509 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:25,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash 797430422, now seen corresponding path program 1 times [2023-11-06 22:34:25,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:25,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18522175] [2023-11-06 22:34:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:27,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:34:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:27,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18522175] [2023-11-06 22:34:27,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18522175] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:27,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321298301] [2023-11-06 22:34:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:27,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:27,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:27,912 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:27,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:34:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:28,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-06 22:34:28,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:28,810 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 19 treesize of output 11 [2023-11-06 22:34:28,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:34:28,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:34:29,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:29,170 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:34:29,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:29,178 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 20 [2023-11-06 22:34:29,189 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:34:29,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:34:29,863 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2023-11-06 22:34:29,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:29,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-11-06 22:34:30,029 INFO L322 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-06 22:34:30,029 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 80 [2023-11-06 22:34:30,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:30,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:30,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-11-06 22:34:30,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:30,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-06 22:34:30,448 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:34:30,449 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 26 [2023-11-06 22:34:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:34:30,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:34:30,777 INFO L322 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2023-11-06 22:34:30,778 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 35 treesize of output 34 [2023-11-06 22:34:30,966 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2642 (Array Int Int)) (v_ArrVal_2641 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2642))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse2 4))) (< .cse2 0))))) is different from false [2023-11-06 22:34:31,224 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2642 (Array Int Int)) (v_ArrVal_2641 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset| 4))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse0 0) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2642))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4))))))) is different from false [2023-11-06 22:34:31,244 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2642 (Array Int Int)) (v_ArrVal_2641 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2642))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse3 4))) (< .cse3 0))))) is different from false [2023-11-06 22:34:31,261 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2642 (Array Int Int)) (v_ArrVal_2641 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse0 0) (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2642))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4))))))) is different from false [2023-11-06 22:34:31,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321298301] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:31,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:34:31,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 51 [2023-11-06 22:34:31,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676375178] [2023-11-06 22:34:31,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:34:31,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-06 22:34:31,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:31,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-06 22:34:31,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3021, Unknown=18, NotChecked=452, Total=3660 [2023-11-06 22:34:31,663 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 52 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 46 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:34:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:35,425 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2023-11-06 22:34:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 22:34:35,425 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 46 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2023-11-06 22:34:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:35,426 INFO L225 Difference]: With dead ends: 110 [2023-11-06 22:34:35,426 INFO L226 Difference]: Without dead ends: 110 [2023-11-06 22:34:35,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=396, Invalid=5764, Unknown=18, NotChecked=628, Total=6806 [2023-11-06 22:34:35,429 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 313 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:35,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 938 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:34:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-06 22:34:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2023-11-06 22:34:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 69 states have internal predecessors, (76), 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:34:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-11-06 22:34:35,433 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 59 [2023-11-06 22:34:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:35,434 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-11-06 22:34:35,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 46 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:34:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-11-06 22:34:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:34:35,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:35,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:34:35,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:35,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:35,642 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:35,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash 797430423, now seen corresponding path program 1 times [2023-11-06 22:34:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480511857] [2023-11-06 22:34:35,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:35,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:34:38,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:38,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480511857] [2023-11-06 22:34:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480511857] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:38,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621242598] [2023-11-06 22:34:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:38,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:38,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:38,562 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:38,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:34:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:38,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-06 22:34:38,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:39,518 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 19 treesize of output 11 [2023-11-06 22:34:39,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:34:39,527 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:34:39,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:39,910 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:34:39,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:39,925 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 20 [2023-11-06 22:34:39,942 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:34:39,943 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:34:40,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2023-11-06 22:34:40,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:40,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-11-06 22:34:40,746 INFO L322 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-06 22:34:40,746 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 80 [2023-11-06 22:34:40,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:40,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:40,757 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-11-06 22:34:41,213 INFO L322 Elim1Store]: treesize reduction 15, result has 34.8 percent of original size [2023-11-06 22:34:41,213 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 50 [2023-11-06 22:34:41,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:41,226 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:34:41,227 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2023-11-06 22:34:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:34:41,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:34:42,503 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:34:42,504 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 97 treesize of output 101 [2023-11-06 22:34:42,628 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2837 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_18| Int)) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2837))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_18| 4)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (forall ((v_ArrVal_2838 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2838) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_18|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_18| 0))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_7))) (or (< (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_9) (< v_prenex_9 0) (< 0 (+ 5 (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ v_prenex_9 4))))))) (forall ((v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2837 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_18| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2838))) (or (< (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_18|) (< (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2837) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_18| 4)) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 1)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_18| 0))))) is different from false [2023-11-06 22:34:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621242598] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:46,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:34:46,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27] total 59 [2023-11-06 22:34:46,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488158] [2023-11-06 22:34:46,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:34:46,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-11-06 22:34:46,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:46,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-06 22:34:46,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=5008, Unknown=10, NotChecked=142, Total=5402 [2023-11-06 22:34:46,301 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 60 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 53 states have internal predecessors, (103), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 22:34:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:51,164 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2023-11-06 22:34:51,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 22:34:51,164 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 53 states have internal predecessors, (103), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 59 [2023-11-06 22:34:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:51,165 INFO L225 Difference]: With dead ends: 102 [2023-11-06 22:34:51,165 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 22:34:51,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2221 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=537, Invalid=8963, Unknown=10, NotChecked=192, Total=9702 [2023-11-06 22:34:51,170 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 343 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:51,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1160 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 22:34:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 22:34:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2023-11-06 22:34:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 71 states have internal predecessors, (77), 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:34:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2023-11-06 22:34:51,174 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 59 [2023-11-06 22:34:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:51,175 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2023-11-06 22:34:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 53 states have internal predecessors, (103), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 22:34:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2023-11-06 22:34:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:34:51,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:51,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:51,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:51,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 22:34:51,383 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:51,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1049471444, now seen corresponding path program 1 times [2023-11-06 22:34:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:51,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416798688] [2023-11-06 22:34:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:52,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:34:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:34:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:53,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:34:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:34:53,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:53,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416798688] [2023-11-06 22:34:53,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416798688] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:53,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465231772] [2023-11-06 22:34:53,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:53,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:34:53,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:53,970 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:34:53,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:34:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:54,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-06 22:34:54,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:54,414 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:34:54,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 22:34:55,163 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-06 22:34:55,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:34:55,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:34:55,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:34:55,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:55,444 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 20 treesize of output 15 [2023-11-06 22:34:55,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:55,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-11-06 22:34:55,472 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:34:55,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:34:55,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:55,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:34:56,220 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:34:56,220 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 88 treesize of output 75 [2023-11-06 22:34:56,226 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-06 22:34:56,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:56,234 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:34:56,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:56,339 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 28 [2023-11-06 22:34:56,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:34:56,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:34:56,354 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 20 treesize of output 15 [2023-11-06 22:34:56,443 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 28 treesize of output 16 [2023-11-06 22:34:56,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:34:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:34:56,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:34:56,664 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3037 (Array Int Int)) (v_ArrVal_3038 (Array Int Int)) (v_ArrVal_3039 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3039) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-11-06 22:34:56,684 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3037 (Array Int Int)) (v_ArrVal_3038 (Array Int Int)) (v_ArrVal_3039 (Array Int Int))) (or (not (= v_ArrVal_3034 (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_3034 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_3034) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3039) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_3035) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_3036) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-11-06 22:34:56,746 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3037 (Array Int Int)) (v_ArrVal_3038 (Array Int Int)) (v_ArrVal_3039 (Array Int Int))) (or (not (= v_ArrVal_3034 (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_3034 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_3034) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3039) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_3035) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_3036) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-11-06 22:34:56,760 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3037 (Array Int Int)) (v_ArrVal_3038 (Array Int Int)) (v_ArrVal_3039 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse0 (select v_ArrVal_3034 .cse0))) v_ArrVal_3034)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_3034) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3039) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_3035) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_3036) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-11-06 22:34:56,775 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3037 (Array Int Int)) (v_ArrVal_3038 (Array Int Int)) (v_ArrVal_3039 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3034) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3039) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3035) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3036) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_3034 (let ((.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_3034 .cse1)))))))) is different from false [2023-11-06 22:34:56,791 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3037 (Array Int Int)) (v_ArrVal_3038 (Array Int Int)) (v_ArrVal_3039 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= v_ArrVal_3034 (let ((.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_3034 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3034) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_3039) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3035) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_3037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3036) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-06 22:34:56,923 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_31| Int) (v_ArrVal_3034 (Array Int Int)) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3037 (Array Int Int)) (v_ArrVal_3049 (Array Int Int)) (v_ArrVal_3038 (Array Int Int)) (v_ArrVal_3039 (Array Int Int)) (v_ArrVal_3050 (Array Int Int)) (v_ArrVal_3051 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_31| v_ArrVal_3049) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (let ((.cse1 (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_31| v_ArrVal_3051) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_31| v_ArrVal_3050) .cse0) .cse1 (select v_ArrVal_3034 .cse1))) v_ArrVal_3034)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_31|))) (< |c_#StackHeapBarrier| (+ 1 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_31|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3034) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_31| v_ArrVal_3039) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3035) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_31| v_ArrVal_3037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3036) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_31| v_ArrVal_3038) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-06 22:34:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465231772] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:34:56,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:34:56,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2023-11-06 22:34:56,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789957504] [2023-11-06 22:34:56,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:34:56,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-06 22:34:56,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:56,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-06 22:34:56,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2023, Unknown=7, NotChecked=672, Total=2862 [2023-11-06 22:34:56,930 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 47 states, 45 states have (on average 2.066666666666667) internal successors, (93), 41 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:34:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:58,912 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2023-11-06 22:34:58,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:34:58,913 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.066666666666667) internal successors, (93), 41 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2023-11-06 22:34:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:58,914 INFO L225 Difference]: With dead ends: 76 [2023-11-06 22:34:58,914 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 22:34:58,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=305, Invalid=3748, Unknown=7, NotChecked=910, Total=4970 [2023-11-06 22:34:58,917 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 81 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:58,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 802 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:34:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 22:34:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-06 22:34:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 71 states have internal predecessors, (76), 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:34:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-11-06 22:34:58,921 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 60 [2023-11-06 22:34:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:58,921 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-11-06 22:34:58,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.066666666666667) internal successors, (93), 41 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 22:34:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-11-06 22:34:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:34:58,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:58,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:58,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-06 22:34:59,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 22:34:59,130 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 22:34:59,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:59,130 INFO L85 PathProgramCache]: Analyzing trace with hash 784341526, now seen corresponding path program 1 times [2023-11-06 22:34:59,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:59,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531960321] [2023-11-06 22:34:59,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:59,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:00,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:00,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:35:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:01,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:35:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:35:01,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531960321] [2023-11-06 22:35:01,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531960321] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:35:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49687235] [2023-11-06 22:35:01,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:01,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:35:01,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:01,542 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:35:01,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cbc44504-4767-4ec8-9660-b408106732db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:35:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:01,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-06 22:35:01,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:02,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:35:02,603 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 22:35:02,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-11-06 22:35:02,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:35:02,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:35:02,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:35:03,006 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:35:03,007 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2023-11-06 22:35:03,021 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:35:03,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:35:03,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:35:03,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:35:03,824 INFO L322 Elim1Store]: treesize reduction 46, result has 56.2 percent of original size [2023-11-06 22:35:03,825 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 91 [2023-11-06 22:35:03,847 INFO L322 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-06 22:35:03,848 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 21 treesize of output 20 [2023-11-06 22:35:04,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:35:04,657 INFO L322 Elim1Store]: treesize reduction 152, result has 46.7 percent of original size [2023-11-06 22:35:04,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 242 treesize of output 277 [2023-11-06 22:35:04,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:35:04,763 INFO L322 Elim1Store]: treesize reduction 72, result has 48.6 percent of original size [2023-11-06 22:35:04,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 198 treesize of output 250 [2023-11-06 22:35:16,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,684 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,747 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,782 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,867 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,933 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:20,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,066 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,142 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,599 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,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 7 treesize of output 3 [2023-11-06 22:37:21,694 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,715 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,731 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,746 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,775 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,790 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,812 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,827 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,843 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,859 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:21,907 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:21,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:23,534 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:23,570 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:23,589 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:23,610 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:23,625 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:23,664 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:23,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:23,814 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:23,846 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:23,902 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:23,936 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:23,975 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,006 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,035 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,058 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,074 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,089 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,105 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,121 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,188 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:24,276 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,315 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:24,354 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:24,373 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:24,433 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:25,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,296 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,474 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,589 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,639 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,687 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,752 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:25,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 7 treesize of output 3 [2023-11-06 22:37:26,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,138 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,187 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,324 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,380 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,512 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:37:26,536 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:37:26,656 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3