./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ --witnessprinter.witness.filename witness --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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:39:40,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:39:40,508 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 21:39:40,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:39:40,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:39:40,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:39:40,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:39:40,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:39:40,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:39:40,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:39:40,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:39:40,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:39:40,547 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:39:40,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:39:40,548 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:39:40,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:39:40,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:39:40,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:39:40,551 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:39:40,551 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:39:40,552 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:39:40,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:39:40,553 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:39:40,554 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:39:40,554 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:39:40,556 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:39:40,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:39:40,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:39:40,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:39:40,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:39:40,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:39:40,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:39:40,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:39:40,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:39:40,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:39:40,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:39:40,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:39:40,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:39:40,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:39:40,573 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_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/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_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2023-11-23 21:39:40,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:39:40,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:39:40,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:39:40,949 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:39:40,950 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:39:40,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/heap-manipulation/dancing.i [2023-11-23 21:39:44,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:39:44,278 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:39:44,279 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/sv-benchmarks/c/heap-manipulation/dancing.i [2023-11-23 21:39:44,311 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/data/b59cff289/2de1618f87714ee89c0c91f0f4c72248/FLAGe34ce5ffc [2023-11-23 21:39:44,327 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/data/b59cff289/2de1618f87714ee89c0c91f0f4c72248 [2023-11-23 21:39:44,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:39:44,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:39:44,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:39:44,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:39:44,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:39:44,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:44,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6aa9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44, skipping insertion in model container [2023-11-23 21:39:44,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:44,403 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:39:44,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:39:44,816 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:39:44,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:39:44,906 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:39:44,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44 WrapperNode [2023-11-23 21:39:44,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:39:44,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:39:44,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:39:44,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:39:44,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:44,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:44,985 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 101 [2023-11-23 21:39:44,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:39:44,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:39:44,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:39:44,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:39:44,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:44,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:45,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:45,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:45,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:45,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:45,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:45,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:45,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:39:45,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:39:45,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:39:45,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:39:45,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (1/1) ... [2023-11-23 21:39:45,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:39:45,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:39:45,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:39:45,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:39:45,129 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2023-11-23 21:39:45,130 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2023-11-23 21:39:45,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 21:39:45,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 21:39:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 21:39:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:39:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:39:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 21:39:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 21:39:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:39:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:39:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:39:45,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:39:45,326 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:39:45,338 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:39:45,802 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:39:45,886 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:39:45,886 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 21:39:45,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:45 BoogieIcfgContainer [2023-11-23 21:39:45,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:39:45,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:39:45,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:39:45,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:39:45,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:39:44" (1/3) ... [2023-11-23 21:39:45,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8ca499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:39:45, skipping insertion in model container [2023-11-23 21:39:45,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:44" (2/3) ... [2023-11-23 21:39:45,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8ca499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:39:45, skipping insertion in model container [2023-11-23 21:39:45,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:45" (3/3) ... [2023-11-23 21:39:45,895 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2023-11-23 21:39:45,938 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:39:45,938 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-23 21:39:46,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:39:46,017 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;@20fec46a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:39:46,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2023-11-23 21:39:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 96 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 21:39:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 21:39:46,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:46,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 21:39:46,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:46,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash 7134, now seen corresponding path program 1 times [2023-11-23 21:39:46,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:46,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124764240] [2023-11-23 21:39:46,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:46,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,323 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-23 21:39:46,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:46,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124764240] [2023-11-23 21:39:46,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124764240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:46,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:46,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:39:46,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505352230] [2023-11-23 21:39:46,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:46,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:46,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:46,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:46,396 INFO L87 Difference]: Start difference. First operand has 105 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 96 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:46,591 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2023-11-23 21:39:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 21:39:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:46,606 INFO L225 Difference]: With dead ends: 102 [2023-11-23 21:39:46,606 INFO L226 Difference]: Without dead ends: 101 [2023-11-23 21:39:46,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-23 21:39:46,615 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 79 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:46,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 87 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:39:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-23 21:39:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-23 21:39:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 51 states have (on average 2.0) internal successors, (102), 92 states have internal predecessors, (102), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 21:39:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2023-11-23 21:39:46,675 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 2 [2023-11-23 21:39:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:46,675 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2023-11-23 21:39:46,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2023-11-23 21:39:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 21:39:46,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:46,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 21:39:46,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:39:46,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:46,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:46,677 INFO L85 PathProgramCache]: Analyzing trace with hash 7135, now seen corresponding path program 1 times [2023-11-23 21:39:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:46,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137773777] [2023-11-23 21:39:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:46,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:46,798 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-23 21:39:46,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:46,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137773777] [2023-11-23 21:39:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137773777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:46,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:39:46,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565847136] [2023-11-23 21:39:46,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:46,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:46,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:46,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:46,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:46,803 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:46,942 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2023-11-23 21:39:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:46,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 21:39:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:46,945 INFO L225 Difference]: With dead ends: 99 [2023-11-23 21:39:46,945 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 21:39:46,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-23 21:39:46,947 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 77 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:46,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 88 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:39:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 21:39:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-23 21:39:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 90 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 21:39:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2023-11-23 21:39:46,973 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 2 [2023-11-23 21:39:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:46,974 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2023-11-23 21:39:46,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2023-11-23 21:39:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 21:39:46,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:46,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:46,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:39:46,975 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:46,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:46,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1768943990, now seen corresponding path program 1 times [2023-11-23 21:39:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:46,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820044252] [2023-11-23 21:39:46,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:46,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:47,095 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-23 21:39:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820044252] [2023-11-23 21:39:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820044252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:39:47,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757939310] [2023-11-23 21:39:47,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:47,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:47,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:47,099 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:47,270 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2023-11-23 21:39:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:47,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-23 21:39:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:47,273 INFO L225 Difference]: With dead ends: 157 [2023-11-23 21:39:47,274 INFO L226 Difference]: Without dead ends: 157 [2023-11-23 21:39:47,274 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-23 21:39:47,276 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 69 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:47,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 194 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-23 21:39:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 97. [2023-11-23 21:39:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 88 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 21:39:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2023-11-23 21:39:47,289 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 7 [2023-11-23 21:39:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:47,289 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2023-11-23 21:39:47,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2023-11-23 21:39:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 21:39:47,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:47,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:47,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:39:47,292 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:47,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1768943989, now seen corresponding path program 1 times [2023-11-23 21:39:47,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:47,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218361455] [2023-11-23 21:39:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:47,431 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-23 21:39:47,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:47,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218361455] [2023-11-23 21:39:47,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218361455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:47,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:47,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:39:47,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485958962] [2023-11-23 21:39:47,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:47,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:47,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:47,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:47,434 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:47,686 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2023-11-23 21:39:47,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:47,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-23 21:39:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:47,689 INFO L225 Difference]: With dead ends: 157 [2023-11-23 21:39:47,689 INFO L226 Difference]: Without dead ends: 157 [2023-11-23 21:39:47,689 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-23 21:39:47,690 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 69 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:47,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 198 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-23 21:39:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 95. [2023-11-23 21:39:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 86 states have internal predecessors, (96), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 21:39:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2023-11-23 21:39:47,701 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 7 [2023-11-23 21:39:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:47,701 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2023-11-23 21:39:47,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2023-11-23 21:39:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 21:39:47,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:47,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:47,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:39:47,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:47,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 854792323, now seen corresponding path program 1 times [2023-11-23 21:39:47,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:47,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333736287] [2023-11-23 21:39:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:47,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:47,828 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-23 21:39:47,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333736287] [2023-11-23 21:39:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333736287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:47,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:47,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:39:47,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266320656] [2023-11-23 21:39:47,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:47,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:39:47,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:47,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:39:47,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:39:47,836 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-23 21:39:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:47,959 INFO L93 Difference]: Finished difference Result 171 states and 199 transitions. [2023-11-23 21:39:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:39:47,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2023-11-23 21:39:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:47,963 INFO L225 Difference]: With dead ends: 171 [2023-11-23 21:39:47,963 INFO L226 Difference]: Without dead ends: 171 [2023-11-23 21:39:47,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-23 21:39:47,966 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 75 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:47,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 358 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:39:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-23 21:39:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 137. [2023-11-23 21:39:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 88 states have (on average 1.9431818181818181) internal successors, (171), 124 states have internal predecessors, (171), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-23 21:39:47,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 191 transitions. [2023-11-23 21:39:47,999 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 191 transitions. Word has length 9 [2023-11-23 21:39:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:48,000 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 191 transitions. [2023-11-23 21:39:48,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-23 21:39:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 191 transitions. [2023-11-23 21:39:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 21:39:48,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:48,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:48,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:39:48,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:48,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash 851874765, now seen corresponding path program 1 times [2023-11-23 21:39:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:48,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485429484] [2023-11-23 21:39:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:48,224 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-23 21:39:48,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485429484] [2023-11-23 21:39:48,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485429484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:48,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:48,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:39:48,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859445797] [2023-11-23 21:39:48,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:48,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:39:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:48,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:39:48,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:39:48,229 INFO L87 Difference]: Start difference. First operand 137 states and 191 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:48,344 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2023-11-23 21:39:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:39:48,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 21:39:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:48,351 INFO L225 Difference]: With dead ends: 136 [2023-11-23 21:39:48,351 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 21:39:48,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:39:48,354 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 204 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:48,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 100 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:39:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 21:39:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-23 21:39:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 88 states have (on average 1.9204545454545454) internal successors, (169), 123 states have internal predecessors, (169), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-23 21:39:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2023-11-23 21:39:48,373 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 9 [2023-11-23 21:39:48,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:48,374 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2023-11-23 21:39:48,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2023-11-23 21:39:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 21:39:48,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:48,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:48,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:39:48,376 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:48,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:48,377 INFO L85 PathProgramCache]: Analyzing trace with hash 851874766, now seen corresponding path program 1 times [2023-11-23 21:39:48,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749081433] [2023-11-23 21:39:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:48,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:48,640 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-23 21:39:48,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:48,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749081433] [2023-11-23 21:39:48,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749081433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:48,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:48,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:39:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155073839] [2023-11-23 21:39:48,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:48,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:39:48,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:39:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:39:48,643 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:48,802 INFO L93 Difference]: Finished difference Result 135 states and 187 transitions. [2023-11-23 21:39:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:39:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 21:39:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:48,804 INFO L225 Difference]: With dead ends: 135 [2023-11-23 21:39:48,804 INFO L226 Difference]: Without dead ends: 135 [2023-11-23 21:39:48,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:39:48,805 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 275 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:48,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 87 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:39:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-23 21:39:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-23 21:39:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.8977272727272727) internal successors, (167), 122 states have internal predecessors, (167), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-23 21:39:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 187 transitions. [2023-11-23 21:39:48,816 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 187 transitions. Word has length 9 [2023-11-23 21:39:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:48,817 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 187 transitions. [2023-11-23 21:39:48,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 187 transitions. [2023-11-23 21:39:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 21:39:48,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:48,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:48,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:39:48,819 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:48,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:48,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1756504653, now seen corresponding path program 1 times [2023-11-23 21:39:48,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:48,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729707403] [2023-11-23 21:39:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:48,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:48,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 21:39:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:48,921 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-23 21:39:48,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729707403] [2023-11-23 21:39:48,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729707403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:48,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:48,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:39:48,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964766668] [2023-11-23 21:39:48,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:48,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:39:48,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:48,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:39:48,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:39:48,924 INFO L87 Difference]: Start difference. First operand 135 states and 187 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 21:39:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:49,155 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2023-11-23 21:39:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:39:49,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-23 21:39:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:49,157 INFO L225 Difference]: With dead ends: 154 [2023-11-23 21:39:49,158 INFO L226 Difference]: Without dead ends: 154 [2023-11-23 21:39:49,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:39:49,160 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 225 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:49,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 162 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-23 21:39:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2023-11-23 21:39:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 117 states have internal predecessors, (156), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-23 21:39:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2023-11-23 21:39:49,168 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 14 [2023-11-23 21:39:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:49,169 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2023-11-23 21:39:49,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 21:39:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2023-11-23 21:39:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 21:39:49,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:49,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:49,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:39:49,171 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:49,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:49,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1756504654, now seen corresponding path program 1 times [2023-11-23 21:39:49,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:49,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133808573] [2023-11-23 21:39:49,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 21:39:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:49,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133808573] [2023-11-23 21:39:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133808573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:49,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:49,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:39:49,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708536529] [2023-11-23 21:39:49,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:49,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:39:49,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:49,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:39:49,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:39:49,324 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 21:39:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:49,593 INFO L93 Difference]: Finished difference Result 150 states and 174 transitions. [2023-11-23 21:39:49,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:39:49,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-23 21:39:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:49,596 INFO L225 Difference]: With dead ends: 150 [2023-11-23 21:39:49,596 INFO L226 Difference]: Without dead ends: 150 [2023-11-23 21:39:49,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:39:49,597 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 193 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:49,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 218 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-23 21:39:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2023-11-23 21:39:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 117 states have internal predecessors, (150), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-23 21:39:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 170 transitions. [2023-11-23 21:39:49,604 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 170 transitions. Word has length 14 [2023-11-23 21:39:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:49,604 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 170 transitions. [2023-11-23 21:39:49,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 21:39:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2023-11-23 21:39:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 21:39:49,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:49,606 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:49,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:39:49,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:49,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:49,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2083591507, now seen corresponding path program 1 times [2023-11-23 21:39:49,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:49,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94773716] [2023-11-23 21:39:49,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:49,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94773716] [2023-11-23 21:39:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94773716] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:39:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31884123] [2023-11-23 21:39:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:49,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:39:49,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:39:49,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:39:49,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:39:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:49,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 21:39:49,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:39:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:49,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:39:50,005 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-23 21:39:50,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2023-11-23 21:39:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:50,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31884123] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:39:50,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:39:50,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-23 21:39:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418478709] [2023-11-23 21:39:50,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:39:50,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:39:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:50,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:39:50,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:39:50,026 INFO L87 Difference]: Start difference. First operand 130 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-23 21:39:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:50,203 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2023-11-23 21:39:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:39:50,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 17 [2023-11-23 21:39:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:50,205 INFO L225 Difference]: With dead ends: 142 [2023-11-23 21:39:50,205 INFO L226 Difference]: Without dead ends: 142 [2023-11-23 21:39:50,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:39:50,206 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 147 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:50,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 176 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:39:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-23 21:39:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2023-11-23 21:39:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 123 states have internal predecessors, (160), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 21:39:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2023-11-23 21:39:50,213 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 17 [2023-11-23 21:39:50,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:50,214 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2023-11-23 21:39:50,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-23 21:39:50,214 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2023-11-23 21:39:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 21:39:50,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:50,215 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:50,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 21:39:50,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 21:39:50,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:50,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:50,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2083591508, now seen corresponding path program 1 times [2023-11-23 21:39:50,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:50,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237968405] [2023-11-23 21:39:50,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:50,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:50,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:50,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237968405] [2023-11-23 21:39:50,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237968405] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:39:50,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211226133] [2023-11-23 21:39:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:50,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:39:50,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:39:50,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:39:50,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 21:39:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-23 21:39:50,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:39:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:50,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:39:51,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:39:51,016 INFO L378 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 21 treesize of output 25 [2023-11-23 21:39:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:51,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211226133] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:39:51,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:39:51,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-11-23 21:39:51,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059031655] [2023-11-23 21:39:51,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:39:51,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 21:39:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:51,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 21:39:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2023-11-23 21:39:51,131 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:51,401 INFO L93 Difference]: Finished difference Result 139 states and 182 transitions. [2023-11-23 21:39:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:39:51,402 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-23 21:39:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:51,403 INFO L225 Difference]: With dead ends: 139 [2023-11-23 21:39:51,404 INFO L226 Difference]: Without dead ends: 139 [2023-11-23 21:39:51,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-11-23 21:39:51,405 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 286 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:51,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 218 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-23 21:39:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2023-11-23 21:39:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 95 states have (on average 1.6526315789473685) internal successors, (157), 122 states have internal predecessors, (157), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 21:39:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2023-11-23 21:39:51,412 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 17 [2023-11-23 21:39:51,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:51,412 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2023-11-23 21:39:51,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2023-11-23 21:39:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 21:39:51,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:51,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:51,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 21:39:51,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 21:39:51,624 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:51,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:51,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1558456495, now seen corresponding path program 1 times [2023-11-23 21:39:51,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:51,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859913070] [2023-11-23 21:39:51,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:51,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:51,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 21:39:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:51,892 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-23 21:39:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859913070] [2023-11-23 21:39:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859913070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:51,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:51,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:39:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736439315] [2023-11-23 21:39:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:51,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:39:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:51,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:39:51,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:39:51,895 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-23 21:39:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:52,137 INFO L93 Difference]: Finished difference Result 186 states and 238 transitions. [2023-11-23 21:39:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:39:52,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 18 [2023-11-23 21:39:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:52,140 INFO L225 Difference]: With dead ends: 186 [2023-11-23 21:39:52,140 INFO L226 Difference]: Without dead ends: 186 [2023-11-23 21:39:52,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:39:52,141 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 201 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:52,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 307 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-23 21:39:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 146. [2023-11-23 21:39:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 103 states have (on average 1.6213592233009708) internal successors, (167), 130 states have internal predecessors, (167), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 21:39:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2023-11-23 21:39:52,149 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 18 [2023-11-23 21:39:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:52,149 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2023-11-23 21:39:52,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-23 21:39:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2023-11-23 21:39:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 21:39:52,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:52,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:52,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:39:52,151 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:52,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1622911219, now seen corresponding path program 1 times [2023-11-23 21:39:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:52,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148294753] [2023-11-23 21:39:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:52,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 21:39:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:52,507 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-23 21:39:52,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:52,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148294753] [2023-11-23 21:39:52,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148294753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:52,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:52,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:39:52,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113783466] [2023-11-23 21:39:52,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:52,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:39:52,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:52,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:39:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:39:52,510 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-23 21:39:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:52,694 INFO L93 Difference]: Finished difference Result 181 states and 232 transitions. [2023-11-23 21:39:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:39:52,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 20 [2023-11-23 21:39:52,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:52,699 INFO L225 Difference]: With dead ends: 181 [2023-11-23 21:39:52,699 INFO L226 Difference]: Without dead ends: 181 [2023-11-23 21:39:52,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:39:52,702 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 74 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:52,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 349 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:39:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-23 21:39:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2023-11-23 21:39:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 132 states have internal predecessors, (169), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 21:39:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 193 transitions. [2023-11-23 21:39:52,716 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 193 transitions. Word has length 20 [2023-11-23 21:39:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:52,718 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 193 transitions. [2023-11-23 21:39:52,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-23 21:39:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 193 transitions. [2023-11-23 21:39:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 21:39:52,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:52,724 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:52,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:39:52,725 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:52,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash -977164419, now seen corresponding path program 1 times [2023-11-23 21:39:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:52,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358253924] [2023-11-23 21:39:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:52,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:52,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:52,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358253924] [2023-11-23 21:39:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358253924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:39:52,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464741293] [2023-11-23 21:39:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:52,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:39:52,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:39:52,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:39:52,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 21:39:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:53,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 21:39:53,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:39:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:53,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:39:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464741293] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:39:53,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:39:53,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-11-23 21:39:53,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347255391] [2023-11-23 21:39:53,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:39:53,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 21:39:53,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:53,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 21:39:53,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-11-23 21:39:53,264 INFO L87 Difference]: Start difference. First operand 148 states and 193 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:39:53,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:53,893 INFO L93 Difference]: Finished difference Result 281 states and 332 transitions. [2023-11-23 21:39:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:39:53,894 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2023-11-23 21:39:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:53,897 INFO L225 Difference]: With dead ends: 281 [2023-11-23 21:39:53,897 INFO L226 Difference]: Without dead ends: 279 [2023-11-23 21:39:53,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-11-23 21:39:53,899 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 424 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:53,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 644 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 21:39:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-23 21:39:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 148. [2023-11-23 21:39:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.6) internal successors, (168), 132 states have internal predecessors, (168), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 21:39:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2023-11-23 21:39:53,909 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 22 [2023-11-23 21:39:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:53,910 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2023-11-23 21:39:53,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:39:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2023-11-23 21:39:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 21:39:53,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:53,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:53,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 21:39:54,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:39:54,128 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:54,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:54,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1242270682, now seen corresponding path program 1 times [2023-11-23 21:39:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:54,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151201812] [2023-11-23 21:39:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:54,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:54,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151201812] [2023-11-23 21:39:54,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151201812] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:39:54,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815829152] [2023-11-23 21:39:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:54,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:39:54,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:39:54,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:39:54,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 21:39:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:54,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-23 21:39:54,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:39:54,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:39:54,815 INFO L378 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 19 treesize of output 1 [2023-11-23 21:39:54,889 INFO L378 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 9 [2023-11-23 21:39:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:54,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:39:54,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2023-11-23 21:39:55,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:55,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815829152] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:39:55,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:39:55,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2023-11-23 21:39:55,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883566505] [2023-11-23 21:39:55,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:39:55,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-23 21:39:55,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:55,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-23 21:39:55,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2023-11-23 21:39:55,156 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand has 20 states, 18 states have (on average 2.611111111111111) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:57,688 INFO L93 Difference]: Finished difference Result 520 states and 684 transitions. [2023-11-23 21:39:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-23 21:39:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.611111111111111) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 21:39:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:57,693 INFO L225 Difference]: With dead ends: 520 [2023-11-23 21:39:57,693 INFO L226 Difference]: Without dead ends: 520 [2023-11-23 21:39:57,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=1282, Unknown=0, NotChecked=0, Total=1482 [2023-11-23 21:39:57,695 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 506 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:57,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 2590 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-23 21:39:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-11-23 21:39:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 235. [2023-11-23 21:39:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 174 states have (on average 1.5689655172413792) internal successors, (273), 204 states have internal predecessors, (273), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-23 21:39:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 323 transitions. [2023-11-23 21:39:57,711 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 323 transitions. Word has length 23 [2023-11-23 21:39:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:57,711 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 323 transitions. [2023-11-23 21:39:57,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.611111111111111) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 323 transitions. [2023-11-23 21:39:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:39:57,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:57,713 INFO L195 NwaCegarLoop]: trace histogram [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-23 21:39:57,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-23 21:39:57,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-23 21:39:57,930 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:57,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2111354991, now seen corresponding path program 1 times [2023-11-23 21:39:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:57,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4938386] [2023-11-23 21:39:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:57,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 21:39:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:57,992 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-23 21:39:57,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:57,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4938386] [2023-11-23 21:39:57,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4938386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:57,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:57,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:39:57,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705797458] [2023-11-23 21:39:57,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:57,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:39:57,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:57,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:39:57,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:39:57,995 INFO L87 Difference]: Start difference. First operand 235 states and 323 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 21:39:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:58,044 INFO L93 Difference]: Finished difference Result 249 states and 341 transitions. [2023-11-23 21:39:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:39:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-11-23 21:39:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:58,047 INFO L225 Difference]: With dead ends: 249 [2023-11-23 21:39:58,047 INFO L226 Difference]: Without dead ends: 249 [2023-11-23 21:39:58,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-23 21:39:58,049 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:58,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 346 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:39:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-11-23 21:39:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2023-11-23 21:39:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 212 states have internal predecessors, (276), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-23 21:39:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 336 transitions. [2023-11-23 21:39:58,060 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 336 transitions. Word has length 24 [2023-11-23 21:39:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:58,060 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 336 transitions. [2023-11-23 21:39:58,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 21:39:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 336 transitions. [2023-11-23 21:39:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:39:58,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:58,062 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:58,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 21:39:58,062 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:58,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1334847625, now seen corresponding path program 1 times [2023-11-23 21:39:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:58,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809803341] [2023-11-23 21:39:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:58,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:58,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:58,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809803341] [2023-11-23 21:39:58,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809803341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:58,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:58,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:39:58,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954300260] [2023-11-23 21:39:58,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:58,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:39:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:58,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:39:58,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:39:58,143 INFO L87 Difference]: Start difference. First operand 244 states and 336 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-23 21:39:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:58,382 INFO L93 Difference]: Finished difference Result 388 states and 558 transitions. [2023-11-23 21:39:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:39:58,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 24 [2023-11-23 21:39:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:58,386 INFO L225 Difference]: With dead ends: 388 [2023-11-23 21:39:58,387 INFO L226 Difference]: Without dead ends: 388 [2023-11-23 21:39:58,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:39:58,387 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 136 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:58,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 193 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-11-23 21:39:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 243. [2023-11-23 21:39:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 177 states have (on average 1.5480225988700564) internal successors, (274), 211 states have internal predecessors, (274), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-23 21:39:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2023-11-23 21:39:58,402 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 24 [2023-11-23 21:39:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:58,403 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2023-11-23 21:39:58,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-23 21:39:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2023-11-23 21:39:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:39:58,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:58,404 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:58,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 21:39:58,405 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:58,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1334847626, now seen corresponding path program 1 times [2023-11-23 21:39:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:58,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924058514] [2023-11-23 21:39:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:58,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:39:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:58,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:58,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924058514] [2023-11-23 21:39:58,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924058514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:58,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:58,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:39:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394963621] [2023-11-23 21:39:58,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:58,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:39:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:39:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:39:58,593 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-23 21:39:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:59,001 INFO L93 Difference]: Finished difference Result 418 states and 549 transitions. [2023-11-23 21:39:59,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:39:59,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 24 [2023-11-23 21:39:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:59,005 INFO L225 Difference]: With dead ends: 418 [2023-11-23 21:39:59,005 INFO L226 Difference]: Without dead ends: 418 [2023-11-23 21:39:59,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:39:59,006 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 121 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:59,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 456 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:39:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-11-23 21:39:59,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 237. [2023-11-23 21:39:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 177 states have (on average 1.497175141242938) internal successors, (265), 205 states have internal predecessors, (265), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-23 21:39:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2023-11-23 21:39:59,019 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 24 [2023-11-23 21:39:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:59,020 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2023-11-23 21:39:59,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-23 21:39:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2023-11-23 21:39:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 21:39:59,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:59,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 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-23 21:39:59,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 21:39:59,021 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:59,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1808569535, now seen corresponding path program 1 times [2023-11-23 21:39:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:59,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272341787] [2023-11-23 21:39:59,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:59,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 21:39:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:59,096 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-23 21:39:59,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:59,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272341787] [2023-11-23 21:39:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272341787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:59,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:59,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:39:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147052389] [2023-11-23 21:39:59,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:59,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:39:59,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:59,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:39:59,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:39:59,099 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-23 21:39:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:59,311 INFO L93 Difference]: Finished difference Result 248 states and 317 transitions. [2023-11-23 21:39:59,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:39:59,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 26 [2023-11-23 21:39:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:59,314 INFO L225 Difference]: With dead ends: 248 [2023-11-23 21:39:59,314 INFO L226 Difference]: Without dead ends: 248 [2023-11-23 21:39:59,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:39:59,315 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 173 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:59,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 172 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-23 21:39:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 234. [2023-11-23 21:39:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.4350282485875707) internal successors, (254), 202 states have internal predecessors, (254), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-23 21:39:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 314 transitions. [2023-11-23 21:39:59,326 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 314 transitions. Word has length 26 [2023-11-23 21:39:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:59,326 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 314 transitions. [2023-11-23 21:39:59,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-23 21:39:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 314 transitions. [2023-11-23 21:39:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 21:39:59,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:59,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 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-23 21:39:59,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 21:39:59,329 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:59,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1808569534, now seen corresponding path program 1 times [2023-11-23 21:39:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:59,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541226774] [2023-11-23 21:39:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:59,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:59,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 21:39:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 21:39:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:59,490 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-23 21:39:59,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:59,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541226774] [2023-11-23 21:39:59,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541226774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:59,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:59,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:39:59,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668102448] [2023-11-23 21:39:59,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:59,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:39:59,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:59,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:39:59,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:39:59,496 INFO L87 Difference]: Start difference. First operand 234 states and 314 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-23 21:39:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:39:59,715 INFO L93 Difference]: Finished difference Result 246 states and 312 transitions. [2023-11-23 21:39:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:39:59,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 26 [2023-11-23 21:39:59,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:39:59,717 INFO L225 Difference]: With dead ends: 246 [2023-11-23 21:39:59,717 INFO L226 Difference]: Without dead ends: 246 [2023-11-23 21:39:59,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:39:59,718 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 194 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:39:59,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 158 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:39:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-11-23 21:39:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 234. [2023-11-23 21:39:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 202 states have internal predecessors, (248), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-23 21:39:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 308 transitions. [2023-11-23 21:39:59,728 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 308 transitions. Word has length 26 [2023-11-23 21:39:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:39:59,729 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 308 transitions. [2023-11-23 21:39:59,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-23 21:39:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 308 transitions. [2023-11-23 21:39:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 21:39:59,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:39:59,730 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:59,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 21:39:59,731 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:39:59,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash -690421629, now seen corresponding path program 1 times [2023-11-23 21:39:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:59,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408199686] [2023-11-23 21:39:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:59,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:00,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:40:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:00,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408199686] [2023-11-23 21:40:00,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408199686] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:40:00,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604883856] [2023-11-23 21:40:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:00,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:40:00,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:40:00,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:40:00,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 21:40:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:00,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-23 21:40:00,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:40:00,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 21:40:00,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 21:40:00,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:40:00,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:40:00,361 INFO L378 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-23 21:40:00,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:40:00,370 INFO L378 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-23 21:40:00,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:40:00,388 INFO L378 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-23 21:40:00,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:40:00,396 INFO L378 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-23 21:40:00,434 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-23 21:40:00,435 INFO L378 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 29 treesize of output 17 [2023-11-23 21:40:00,452 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-23 21:40:00,453 INFO L378 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 29 treesize of output 17 [2023-11-23 21:40:01,045 INFO L378 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 75 treesize of output 63 [2023-11-23 21:40:01,180 INFO L378 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 32 treesize of output 14 [2023-11-23 21:40:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:01,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:40:01,584 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_621))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (forall ((v_ArrVal_622 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select |c_#valid| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_621))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2)) 1) (forall ((|ULTIMATE.start_main_~n~0#1.offset| Int)) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_622))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) 0))))))) is different from false [2023-11-23 21:40:01,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:40:01,663 INFO L378 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 211 treesize of output 216 [2023-11-23 21:40:03,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_622 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_621))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) |v_ULTIMATE.start_main_~n~0#1.base_30|) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_622))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse5 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_621))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2))) (or (forall ((v_ArrVal_622 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.offset| Int)) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_622))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) 0)) (= .cse6 |v_ULTIMATE.start_main_~n~0#1.base_30|) (= .cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_2))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2)))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse9 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_2))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_30| .cse9) (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_ArrVal_621))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) .cse9) (= .cse9 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_30| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_30| 1)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (let ((.cse12 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_30| v_prenex_2))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_30|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_30| .cse12) (= .cse12 0)))))))) is different from false [2023-11-23 21:40:04,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:40:04,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-11-23 21:40:04,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-11-23 21:40:04,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:40:04,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-11-23 21:40:04,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-11-23 21:40:04,055 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:40:04,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 21:40:04,065 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:40:04,068 INFO L378 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 21 treesize of output 13 [2023-11-23 21:40:04,078 INFO L378 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 16 treesize of output 12 [2023-11-23 21:40:04,092 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 21:40:04,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 1 [2023-11-23 21:40:04,103 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 21:40:04,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 1 [2023-11-23 21:40:04,110 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 21:40:04,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 1 [2023-11-23 21:40:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-23 21:40:04,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604883856] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:40:04,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:40:04,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2023-11-23 21:40:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541620859] [2023-11-23 21:40:04,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:40:04,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 21:40:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:04,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 21:40:04,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=480, Unknown=2, NotChecked=90, Total=650 [2023-11-23 21:40:04,143 INFO L87 Difference]: Start difference. First operand 234 states and 308 transitions. Second operand has 26 states, 25 states have (on average 2.64) internal successors, (66), 26 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:40:08,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 21:40:12,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 21:40:15,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 21:40:17,897 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-23 21:40:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:40:20,813 INFO L93 Difference]: Finished difference Result 556 states and 694 transitions. [2023-11-23 21:40:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-23 21:40:20,814 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 26 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2023-11-23 21:40:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:40:20,818 INFO L225 Difference]: With dead ends: 556 [2023-11-23 21:40:20,818 INFO L226 Difference]: Without dead ends: 556 [2023-11-23 21:40:20,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=655, Invalid=2003, Unknown=2, NotChecked=202, Total=2862 [2023-11-23 21:40:20,820 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1147 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 150 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1035 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-11-23 21:40:20,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 1424 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1592 Invalid, 2 Unknown, 1035 Unchecked, 12.7s Time] [2023-11-23 21:40:20,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-11-23 21:40:20,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 339. [2023-11-23 21:40:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 259 states have (on average 1.359073359073359) internal successors, (352), 290 states have internal predecessors, (352), 47 states have call successors, (47), 16 states have call predecessors, (47), 16 states have return successors, (47), 32 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-23 21:40:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 446 transitions. [2023-11-23 21:40:20,837 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 446 transitions. Word has length 26 [2023-11-23 21:40:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:40:20,838 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 446 transitions. [2023-11-23 21:40:20,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 26 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:40:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 446 transitions. [2023-11-23 21:40:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 21:40:20,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:40:20,839 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:20,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 21:40:21,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:40:21,052 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-23 21:40:21,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash -690421628, now seen corresponding path program 1 times [2023-11-23 21:40:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:21,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748531686] [2023-11-23 21:40:21,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:21,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:40:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748531686] [2023-11-23 21:40:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748531686] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:40:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921245110] [2023-11-23 21:40:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:40:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:40:21,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:40:21,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e21c358-fa59-49d6-b40c-82e3b885a13e/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 21:40:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:21,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 21:40:21,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:40:21,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 21:40:21,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 21:40:21,750 INFO L378 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-23 21:40:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:40:21,825 INFO L378 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-23 21:40:21,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:40:21,839 INFO L378 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-23 21:40:21,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:40:21,857 INFO L378 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-23 21:40:21,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:40:21,868 INFO L378 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-23 21:40:21,903 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-11-23 21:40:21,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-11-23 21:40:21,925 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-23 21:40:21,926 INFO L378 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 29 treesize of output 17 [2023-11-23 21:40:22,776 INFO L378 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 42 treesize of output 18 [2023-11-23 21:40:22,781 INFO L378 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 3 [2023-11-23 21:40:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:22,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:40:23,418 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_700))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))) (or (= .cse0 0) (< (+ .cse0 3) (select |c_#length| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_699))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int)) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse5 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_699))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))) (or (= 0 .cse5) (< (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_700))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3) 3) (select |c_#length| .cse5)))))) (forall ((v_ArrVal_700 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int)) (< 0 (+ (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_700))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3) 1))))) is different from false [2023-11-23 21:40:23,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:40:23,550 INFO L378 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 342 treesize of output 347 [2023-11-23 21:40:26,214 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_32| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_32| 1)) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (<= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_32| v_prenex_3))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_4 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_32| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_32| 1)) (forall ((v_ArrVal_700 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_699 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_699))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) |v_ULTIMATE.start_main_~n~0#1.base_32|)) (< (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_700))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 5)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_32| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_32| 1)) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_prenex_6))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_7 4) |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_32| .cse5) (= .cse5 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_32| Int)) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse8 (+ v_prenex_7 4))) (or (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_prenex_6))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse8 |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_32| v_prenex_5))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse8 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 5)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_32| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_32| Int)) (or (forall ((v_ArrVal_700 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_7 Int) (v_ArrVal_699 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_699))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_700))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (= .cse12 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_prenex_6))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_7 4) |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (= .cse12 |v_ULTIMATE.start_main_~n~0#1.base_32|))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_32| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_32| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_32| 1)) (forall ((v_ArrVal_700 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_699 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_6 (Array Int Int))) (let ((.cse16 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_699))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_prenex_6))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_7 4) |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (< (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_700))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 5)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_32| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_32| 1)) (forall ((v_prenex_7 Int) (v_ArrVal_699 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse22 (+ v_prenex_7 4))) (let ((.cse20 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_prenex_6))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= (select (select (let ((.cse19 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_699))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) .cse20) (= .cse20 0) (< (select (select (let ((.cse21 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_32| v_prenex_5))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 5))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_32| Int)) (or (forall ((v_ArrVal_700 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int)) (< (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_700))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 5)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_32| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_32| Int)) (or (forall ((v_ArrVal_700 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_699 (Array Int Int))) (let ((.cse26 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse25 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_700))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (= (select (select (let ((.cse27 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_699))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) |v_ULTIMATE.start_main_~n~0#1.base_32|)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_32| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_32| Int)) (or (forall ((v_prenex_7 Int) (v_ArrVal_699 (Array Int Int)) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_6 (Array Int Int))) (let ((.cse28 (select (select (let ((.cse30 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_prenex_6))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_7 4) |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_32| .cse28) (= (select (select (let ((.cse29 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_32| v_ArrVal_699))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_32|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) .cse28) (= .cse28 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_32| 1)))))) is different from false [2023-11-23 21:40:26,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:40:26,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-11-23 21:40:26,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-11-23 21:40:26,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:40:26,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-11-23 21:40:26,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:40:26,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-11-23 21:40:26,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-11-23 21:40:26,636 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:40:26,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 21:40:26,648 INFO L378 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 30 treesize of output 22 [2023-11-23 21:40:26,661 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 21:40:26,666 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 21:40:26,673 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 21:40:26,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2023-11-23 21:40:26,679 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 21:40:26,688 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 21:40:26,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 1 [2023-11-23 21:40:26,697 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 21:40:26,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 1 [2023-11-23 21:40:26,703 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 21:40:26,710 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 21:40:26,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2023-11-23 21:40:26,724 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 21:40:26,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2023-11-23 21:40:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-23 21:40:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921245110] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:40:26,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:40:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 27 [2023-11-23 21:40:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231272805] [2023-11-23 21:40:26,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:40:26,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-23 21:40:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:26,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-23 21:40:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=568, Unknown=2, NotChecked=98, Total=756 [2023-11-23 21:40:26,762 INFO L87 Difference]: Start difference. First operand 339 states and 446 transitions. Second operand has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 28 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:40:31,768 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-23 21:40:34,126 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]