./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya --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 64bit --witnessprinter.graph.data.programhash f1741d130075f1f7f25c8fd49724f342261e16295a533d1b7fc59c9fdd3354e1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:12:47,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:12:47,742 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-29 00:12:47,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:12:47,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:12:47,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:12:47,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:12:47,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:12:47,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:12:47,777 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:12:47,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:12:47,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:12:47,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:12:47,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:12:47,780 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:12:47,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:12:47,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:12:47,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:12:47,782 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:12:47,783 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:12:47,783 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:12:47,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:12:47,784 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:12:47,785 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:12:47,785 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:12:47,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:12:47,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:12:47,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:12:47,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:12:47,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:12:47,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:12:47,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:12:47,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:12:47,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:12:47,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:12:47,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:12:47,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:12:47,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:12:47,790 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_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/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_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1741d130075f1f7f25c8fd49724f342261e16295a533d1b7fc59c9fdd3354e1 [2023-11-29 00:12:48,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:12:48,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:12:48,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:12:48,037 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:12:48,038 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:12:48,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i [2023-11-29 00:12:50,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:12:51,035 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:12:51,035 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i [2023-11-29 00:12:51,059 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/data/bd9ac1499/62c590cb44234bbd87d46011c0aad3da/FLAG027327ef1 [2023-11-29 00:12:51,071 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/data/bd9ac1499/62c590cb44234bbd87d46011c0aad3da [2023-11-29 00:12:51,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:12:51,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:12:51,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:12:51,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:12:51,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:12:51,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29628353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51, skipping insertion in model container [2023-11-29 00:12:51,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,151 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:12:51,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:12:51,406 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:12:51,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:12:51,478 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:12:51,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51 WrapperNode [2023-11-29 00:12:51,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:12:51,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:12:51,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:12:51,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:12:51,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,524 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-29 00:12:51,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:12:51,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:12:51,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:12:51,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:12:51,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,558 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2023-11-29 00:12:51,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:12:51,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:12:51,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:12:51,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:12:51,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (1/1) ... [2023-11-29 00:12:51,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:12:51,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:12:51,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:12:51,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:12:51,627 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2023-11-29 00:12:51,627 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2023-11-29 00:12:51,627 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2023-11-29 00:12:51,627 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2023-11-29 00:12:51,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:12:51,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:12:51,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:12:51,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:12:51,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:12:51,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:12:51,734 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:12:51,736 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:12:51,965 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:12:52,012 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:12:52,012 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 00:12:52,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:52 BoogieIcfgContainer [2023-11-29 00:12:52,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:12:52,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:12:52,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:12:52,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:12:52,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:12:51" (1/3) ... [2023-11-29 00:12:52,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51830371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:12:52, skipping insertion in model container [2023-11-29 00:12:52,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:51" (2/3) ... [2023-11-29 00:12:52,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51830371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:12:52, skipping insertion in model container [2023-11-29 00:12:52,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:52" (3/3) ... [2023-11-29 00:12:52,023 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-sll-after.i [2023-11-29 00:12:52,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:12:52,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2023-11-29 00:12:52,085 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:12:52,090 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;@4a0e64b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:12:52,090 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-11-29 00:12:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 64 states have internal predecessors, (74), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 00:12:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 00:12:52,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:52,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 00:12:52,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:52,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash 5796754, now seen corresponding path program 1 times [2023-11-29 00:12:52,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:52,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706388747] [2023-11-29 00:12:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:52,325 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-29 00:12:52,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:52,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706388747] [2023-11-29 00:12:52,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706388747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:52,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:52,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:12:52,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765736293] [2023-11-29 00:12:52,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:52,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:12:52,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:52,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:12:52,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:12:52,356 INFO L87 Difference]: Start difference. First operand has 71 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 64 states have internal predecessors, (74), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-29 00:12:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:52,444 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2023-11-29 00:12:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:12:52,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2023-11-29 00:12:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:52,452 INFO L225 Difference]: With dead ends: 69 [2023-11-29 00:12:52,452 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 00:12:52,453 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-29 00:12:52,456 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:52,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:12:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 00:12:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 00:12:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 61 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 00:12:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-11-29 00:12:52,496 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 4 [2023-11-29 00:12:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:52,497 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-11-29 00:12:52,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-29 00:12:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-11-29 00:12:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 00:12:52,498 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:52,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 00:12:52,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:12:52,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:52,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:52,499 INFO L85 PathProgramCache]: Analyzing trace with hash 5796755, now seen corresponding path program 1 times [2023-11-29 00:12:52,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:52,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594925300] [2023-11-29 00:12:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:52,594 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-29 00:12:52,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:52,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594925300] [2023-11-29 00:12:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594925300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:52,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:52,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:12:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048297154] [2023-11-29 00:12:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:52,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:12:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:12:52,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:12:52,599 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-29 00:12:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:52,663 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2023-11-29 00:12:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:12:52,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2023-11-29 00:12:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:52,665 INFO L225 Difference]: With dead ends: 66 [2023-11-29 00:12:52,665 INFO L226 Difference]: Without dead ends: 66 [2023-11-29 00:12:52,666 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-29 00:12:52,667 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:52,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:12:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-29 00:12:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-29 00:12:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 59 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 00:12:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2023-11-29 00:12:52,678 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 4 [2023-11-29 00:12:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:52,678 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2023-11-29 00:12:52,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-29 00:12:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2023-11-29 00:12:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:12:52,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:52,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:52,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:12:52,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:52,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1995356130, now seen corresponding path program 1 times [2023-11-29 00:12:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:52,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001515643] [2023-11-29 00:12:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:12:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:52,796 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-29 00:12:52,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:52,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001515643] [2023-11-29 00:12:52,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001515643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:52,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:52,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:12:52,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983122673] [2023-11-29 00:12:52,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:52,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:12:52,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:52,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:12:52,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:12:52,801 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 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-29 00:12:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:52,904 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2023-11-29 00:12:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:12:52,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 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 13 [2023-11-29 00:12:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:52,907 INFO L225 Difference]: With dead ends: 65 [2023-11-29 00:12:52,907 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 00:12:52,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:12:52,909 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:52,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:12:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 00:12:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-29 00:12:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 35 states have (on average 1.8) internal successors, (63), 58 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 00:12:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2023-11-29 00:12:52,919 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 13 [2023-11-29 00:12:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:52,921 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2023-11-29 00:12:52,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 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-29 00:12:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2023-11-29 00:12:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:12:52,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:52,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:52,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:12:52,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:52,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1995356129, now seen corresponding path program 1 times [2023-11-29 00:12:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:52,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437191982] [2023-11-29 00:12:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:53,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:12:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:53,047 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-29 00:12:53,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:53,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437191982] [2023-11-29 00:12:53,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437191982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:53,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:53,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:12:53,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61474772] [2023-11-29 00:12:53,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:53,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:12:53,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:53,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:12:53,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:12:53,050 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 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-29 00:12:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:53,140 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2023-11-29 00:12:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:12:53,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 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 13 [2023-11-29 00:12:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:53,142 INFO L225 Difference]: With dead ends: 64 [2023-11-29 00:12:53,142 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 00:12:53,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:12:53,144 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:53,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:12:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 00:12:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-29 00:12:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 57 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 00:12:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2023-11-29 00:12:53,152 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 13 [2023-11-29 00:12:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:53,153 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2023-11-29 00:12:53,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 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-29 00:12:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2023-11-29 00:12:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:12:53,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:53,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:53,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:12:53,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:53,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:53,155 INFO L85 PathProgramCache]: Analyzing trace with hash -717837352, now seen corresponding path program 1 times [2023-11-29 00:12:53,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:53,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869861075] [2023-11-29 00:12:53,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:53,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:12:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:12:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:12:53,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869861075] [2023-11-29 00:12:53,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869861075] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:12:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123806734] [2023-11-29 00:12:53,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:53,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:12:53,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:12:53,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:12:53,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:12:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:53,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:12:53,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:12:53,576 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-29 00:12:53,640 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2023-11-29 00:12:53,687 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 00:12:53,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 00:12:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 00:12:53,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:12:53,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123806734] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:12:53,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:12:53,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-11-29 00:12:53,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991207729] [2023-11-29 00:12:53,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:12:53,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:12:53,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:53,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:12:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-11-29 00:12:53,757 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 11 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 00:12:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:54,026 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2023-11-29 00:12:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:12:54,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 15 [2023-11-29 00:12:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:54,027 INFO L225 Difference]: With dead ends: 69 [2023-11-29 00:12:54,028 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 00:12:54,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-29 00:12:54,029 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:54,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 272 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 256 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2023-11-29 00:12:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 00:12:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-11-29 00:12:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.736842105263158) internal successors, (66), 59 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:12:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2023-11-29 00:12:54,037 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 15 [2023-11-29 00:12:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:54,037 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2023-11-29 00:12:54,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 00:12:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2023-11-29 00:12:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:12:54,038 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:54,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:54,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:12:54,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:12:54,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:54,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash -717837351, now seen corresponding path program 1 times [2023-11-29 00:12:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:54,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518367746] [2023-11-29 00:12:54,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:54,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:54,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:12:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:54,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:12:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:12:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518367746] [2023-11-29 00:12:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518367746] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:12:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843666322] [2023-11-29 00:12:54,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:54,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:12:54,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:12:54,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:12:54,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:12:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:54,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 00:12:54,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:12:54,716 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-29 00:12:54,720 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-29 00:12:54,897 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2023-11-29 00:12:54,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:12:54,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:12:54,942 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:12:54,942 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 11 treesize of output 11 [2023-11-29 00:12:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 00:12:54,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:12:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843666322] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:12:55,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:12:55,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-29 00:12:55,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357504143] [2023-11-29 00:12:55,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:12:55,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:12:55,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:55,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:12:55,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2023-11-29 00:12:55,096 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 16 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:12:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:55,471 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2023-11-29 00:12:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:12:55,471 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2023-11-29 00:12:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:55,472 INFO L225 Difference]: With dead ends: 69 [2023-11-29 00:12:55,472 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 00:12:55,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=354, Unknown=1, NotChecked=38, Total=462 [2023-11-29 00:12:55,474 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:55,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 418 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 326 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2023-11-29 00:12:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 00:12:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-29 00:12:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 60 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:12:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-11-29 00:12:55,480 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 15 [2023-11-29 00:12:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:55,480 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-11-29 00:12:55,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:12:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-11-29 00:12:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 00:12:55,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:55,482 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-29 00:12:55,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:12:55,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:12:55,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:55,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:55,688 INFO L85 PathProgramCache]: Analyzing trace with hash 112698123, now seen corresponding path program 1 times [2023-11-29 00:12:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:55,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235348315] [2023-11-29 00:12:55,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:55,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:12:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:55,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:12:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:55,913 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-29 00:12:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:55,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235348315] [2023-11-29 00:12:55,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235348315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:55,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:55,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:12:55,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707022304] [2023-11-29 00:12:55,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:55,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:12:55,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:55,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:12:55,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:12:55,915 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 11 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:12:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:56,206 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2023-11-29 00:12:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:12:56,207 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-11-29 00:12:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:56,208 INFO L225 Difference]: With dead ends: 95 [2023-11-29 00:12:56,208 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 00:12:56,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:12:56,209 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:56,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 237 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:12:56,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 00:12:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 69. [2023-11-29 00:12:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 61 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:12:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2023-11-29 00:12:56,215 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 20 [2023-11-29 00:12:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:56,215 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2023-11-29 00:12:56,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:12:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2023-11-29 00:12:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 00:12:56,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:56,216 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-29 00:12:56,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:12:56,217 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:56,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:56,217 INFO L85 PathProgramCache]: Analyzing trace with hash 112698124, now seen corresponding path program 1 times [2023-11-29 00:12:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:56,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242349686] [2023-11-29 00:12:56,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:56,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:12:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:56,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:12:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:56,629 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-29 00:12:56,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:56,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242349686] [2023-11-29 00:12:56,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242349686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:56,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:56,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 00:12:56,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752658397] [2023-11-29 00:12:56,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:56,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:12:56,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:56,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:12:56,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:12:56,631 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 13 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:12:56,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:56,960 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2023-11-29 00:12:56,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:12:56,961 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-11-29 00:12:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:56,963 INFO L225 Difference]: With dead ends: 111 [2023-11-29 00:12:56,963 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 00:12:56,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:12:56,964 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:56,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 269 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:12:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 00:12:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2023-11-29 00:12:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 69 states have internal predecessors, (79), 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-29 00:12:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2023-11-29 00:12:56,973 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 20 [2023-11-29 00:12:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:56,973 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2023-11-29 00:12:56,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:12:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2023-11-29 00:12:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 00:12:56,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:56,974 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:56,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:12:56,975 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:56,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:56,975 INFO L85 PathProgramCache]: Analyzing trace with hash 983290782, now seen corresponding path program 1 times [2023-11-29 00:12:56,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:56,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067279562] [2023-11-29 00:12:56,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:56,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:57,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:12:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:57,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:12:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:12:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:12:57,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:57,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067279562] [2023-11-29 00:12:57,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067279562] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:12:57,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982581065] [2023-11-29 00:12:57,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:57,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:12:57,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:12:57,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:12:57,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:12:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:57,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:12:57,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:12:57,250 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-29 00:12:57,298 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-29 00:12:57,322 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 00:12:57,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 00:12:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 00:12:57,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:12:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982581065] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:12:57,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:12:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-11-29 00:12:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228436516] [2023-11-29 00:12:57,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:12:57,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:12:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:57,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:12:57,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-11-29 00:12:57,376 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 11 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:12:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:57,557 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2023-11-29 00:12:57,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:12:57,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2023-11-29 00:12:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:57,558 INFO L225 Difference]: With dead ends: 83 [2023-11-29 00:12:57,558 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 00:12:57,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-29 00:12:57,559 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:57,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 210 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2023-11-29 00:12:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 00:12:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2023-11-29 00:12:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 71 states have internal predecessors, (83), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:12:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2023-11-29 00:12:57,565 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 22 [2023-11-29 00:12:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:57,566 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2023-11-29 00:12:57,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:12:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2023-11-29 00:12:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 00:12:57,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:57,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:57,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:12:57,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-29 00:12:57,774 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:57,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:57,774 INFO L85 PathProgramCache]: Analyzing trace with hash 983290783, now seen corresponding path program 1 times [2023-11-29 00:12:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696667626] [2023-11-29 00:12:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:57,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:57,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:12:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:57,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:12:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:57,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:12:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:12:58,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:58,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696667626] [2023-11-29 00:12:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696667626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:12:58,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880184516] [2023-11-29 00:12:58,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:58,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:12:58,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:12:58,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:12:58,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:12:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:58,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 00:12:58,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:12:58,172 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-29 00:12:58,306 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-29 00:12:58,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:12:58,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 00:12:58,331 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:12:58,332 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 11 treesize of output 11 [2023-11-29 00:12:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 00:12:58,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:12:58,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880184516] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:12:58,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:12:58,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-11-29 00:12:58,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63821429] [2023-11-29 00:12:58,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:12:58,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:12:58,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:12:58,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2023-11-29 00:12:58,442 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 17 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:12:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:58,726 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2023-11-29 00:12:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:12:58,727 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 22 [2023-11-29 00:12:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:58,728 INFO L225 Difference]: With dead ends: 82 [2023-11-29 00:12:58,728 INFO L226 Difference]: Without dead ends: 82 [2023-11-29 00:12:58,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2023-11-29 00:12:58,729 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:58,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 348 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 309 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2023-11-29 00:12:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-29 00:12:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2023-11-29 00:12:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 70 states have internal predecessors, (81), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:12:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2023-11-29 00:12:58,736 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 22 [2023-11-29 00:12:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:58,736 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2023-11-29 00:12:58,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:12:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2023-11-29 00:12:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 00:12:58,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:58,738 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] [2023-11-29 00:12:58,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 00:12:58,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 00:12:58,947 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:58,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash 928665880, now seen corresponding path program 1 times [2023-11-29 00:12:58,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:58,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374340341] [2023-11-29 00:12:58,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:58,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:12:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:12:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:59,057 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-29 00:12:59,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:59,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374340341] [2023-11-29 00:12:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374340341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:59,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:59,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:12:59,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677161138] [2023-11-29 00:12:59,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:59,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:12:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:12:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:12:59,060 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:12:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:59,181 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2023-11-29 00:12:59,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:12:59,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-29 00:12:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:59,183 INFO L225 Difference]: With dead ends: 83 [2023-11-29 00:12:59,183 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 00:12:59,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:12:59,184 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 53 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:59,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 308 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:12:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 00:12:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2023-11-29 00:12:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 70 states have internal predecessors, (79), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:12:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2023-11-29 00:12:59,189 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 22 [2023-11-29 00:12:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:59,189 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2023-11-29 00:12:59,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:12:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2023-11-29 00:12:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 00:12:59,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:12:59,191 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] [2023-11-29 00:12:59,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:12:59,192 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:12:59,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1274515879, now seen corresponding path program 1 times [2023-11-29 00:12:59,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:59,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111383812] [2023-11-29 00:12:59,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:59,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:12:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:59,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:12:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111383812] [2023-11-29 00:12:59,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111383812] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:12:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368701344] [2023-11-29 00:12:59,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:59,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:12:59,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:12:59,726 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:12:59,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:12:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:59,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 00:12:59,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:12:59,845 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-29 00:12:59,874 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 11 treesize of output 7 [2023-11-29 00:12:59,879 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 11 treesize of output 7 [2023-11-29 00:12:59,896 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 19 treesize of output 18 [2023-11-29 00:12:59,903 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 19 treesize of output 18 [2023-11-29 00:13:00,160 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2023-11-29 00:13:00,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:13:00,177 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 23 treesize of output 16 [2023-11-29 00:13:00,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:13:00,189 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 23 treesize of output 16 [2023-11-29 00:13:00,201 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:13:00,202 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 11 treesize of output 11 [2023-11-29 00:13:00,378 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-11-29 00:13:00,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 31 [2023-11-29 00:13:00,418 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-11-29 00:13:00,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2023-11-29 00:13:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:00,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:00,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368701344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:00,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:00,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2023-11-29 00:13:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212158561] [2023-11-29 00:13:00,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:00,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 00:13:00,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:00,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 00:13:00,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=583, Unknown=1, NotChecked=48, Total=702 [2023-11-29 00:13:00,886 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 24 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 20 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:13:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:01,828 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2023-11-29 00:13:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:13:01,828 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 20 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2023-11-29 00:13:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:01,829 INFO L225 Difference]: With dead ends: 82 [2023-11-29 00:13:01,829 INFO L226 Difference]: Without dead ends: 82 [2023-11-29 00:13:01,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=124, Invalid=1069, Unknown=1, NotChecked=66, Total=1260 [2023-11-29 00:13:01,831 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 11 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:01,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 656 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 581 Invalid, 0 Unknown, 84 Unchecked, 0.4s Time] [2023-11-29 00:13:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-29 00:13:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2023-11-29 00:13:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.509433962264151) internal successors, (80), 71 states have internal predecessors, (80), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:13:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-11-29 00:13:01,836 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 23 [2023-11-29 00:13:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:01,836 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-11-29 00:13:01,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 20 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:13:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-11-29 00:13:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 00:13:01,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:01,837 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:01,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:13:02,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 00:13:02,043 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:02,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1978553128, now seen corresponding path program 1 times [2023-11-29 00:13:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211241621] [2023-11-29 00:13:02,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:02,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:13:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:13:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:13:02,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211241621] [2023-11-29 00:13:02,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211241621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236195782] [2023-11-29 00:13:02,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:02,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:02,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:02,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:02,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:13:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:02,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:13:02,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:02,409 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-29 00:13:02,421 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 15 treesize of output 1 [2023-11-29 00:13:02,428 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 17 treesize of output 9 [2023-11-29 00:13:02,453 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2023-11-29 00:13:02,483 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 00:13:02,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 00:13:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-29 00:13:02,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:02,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236195782] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:02,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:02,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2023-11-29 00:13:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346153372] [2023-11-29 00:13:02,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:02,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:13:02,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:13:02,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2023-11-29 00:13:02,529 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:13:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:02,793 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2023-11-29 00:13:02,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:13:02,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2023-11-29 00:13:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:02,795 INFO L225 Difference]: With dead ends: 80 [2023-11-29 00:13:02,795 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 00:13:02,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2023-11-29 00:13:02,796 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:02,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 359 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2023-11-29 00:13:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 00:13:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-29 00:13:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.490566037735849) internal successors, (79), 70 states have internal predecessors, (79), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:13:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2023-11-29 00:13:02,800 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 24 [2023-11-29 00:13:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:02,801 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2023-11-29 00:13:02,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:13:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2023-11-29 00:13:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 00:13:02,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:02,802 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:02,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:13:03,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:03,007 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:03,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1978553127, now seen corresponding path program 1 times [2023-11-29 00:13:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908464020] [2023-11-29 00:13:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:03,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:13:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:03,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:13:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:13:03,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908464020] [2023-11-29 00:13:03,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908464020] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335600518] [2023-11-29 00:13:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:03,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:03,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:03,386 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:03,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:13:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:03,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 00:13:03,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:03,523 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-29 00:13:03,608 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 15 treesize of output 1 [2023-11-29 00:13:03,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:13:03,652 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 20 [2023-11-29 00:13:03,667 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 26 treesize of output 14 [2023-11-29 00:13:03,731 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2023-11-29 00:13:03,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:13:03,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 00:13:03,759 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:13:03,759 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 11 treesize of output 11 [2023-11-29 00:13:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-11-29 00:13:03,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:03,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335600518] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:03,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:03,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2023-11-29 00:13:03,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116007638] [2023-11-29 00:13:03,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:03,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 00:13:03,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:03,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 00:13:03,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2023-11-29 00:13:03,894 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 20 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:13:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:04,241 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2023-11-29 00:13:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:13:04,242 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 24 [2023-11-29 00:13:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:04,243 INFO L225 Difference]: With dead ends: 78 [2023-11-29 00:13:04,243 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 00:13:04,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=508, Unknown=1, NotChecked=46, Total=650 [2023-11-29 00:13:04,244 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 10 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:04,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 398 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2023-11-29 00:13:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 00:13:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-11-29 00:13:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 66 states have internal predecessors, (75), 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-29 00:13:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2023-11-29 00:13:04,247 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 24 [2023-11-29 00:13:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:04,248 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2023-11-29 00:13:04,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:13:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2023-11-29 00:13:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:13:04,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:04,249 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] [2023-11-29 00:13:04,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 00:13:04,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 00:13:04,449 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:04,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:04,450 INFO L85 PathProgramCache]: Analyzing trace with hash -744128282, now seen corresponding path program 1 times [2023-11-29 00:13:04,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:04,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084789720] [2023-11-29 00:13:04,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:04,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:04,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:04,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:04,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084789720] [2023-11-29 00:13:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084789720] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451723300] [2023-11-29 00:13:04,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:04,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:04,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:04,539 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:04,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:13:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:04,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 00:13:04,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:04,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:04,705 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 00:13:04,705 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-29 00:13:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451723300] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:13:04,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:13:04,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-11-29 00:13:04,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499778416] [2023-11-29 00:13:04,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:04,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:13:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:04,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:13:04,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:13:04,717 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:13:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:04,834 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2023-11-29 00:13:04,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:13:04,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-29 00:13:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:04,836 INFO L225 Difference]: With dead ends: 99 [2023-11-29 00:13:04,836 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 00:13:04,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:13:04,837 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:04,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 148 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:13:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 00:13:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2023-11-29 00:13:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.471698113207547) internal successors, (78), 67 states have internal predecessors, (78), 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-29 00:13:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2023-11-29 00:13:04,841 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 25 [2023-11-29 00:13:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:04,842 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2023-11-29 00:13:04,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:13:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2023-11-29 00:13:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:13:04,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:04,843 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] [2023-11-29 00:13:04,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 00:13:05,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 00:13:05,043 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:05,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -744128281, now seen corresponding path program 1 times [2023-11-29 00:13:05,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:05,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191812478] [2023-11-29 00:13:05,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:05,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:05,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191812478] [2023-11-29 00:13:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191812478] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431032889] [2023-11-29 00:13:05,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:05,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:05,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:05,247 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:05,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:13:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:05,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 00:13:05,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:05,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:05,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:13:05,523 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 17 treesize of output 21 [2023-11-29 00:13:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431032889] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:13:05,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:13:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2023-11-29 00:13:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206457703] [2023-11-29 00:13:05,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:05,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 00:13:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 00:13:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:13:05,683 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 23 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:13:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:05,953 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2023-11-29 00:13:05,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:13:05,953 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-11-29 00:13:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:05,954 INFO L225 Difference]: With dead ends: 83 [2023-11-29 00:13:05,954 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 00:13:05,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2023-11-29 00:13:05,956 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 186 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:05,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 402 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:13:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 00:13:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2023-11-29 00:13:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 69 states have internal predecessors, (79), 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-29 00:13:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2023-11-29 00:13:05,960 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 25 [2023-11-29 00:13:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:05,960 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2023-11-29 00:13:05,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:13:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2023-11-29 00:13:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 00:13:05,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:05,961 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, 1] [2023-11-29 00:13:05,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 00:13:06,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 00:13:06,163 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:06,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2142752170, now seen corresponding path program 1 times [2023-11-29 00:13:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:06,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760248075] [2023-11-29 00:13:06,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:06,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:06,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:06,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760248075] [2023-11-29 00:13:06,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760248075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:06,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:06,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:13:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217163202] [2023-11-29 00:13:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:06,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:13:06,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:13:06,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:13:06,281 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:13:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:06,402 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2023-11-29 00:13:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:13:06,402 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-11-29 00:13:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:06,403 INFO L225 Difference]: With dead ends: 81 [2023-11-29 00:13:06,403 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 00:13:06,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:13:06,404 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:06,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 270 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:13:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 00:13:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-11-29 00:13:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 69 states have internal predecessors, (78), 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-29 00:13:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2023-11-29 00:13:06,408 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 27 [2023-11-29 00:13:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:06,408 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2023-11-29 00:13:06,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:13:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2023-11-29 00:13:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 00:13:06,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:06,409 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, 1] [2023-11-29 00:13:06,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:13:06,409 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:06,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2142648927, now seen corresponding path program 1 times [2023-11-29 00:13:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352910232] [2023-11-29 00:13:06,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:06,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:06,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352910232] [2023-11-29 00:13:06,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352910232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:06,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:06,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:13:06,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213675126] [2023-11-29 00:13:06,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:06,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:13:06,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:13:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:13:06,568 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:13:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:06,730 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2023-11-29 00:13:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:13:06,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-11-29 00:13:06,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:06,731 INFO L225 Difference]: With dead ends: 79 [2023-11-29 00:13:06,731 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 00:13:06,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:13:06,732 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:06,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 216 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:13:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 00:13:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-29 00:13:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 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-29 00:13:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2023-11-29 00:13:06,736 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 27 [2023-11-29 00:13:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:06,737 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2023-11-29 00:13:06,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:13:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2023-11-29 00:13:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 00:13:06,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:06,738 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:06,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:13:06,738 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:06,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash 657829439, now seen corresponding path program 1 times [2023-11-29 00:13:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302814399] [2023-11-29 00:13:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:06,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:07,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:13:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:07,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:07,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302814399] [2023-11-29 00:13:07,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302814399] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:07,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863281514] [2023-11-29 00:13:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:07,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:07,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:07,288 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:07,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:13:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:07,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 00:13:07,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:07,434 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-29 00:13:07,570 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 00:13:07,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 00:13:07,591 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 00:13:07,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 00:13:07,706 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-29 00:13:07,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:13:07,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:13:07,743 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 00:13:07,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 00:13:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-29 00:13:07,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:07,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863281514] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:07,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:07,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2023-11-29 00:13:07,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916338874] [2023-11-29 00:13:07,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:07,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 00:13:07,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:07,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 00:13:07,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=433, Unknown=1, NotChecked=42, Total=552 [2023-11-29 00:13:07,904 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 21 states, 16 states have (on average 1.9375) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:13:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:08,357 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2023-11-29 00:13:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:13:08,358 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.9375) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2023-11-29 00:13:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:08,358 INFO L225 Difference]: With dead ends: 80 [2023-11-29 00:13:08,359 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 00:13:08,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=598, Unknown=1, NotChecked=50, Total=756 [2023-11-29 00:13:08,360 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 94 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:08,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 266 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 408 Invalid, 0 Unknown, 68 Unchecked, 0.3s Time] [2023-11-29 00:13:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 00:13:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-11-29 00:13:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 70 states have internal predecessors, (78), 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-29 00:13:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2023-11-29 00:13:08,364 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 28 [2023-11-29 00:13:08,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:08,364 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2023-11-29 00:13:08,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.9375) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:13:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2023-11-29 00:13:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 00:13:08,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:08,365 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:08,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 00:13:08,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:08,566 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:08,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 868474385, now seen corresponding path program 1 times [2023-11-29 00:13:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231024413] [2023-11-29 00:13:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:08,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:13:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:13:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:13:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:08,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231024413] [2023-11-29 00:13:08,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231024413] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:08,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868136437] [2023-11-29 00:13:08,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:08,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:08,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:08,786 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:08,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 00:13:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:08,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:13:08,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:08,939 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-29 00:13:08,955 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 15 treesize of output 1 [2023-11-29 00:13:08,958 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 17 treesize of output 9 [2023-11-29 00:13:08,977 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-29 00:13:08,999 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 00:13:08,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 00:13:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-29 00:13:09,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:09,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868136437] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:09,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:09,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-11-29 00:13:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219200085] [2023-11-29 00:13:09,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:09,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:13:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:09,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:13:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2023-11-29 00:13:09,036 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 12 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 00:13:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:09,207 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2023-11-29 00:13:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:13:09,207 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2023-11-29 00:13:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:09,208 INFO L225 Difference]: With dead ends: 79 [2023-11-29 00:13:09,208 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 00:13:09,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2023-11-29 00:13:09,209 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:09,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 256 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 207 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2023-11-29 00:13:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 00:13:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2023-11-29 00:13:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.375) internal successors, (77), 69 states have internal predecessors, (77), 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-29 00:13:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-11-29 00:13:09,213 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 30 [2023-11-29 00:13:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:09,214 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-11-29 00:13:09,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 00:13:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-11-29 00:13:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 00:13:09,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:09,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:09,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 00:13:09,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:09,419 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:09,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:09,419 INFO L85 PathProgramCache]: Analyzing trace with hash 868474386, now seen corresponding path program 1 times [2023-11-29 00:13:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:09,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959683955] [2023-11-29 00:13:09,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:09,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:13:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:09,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:13:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:13:09,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:09,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959683955] [2023-11-29 00:13:09,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959683955] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:09,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747945095] [2023-11-29 00:13:09,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:09,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:09,741 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:09,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 00:13:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:09,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 00:13:09,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:09,904 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-29 00:13:09,974 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 15 treesize of output 1 [2023-11-29 00:13:09,979 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 15 treesize of output 1 [2023-11-29 00:13:10,011 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 20 [2023-11-29 00:13:10,014 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 26 treesize of output 14 [2023-11-29 00:13:10,074 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-29 00:13:10,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:13:10,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 00:13:10,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:13:10,094 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 11 treesize of output 11 [2023-11-29 00:13:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-29 00:13:10,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747945095] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:10,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:10,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2023-11-29 00:13:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236246142] [2023-11-29 00:13:10,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:10,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:13:10,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:10,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:13:10,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2023-11-29 00:13:10,194 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 19 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 00:13:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:10,582 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2023-11-29 00:13:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:13:10,583 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2023-11-29 00:13:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:10,584 INFO L225 Difference]: With dead ends: 79 [2023-11-29 00:13:10,584 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 00:13:10,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=466, Unknown=1, NotChecked=44, Total=600 [2023-11-29 00:13:10,585 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:10,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 487 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 431 Invalid, 0 Unknown, 66 Unchecked, 0.3s Time] [2023-11-29 00:13:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 00:13:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2023-11-29 00:13:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 65 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:13:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-11-29 00:13:10,589 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 30 [2023-11-29 00:13:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:10,589 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-11-29 00:13:10,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 00:13:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-11-29 00:13:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 00:13:10,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:10,590 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, 1, 1, 1, 1] [2023-11-29 00:13:10,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 00:13:10,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 00:13:10,790 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:10,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 149901640, now seen corresponding path program 1 times [2023-11-29 00:13:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701037844] [2023-11-29 00:13:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:10,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:10,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:10,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701037844] [2023-11-29 00:13:10,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701037844] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:10,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470453343] [2023-11-29 00:13:10,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:10,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:10,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:10,951 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:10,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 00:13:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:11,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 00:13:11,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:11,188 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 8 treesize of output 1 [2023-11-29 00:13:11,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:13:11,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 00:13:11,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:13:11,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 00:13:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:11,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:11,438 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 00:13:11,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-11-29 00:13:11,468 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 6 treesize of output 4 [2023-11-29 00:13:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470453343] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:13:11,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:13:11,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 15] total 22 [2023-11-29 00:13:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024964089] [2023-11-29 00:13:11,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:11,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 00:13:11,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:11,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 00:13:11,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2023-11-29 00:13:11,497 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:13:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:11,954 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2023-11-29 00:13:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 00:13:11,958 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-11-29 00:13:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:11,959 INFO L225 Difference]: With dead ends: 98 [2023-11-29 00:13:11,959 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 00:13:11,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 00:13:11,960 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 131 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:11,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 628 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:13:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 00:13:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2023-11-29 00:13:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 73 states have internal predecessors, (81), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:13:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2023-11-29 00:13:11,964 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 30 [2023-11-29 00:13:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:11,964 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2023-11-29 00:13:11,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:13:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2023-11-29 00:13:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:13:11,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:11,965 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:11,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 00:13:12,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 00:13:12,166 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:12,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash -538856890, now seen corresponding path program 1 times [2023-11-29 00:13:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:12,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433424066] [2023-11-29 00:13:12,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:12,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:12,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:13,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:13:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433424066] [2023-11-29 00:13:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433424066] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627098582] [2023-11-29 00:13:13,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:13,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:13,168 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:13,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 00:13:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:13,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-29 00:13:13,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:13,330 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-29 00:13:13,359 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 11 treesize of output 7 [2023-11-29 00:13:13,363 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 11 treesize of output 7 [2023-11-29 00:13:13,378 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 19 treesize of output 18 [2023-11-29 00:13:13,387 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 19 treesize of output 18 [2023-11-29 00:13:13,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:13:13,707 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 11 treesize of output 11 [2023-11-29 00:13:13,727 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (<= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (not (= |c_ULTIMATE.start_create_internal_#t~ret5#1.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse0 8) 0) (or (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| |c_#memory_$Pointer$#0.base|)) (.cse1 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse1 0) 0) (= |c_ULTIMATE.start_create_internal_#t~ret5#1.base| .cse2) (= |c_#memory_$Pointer$#0.base| (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| .cse2 (select |c_#memory_$Pointer$#0.base| .cse2))) (= (select .cse1 8) 0)))) (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse3 8) 0) (= (select .cse3 0) 0)))) (= (select .cse0 0) 0))) is different from false [2023-11-29 00:13:13,730 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (<= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (not (= |c_ULTIMATE.start_create_internal_#t~ret5#1.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse0 8) 0) (or (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| |c_#memory_$Pointer$#0.base|)) (.cse1 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse1 0) 0) (= |c_ULTIMATE.start_create_internal_#t~ret5#1.base| .cse2) (= |c_#memory_$Pointer$#0.base| (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| .cse2 (select |c_#memory_$Pointer$#0.base| .cse2))) (= (select .cse1 8) 0)))) (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse3 8) 0) (= (select .cse3 0) 0)))) (= (select .cse0 0) 0))) is different from true [2023-11-29 00:13:13,893 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (store (select |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base) 0 0))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (store (select |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base) 0 0)) |c_#memory_$Pointer$#0.offset|))) is different from true [2023-11-29 00:13:13,909 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:13:13,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:13:13,920 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:13:13,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:13:13,975 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 23 treesize of output 16 [2023-11-29 00:13:13,982 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 23 treesize of output 16 [2023-11-29 00:13:14,137 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-11-29 00:13:14,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 31 [2023-11-29 00:13:14,170 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-11-29 00:13:14,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2023-11-29 00:13:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 00:13:14,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:14,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627098582] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:14,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:14,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2023-11-29 00:13:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087253876] [2023-11-29 00:13:14,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:14,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 00:13:14,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:14,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 00:13:14,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1150, Unknown=5, NotChecked=138, Total=1406 [2023-11-29 00:13:14,944 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 34 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 00:13:15,382 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (= (select .cse5 8) 0)) (.cse4 (= (select .cse5 0) 0)) (.cse1 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and .cse0 (<= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (not (= |c_ULTIMATE.start_create_internal_#t~ret5#1.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse1 8) 0) (or (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| |c_#memory_$Pointer$#0.base|)) (.cse2 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse2 0) 0) (= |c_ULTIMATE.start_create_internal_#t~ret5#1.base| .cse3) (= |c_#memory_$Pointer$#0.base| (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| .cse3 (select |c_#memory_$Pointer$#0.base| .cse3))) (= (select .cse2 8) 0)))) (and .cse0 .cse4)) .cse4 (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (= (select .cse1 0) 0)))) is different from false [2023-11-29 00:13:15,385 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (= (select .cse5 8) 0)) (.cse4 (= (select .cse5 0) 0)) (.cse1 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and .cse0 (<= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (not (= |c_ULTIMATE.start_create_internal_#t~ret5#1.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse1 8) 0) (or (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| |c_#memory_$Pointer$#0.base|)) (.cse2 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse2 0) 0) (= |c_ULTIMATE.start_create_internal_#t~ret5#1.base| .cse3) (= |c_#memory_$Pointer$#0.base| (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_37| .cse3 (select |c_#memory_$Pointer$#0.base| .cse3))) (= (select .cse2 8) 0)))) (and .cse0 .cse4)) .cse4 (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (= (select .cse1 0) 0)))) is different from true [2023-11-29 00:13:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:15,897 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2023-11-29 00:13:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 00:13:15,898 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-11-29 00:13:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:15,899 INFO L225 Difference]: With dead ends: 115 [2023-11-29 00:13:15,899 INFO L226 Difference]: Without dead ends: 115 [2023-11-29 00:13:15,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=194, Invalid=2067, Unknown=7, NotChecked=282, Total=2550 [2023-11-29 00:13:15,901 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 39 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:15,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 691 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 711 Invalid, 0 Unknown, 245 Unchecked, 0.5s Time] [2023-11-29 00:13:15,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-29 00:13:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 86. [2023-11-29 00:13:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.323076923076923) internal successors, (86), 77 states have internal predecessors, (86), 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-29 00:13:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2023-11-29 00:13:15,905 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 31 [2023-11-29 00:13:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:15,906 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2023-11-29 00:13:15,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 00:13:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2023-11-29 00:13:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:13:15,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:15,907 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:15,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 00:13:16,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:16,111 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:16,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:16,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1571655847, now seen corresponding path program 1 times [2023-11-29 00:13:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:16,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415230572] [2023-11-29 00:13:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:16,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:13:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 00:13:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415230572] [2023-11-29 00:13:16,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415230572] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818614202] [2023-11-29 00:13:16,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:16,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:16,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:16,651 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:16,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 00:13:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:16,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-29 00:13:16,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:16,866 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-29 00:13:16,905 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 15 treesize of output 1 [2023-11-29 00:13:17,001 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2023-11-29 00:13:17,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:13:17,008 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-29 00:13:17,033 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2023-11-29 00:13:17,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 00:13:17,092 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 29 treesize of output 13 [2023-11-29 00:13:17,098 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 17 treesize of output 9 [2023-11-29 00:13:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:17,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:17,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818614202] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:17,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:17,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 27 [2023-11-29 00:13:17,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072345841] [2023-11-29 00:13:17,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:17,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 00:13:17,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:17,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 00:13:17,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=786, Unknown=1, NotChecked=56, Total=930 [2023-11-29 00:13:17,265 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 28 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 00:13:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:17,738 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2023-11-29 00:13:17,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:13:17,739 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2023-11-29 00:13:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:17,739 INFO L225 Difference]: With dead ends: 107 [2023-11-29 00:13:17,740 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 00:13:17,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=1070, Unknown=1, NotChecked=66, Total=1260 [2023-11-29 00:13:17,741 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 18 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:17,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 725 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 607 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2023-11-29 00:13:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 00:13:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2023-11-29 00:13:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 91 states have internal predecessors, (104), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:13:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2023-11-29 00:13:17,745 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 32 [2023-11-29 00:13:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:17,745 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2023-11-29 00:13:17,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 00:13:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2023-11-29 00:13:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:13:17,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:17,747 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:17,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 00:13:17,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:17,947 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:17,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1571655846, now seen corresponding path program 1 times [2023-11-29 00:13:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:17,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259574839] [2023-11-29 00:13:17,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:17,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:18,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:18,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:13:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:18,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 00:13:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:18,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259574839] [2023-11-29 00:13:18,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259574839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395016617] [2023-11-29 00:13:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:18,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:18,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:18,729 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:18,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 00:13:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:18,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 00:13:18,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:18,952 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-29 00:13:19,046 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 11 treesize of output 7 [2023-11-29 00:13:19,053 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 15 treesize of output 1 [2023-11-29 00:13:19,177 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2023-11-29 00:13:19,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:13:19,187 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 27 treesize of output 20 [2023-11-29 00:13:19,202 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-11-29 00:13:19,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 00:13:19,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 00:13:19,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 00:13:19,290 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 29 treesize of output 13 [2023-11-29 00:13:19,295 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 27 treesize of output 11 [2023-11-29 00:13:19,302 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 17 treesize of output 9 [2023-11-29 00:13:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:19,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:19,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395016617] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:19,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:19,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2023-11-29 00:13:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661919298] [2023-11-29 00:13:19,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:19,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 00:13:19,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:19,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 00:13:19,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1080, Unknown=1, NotChecked=66, Total=1260 [2023-11-29 00:13:19,618 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 32 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 27 states have internal predecessors, (50), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 00:13:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:24,345 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2023-11-29 00:13:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 00:13:24,346 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 27 states have internal predecessors, (50), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2023-11-29 00:13:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:24,347 INFO L225 Difference]: With dead ends: 106 [2023-11-29 00:13:24,347 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 00:13:24,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=150, Invalid=1412, Unknown=2, NotChecked=76, Total=1640 [2023-11-29 00:13:24,348 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:24,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 758 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 602 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2023-11-29 00:13:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 00:13:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2023-11-29 00:13:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.3) internal successors, (104), 92 states have internal predecessors, (104), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:13:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2023-11-29 00:13:24,351 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 32 [2023-11-29 00:13:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:24,351 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2023-11-29 00:13:24,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 27 states have internal predecessors, (50), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 00:13:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2023-11-29 00:13:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:13:24,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:24,352 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:24,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-29 00:13:24,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:24,553 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:24,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:24,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1973456328, now seen corresponding path program 1 times [2023-11-29 00:13:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:24,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846472079] [2023-11-29 00:13:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:24,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:24,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:24,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846472079] [2023-11-29 00:13:24,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846472079] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035726537] [2023-11-29 00:13:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:24,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:24,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:24,809 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:24,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 00:13:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:24,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 00:13:24,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:24,937 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-29 00:13:25,017 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 00:13:25,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 00:13:25,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-11-29 00:13:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:25,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035726537] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:13:25,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:13:25,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2023-11-29 00:13:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808655087] [2023-11-29 00:13:25,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:25,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 00:13:25,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 00:13:25,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2023-11-29 00:13:25,491 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 31 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:13:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:26,333 INFO L93 Difference]: Finished difference Result 152 states and 174 transitions. [2023-11-29 00:13:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 00:13:26,334 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2023-11-29 00:13:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:26,335 INFO L225 Difference]: With dead ends: 152 [2023-11-29 00:13:26,335 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 00:13:26,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1554, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 00:13:26,336 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 112 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:26,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 468 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:13:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 00:13:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 107. [2023-11-29 00:13:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 96 states have internal predecessors, (111), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:13:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2023-11-29 00:13:26,340 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 32 [2023-11-29 00:13:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:26,340 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2023-11-29 00:13:26,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:13:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2023-11-29 00:13:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:13:26,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:26,341 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:26,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-29 00:13:26,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 00:13:26,542 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:26,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1973456327, now seen corresponding path program 1 times [2023-11-29 00:13:26,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:26,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457330089] [2023-11-29 00:13:26,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:26,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:26,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:13:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457330089] [2023-11-29 00:13:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457330089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:26,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:13:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757356982] [2023-11-29 00:13:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:26,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:13:26,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:26,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:13:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:13:26,692 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 9 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:13:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:26,893 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2023-11-29 00:13:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:13:26,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-11-29 00:13:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:26,895 INFO L225 Difference]: With dead ends: 173 [2023-11-29 00:13:26,895 INFO L226 Difference]: Without dead ends: 173 [2023-11-29 00:13:26,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:13:26,896 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:26,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 231 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:13:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-29 00:13:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 148. [2023-11-29 00:13:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.3253968253968254) internal successors, (167), 137 states have internal predecessors, (167), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:13:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 183 transitions. [2023-11-29 00:13:26,900 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 183 transitions. Word has length 32 [2023-11-29 00:13:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:26,900 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 183 transitions. [2023-11-29 00:13:26,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:13:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 183 transitions. [2023-11-29 00:13:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:13:26,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:26,901 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:26,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 00:13:26,901 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:26,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1047605441, now seen corresponding path program 1 times [2023-11-29 00:13:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692630326] [2023-11-29 00:13:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:13:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:26,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692630326] [2023-11-29 00:13:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692630326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:26,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:26,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:13:26,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023535275] [2023-11-29 00:13:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:26,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:13:26,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:26,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:13:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:13:26,989 INFO L87 Difference]: Start difference. First operand 148 states and 183 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:13:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:27,117 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2023-11-29 00:13:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:13:27,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-29 00:13:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:27,119 INFO L225 Difference]: With dead ends: 157 [2023-11-29 00:13:27,119 INFO L226 Difference]: Without dead ends: 157 [2023-11-29 00:13:27,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:13:27,120 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:27,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 271 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:13:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-29 00:13:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2023-11-29 00:13:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 138 states have internal predecessors, (165), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:13:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 181 transitions. [2023-11-29 00:13:27,124 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 181 transitions. Word has length 33 [2023-11-29 00:13:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:27,124 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 181 transitions. [2023-11-29 00:13:27,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:13:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 181 transitions. [2023-11-29 00:13:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 00:13:27,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:27,125 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:27,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 00:13:27,125 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:27,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:27,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1884053118, now seen corresponding path program 1 times [2023-11-29 00:13:27,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:27,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116720574] [2023-11-29 00:13:27,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:27,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:27,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:27,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:13:27,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:27,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116720574] [2023-11-29 00:13:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116720574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:27,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:27,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:13:27,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236764474] [2023-11-29 00:13:27,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:27,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:13:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:27,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:13:27,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:13:27,247 INFO L87 Difference]: Start difference. First operand 149 states and 181 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:13:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:27,397 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2023-11-29 00:13:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:13:27,397 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-11-29 00:13:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:27,398 INFO L225 Difference]: With dead ends: 155 [2023-11-29 00:13:27,398 INFO L226 Difference]: Without dead ends: 155 [2023-11-29 00:13:27,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:13:27,399 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 32 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:27,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 239 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:13:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-29 00:13:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2023-11-29 00:13:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 130 states have (on average 1.3153846153846154) internal successors, (171), 141 states have internal predecessors, (171), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:13:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 187 transitions. [2023-11-29 00:13:27,404 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 187 transitions. Word has length 34 [2023-11-29 00:13:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:27,404 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 187 transitions. [2023-11-29 00:13:27,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:13:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2023-11-29 00:13:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 00:13:27,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:27,404 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:27,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 00:13:27,404 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:27,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:27,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1760716981, now seen corresponding path program 2 times [2023-11-29 00:13:27,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:27,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132212625] [2023-11-29 00:13:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:28,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 00:13:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:28,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 00:13:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:28,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132212625] [2023-11-29 00:13:28,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132212625] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602515204] [2023-11-29 00:13:28,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:13:28,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:28,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:28,615 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:28,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 00:13:28,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:13:28,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:13:28,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-29 00:13:28,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:28,820 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-29 00:13:28,873 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 11 treesize of output 7 [2023-11-29 00:13:28,877 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 11 treesize of output 7 [2023-11-29 00:13:28,913 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 19 treesize of output 18 [2023-11-29 00:13:28,921 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 19 treesize of output 18 [2023-11-29 00:13:28,981 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:13:28,982 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 11 treesize of output 11 [2023-11-29 00:13:29,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2023-11-29 00:13:29,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-11-29 00:13:29,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 8 treesize of output 1 [2023-11-29 00:13:29,359 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (<= (select |c_#length| alloc_and_zero_internal_~pi~1.base) 8) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2023-11-29 00:13:29,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:13:29,400 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 00:13:29,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 54 [2023-11-29 00:13:29,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:13:29,422 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 00:13:29,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-11-29 00:13:29,437 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:13:29,437 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 11 treesize of output 11 [2023-11-29 00:13:29,847 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 00:13:29,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 65 [2023-11-29 00:13:29,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2023-11-29 00:13:30,144 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-29 00:13:30,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 90 [2023-11-29 00:13:30,177 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2023-11-29 00:13:30,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 125 [2023-11-29 00:13:30,190 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2023-11-29 00:13:30,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 109 treesize of output 95 [2023-11-29 00:13:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:30,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:30,798 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 57 treesize of output 48 [2023-11-29 00:13:31,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602515204] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:31,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:31,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 35 [2023-11-29 00:13:31,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685262851] [2023-11-29 00:13:31,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:31,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 00:13:31,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:31,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 00:13:31,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1370, Unknown=1, NotChecked=74, Total=1560 [2023-11-29 00:13:31,051 INFO L87 Difference]: Start difference. First operand 152 states and 187 transitions. Second operand has 35 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 29 states have internal predecessors, (51), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 00:13:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:33,904 INFO L93 Difference]: Finished difference Result 198 states and 238 transitions. [2023-11-29 00:13:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:13:33,905 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 29 states have internal predecessors, (51), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2023-11-29 00:13:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:33,906 INFO L225 Difference]: With dead ends: 198 [2023-11-29 00:13:33,906 INFO L226 Difference]: Without dead ends: 198 [2023-11-29 00:13:33,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=219, Invalid=2539, Unknown=2, NotChecked=102, Total=2862 [2023-11-29 00:13:33,907 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 43 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:33,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1515 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1241 Invalid, 0 Unknown, 114 Unchecked, 1.0s Time] [2023-11-29 00:13:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-29 00:13:33,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 153. [2023-11-29 00:13:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.3129770992366412) internal successors, (172), 142 states have internal predecessors, (172), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:13:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2023-11-29 00:13:33,912 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 35 [2023-11-29 00:13:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:33,913 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2023-11-29 00:13:33,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 29 states have internal predecessors, (51), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 00:13:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2023-11-29 00:13:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 00:13:33,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:33,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:33,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 00:13:34,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:34,114 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:34,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1193969794, now seen corresponding path program 1 times [2023-11-29 00:13:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176644595] [2023-11-29 00:13:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:34,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:34,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:34,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176644595] [2023-11-29 00:13:34,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176644595] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:34,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254182982] [2023-11-29 00:13:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:34,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:34,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:34,506 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:34,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 00:13:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:34,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 00:13:34,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:34,701 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-29 00:13:34,767 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 11 treesize of output 7 [2023-11-29 00:13:34,772 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 11 treesize of output 7 [2023-11-29 00:13:34,815 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:13:34,815 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 11 treesize of output 11 [2023-11-29 00:13:34,921 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 16 treesize of output 11 [2023-11-29 00:13:34,924 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 16 treesize of output 11 [2023-11-29 00:13:35,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:13:35,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 00:13:35,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:13:35,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 00:13:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:13:35,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:35,192 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1911 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_set_~x#1.base| v_ArrVal_1911) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_1912 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_set_~x#1.base| v_ArrVal_1912) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2023-11-29 00:13:35,206 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1911 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1911) |c_ULTIMATE.start_create_internal_~sll~0#1.base|) 0) 0)) (forall ((v_ArrVal_1912 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1912) |c_ULTIMATE.start_create_internal_~sll~0#1.base|) 0) 0))) is different from false [2023-11-29 00:13:35,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:13:35,385 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 37 treesize of output 38 [2023-11-29 00:13:35,389 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 50 treesize of output 42 [2023-11-29 00:13:35,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:13:35,397 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 29 treesize of output 30 [2023-11-29 00:13:35,400 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 34 [2023-11-29 00:13:35,404 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 19 [2023-11-29 00:13:35,407 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 19 treesize of output 17 [2023-11-29 00:13:35,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:13:35,586 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 18 treesize of output 19 [2023-11-29 00:13:35,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:13:35,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2023-11-29 00:13:35,597 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 9 treesize of output 7 [2023-11-29 00:13:35,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:13:35,615 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 18 treesize of output 19 [2023-11-29 00:13:35,617 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:13:35,622 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 00:13:35,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 00:13:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-29 00:13:35,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254182982] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:13:35,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:13:35,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 38 [2023-11-29 00:13:35,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198526435] [2023-11-29 00:13:35,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:35,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 00:13:35,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:35,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 00:13:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1151, Unknown=27, NotChecked=138, Total=1406 [2023-11-29 00:13:35,831 INFO L87 Difference]: Start difference. First operand 153 states and 188 transitions. Second operand has 38 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:13:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:37,003 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2023-11-29 00:13:37,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:13:37,004 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2023-11-29 00:13:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:37,005 INFO L225 Difference]: With dead ends: 167 [2023-11-29 00:13:37,005 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 00:13:37,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=173, Invalid=2062, Unknown=29, NotChecked=186, Total=2450 [2023-11-29 00:13:37,006 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 78 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:37,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 689 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 882 Invalid, 0 Unknown, 146 Unchecked, 0.7s Time] [2023-11-29 00:13:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 00:13:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2023-11-29 00:13:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 149 states have internal predecessors, (179), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:13:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2023-11-29 00:13:37,010 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 37 [2023-11-29 00:13:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:37,011 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2023-11-29 00:13:37,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:13:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2023-11-29 00:13:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 00:13:37,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:37,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:37,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 00:13:37,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-29 00:13:37,212 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-11-29 00:13:37,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:37,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1327675699, now seen corresponding path program 2 times [2023-11-29 00:13:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:37,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895686586] [2023-11-29 00:13:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:13:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:38,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:13:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:38,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 00:13:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:38,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:13:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:13:38,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:38,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895686586] [2023-11-29 00:13:38,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895686586] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:38,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117254817] [2023-11-29 00:13:38,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:13:38,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:13:38,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:38,719 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:13:38,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb08632-1de3-43b9-9a11-ad44cf4169a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 00:13:38,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:13:38,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:13:38,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 00:13:38,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:38,882 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-29 00:13:38,920 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 11 treesize of output 7 [2023-11-29 00:13:38,924 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 11 treesize of output 7 [2023-11-29 00:13:38,933 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 19 treesize of output 18 [2023-11-29 00:13:38,940 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 19 treesize of output 18 [2023-11-29 00:13:39,326 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 00:13:39,326 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 20 [2023-11-29 00:13:39,344 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 00:13:39,345 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 20 [2023-11-29 00:13:39,369 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 00:13:39,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 00:13:39,674 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 00:13:39,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 00:13:39,694 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (not (= |c_ULTIMATE.start_create_internal_#t~ret7#1.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse0 8) 0) (or (exists ((|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_#memory_$Pointer$#0.base|)) (.cse1 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse1 0) 0) (= .cse2 |c_ULTIMATE.start_create_internal_#t~ret7#1.base|) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse2 (select |c_#memory_$Pointer$#0.base| .cse2))) (= (select .cse1 8) 0)))) (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse3 8) 0) (= (select .cse3 0) 0)))) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (not (= |c_ULTIMATE.start_create_internal_#t~ret7#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| |c_ULTIMATE.start_create_internal_~now~0#1.base|) (= (select .cse0 0) 0))) is different from false [2023-11-29 00:13:39,697 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (not (= |c_ULTIMATE.start_create_internal_#t~ret7#1.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse0 8) 0) (or (exists ((|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_#memory_$Pointer$#0.base|)) (.cse1 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse1 0) 0) (= .cse2 |c_ULTIMATE.start_create_internal_#t~ret7#1.base|) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse2 (select |c_#memory_$Pointer$#0.base| .cse2))) (= (select .cse1 8) 0)))) (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse3 8) 0) (= (select .cse3 0) 0)))) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (not (= |c_ULTIMATE.start_create_internal_#t~ret7#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| |c_ULTIMATE.start_create_internal_~now~0#1.base|) (= (select .cse0 0) 0))) is different from true [2023-11-29 00:13:39,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 00:13:39,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:13:39,784 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_internal_~now~0#1.base|) |c_ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (or (exists ((|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse1 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse0 0) 0) (= .cse1 .cse2) (= (select .cse0 8) 0) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse1 (select |v_#memory_$Pointer$#0.base_231| .cse1)) |v_#memory_$Pointer$#0.base_231|)))) (= (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~now~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~now~0#1.base|) |c_ULTIMATE.start_create_internal_~now~0#1.offset| .cse2)) |c_#memory_$Pointer$#0.base|))) (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse3 8) 0) (= (select .cse3 0) 0)))) (= (select .cse4 8) 0) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| |c_ULTIMATE.start_create_internal_~now~0#1.base|) (= (select .cse4 0) 0) (not (= .cse2 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)))) is different from false [2023-11-29 00:13:39,787 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_internal_~now~0#1.base|) |c_ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (or (exists ((|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse1 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse0 0) 0) (= .cse1 .cse2) (= (select .cse0 8) 0) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse1 (select |v_#memory_$Pointer$#0.base_231| .cse1)) |v_#memory_$Pointer$#0.base_231|)))) (= (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~now~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~now~0#1.base|) |c_ULTIMATE.start_create_internal_~now~0#1.offset| .cse2)) |c_#memory_$Pointer$#0.base|))) (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse3 8) 0) (= (select .cse3 0) 0)))) (= (select .cse4 8) 0) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| |c_ULTIMATE.start_create_internal_~now~0#1.base|) (= (select .cse4 0) 0) (not (= .cse2 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)))) is different from true [2023-11-29 00:13:39,856 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse0 8) 0) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|))) (or (exists ((|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int)) (let ((.cse1 (select .cse4 |v_ULTIMATE.start_create_internal_~now~0#1.offset_46|))) (and (= .cse1 |c_ULTIMATE.start_create_internal_~now~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (exists ((|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse1)) |c_#memory_$Pointer$#0.base|) (exists ((|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse3 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse2 0) 0) (= (select .cse2 8) 0) (= .cse3 .cse1) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse3 (select |v_#memory_$Pointer$#0.base_231| .cse3)) |v_#memory_$Pointer$#0.base_231|)))))) (not (= .cse1 |c_ULTIMATE.start_main_~l~0#1.base|))))) (let ((.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse5 8) 0) (= (select .cse5 0) 0) (exists ((|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int)) (let ((.cse6 (select .cse4 |v_ULTIMATE.start_create_internal_~now~0#1.offset_46|))) (and (= .cse6 |c_ULTIMATE.start_create_internal_~now~0#1.base|) (not (= .cse6 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (not (= .cse6 |c_ULTIMATE.start_main_~l~0#1.base|))))))))) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (select .cse0 0) 0))) is different from false [2023-11-29 00:13:39,860 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse0 8) 0) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|))) (or (exists ((|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int)) (let ((.cse1 (select .cse4 |v_ULTIMATE.start_create_internal_~now~0#1.offset_46|))) (and (= .cse1 |c_ULTIMATE.start_create_internal_~now~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (exists ((|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse1)) |c_#memory_$Pointer$#0.base|) (exists ((|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse3 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse2 0) 0) (= (select .cse2 8) 0) (= .cse3 .cse1) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse3 (select |v_#memory_$Pointer$#0.base_231| .cse3)) |v_#memory_$Pointer$#0.base_231|)))))) (not (= .cse1 |c_ULTIMATE.start_main_~l~0#1.base|))))) (let ((.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse5 8) 0) (= (select .cse5 0) 0) (exists ((|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int)) (let ((.cse6 (select .cse4 |v_ULTIMATE.start_create_internal_~now~0#1.offset_46|))) (and (= .cse6 |c_ULTIMATE.start_create_internal_~now~0#1.base|) (not (= .cse6 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (not (= .cse6 |c_ULTIMATE.start_main_~l~0#1.base|))))))))) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (select .cse0 0) 0))) is different from true [2023-11-29 00:13:40,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 00:13:40,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-29 00:13:40,155 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (store (select |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base) 0 0))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (store (select |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base) 0 0)) |c_#memory_$Pointer$#0.offset|))) is different from true [2023-11-29 00:13:40,217 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:13:40,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:13:40,301 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2023-11-29 00:13:40,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 54 [2023-11-29 00:13:40,409 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (or (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse0 8) 0) (not (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| |c_ULTIMATE.start_create_internal_~now~0#1.base|)) (= (select .cse0 0) 0) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~now~0#1.base|)) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|))) (or (and (exists ((|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int)) (= (select .cse1 |v_ULTIMATE.start_create_internal_~now~0#1.offset_46|) |c_ULTIMATE.start_create_internal_~now~0#1.base|)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (= (select (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base) 0) 0)))) (and (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) 0) 0)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (exists ((|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse3 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse2 0) 0) (not (= .cse3 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse2 8) 0) (= (let ((.cse4 (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse3)))) (store .cse4 alloc_and_zero_internal_~pi~1.base (store (select .cse4 alloc_and_zero_internal_~pi~1.base) 0 0))) |c_#memory_$Pointer$#0.base|) (= .cse3 |c_ULTIMATE.start_create_internal_~now~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse3 (select |v_#memory_$Pointer$#0.base_231| .cse3)) |v_#memory_$Pointer$#0.base_231|))))))) (= (select .cse5 8) 0) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (select .cse5 0) 0))) is different from false [2023-11-29 00:13:40,413 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (or (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse0 8) 0) (not (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| |c_ULTIMATE.start_create_internal_~now~0#1.base|)) (= (select .cse0 0) 0) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~now~0#1.base|)) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|))) (or (and (exists ((|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int)) (= (select .cse1 |v_ULTIMATE.start_create_internal_~now~0#1.offset_46|) |c_ULTIMATE.start_create_internal_~now~0#1.base|)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (= (select (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base) 0) 0)))) (and (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) 0) 0)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (exists ((|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse3 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse2 0) 0) (not (= .cse3 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse2 8) 0) (= (let ((.cse4 (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse3)))) (store .cse4 alloc_and_zero_internal_~pi~1.base (store (select .cse4 alloc_and_zero_internal_~pi~1.base) 0 0))) |c_#memory_$Pointer$#0.base|) (= .cse3 |c_ULTIMATE.start_create_internal_~now~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse3 (select |v_#memory_$Pointer$#0.base_231| .cse3)) |v_#memory_$Pointer$#0.base_231|))))))) (= (select .cse5 8) 0) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (select .cse5 0) 0))) is different from true [2023-11-29 00:13:40,530 INFO L349 Elim1Store]: treesize reduction 88, result has 29.6 percent of original size [2023-11-29 00:13:40,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 167 treesize of output 185 [2023-11-29 00:13:41,347 INFO L349 Elim1Store]: treesize reduction 70, result has 18.6 percent of original size [2023-11-29 00:13:41,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 63 [2023-11-29 00:13:41,400 INFO L349 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2023-11-29 00:13:41,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:13:41,517 INFO L349 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-11-29 00:13:41,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 52 [2023-11-29 00:13:41,553 INFO L349 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-11-29 00:13:41,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 52 [2023-11-29 00:13:41,626 INFO L349 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2023-11-29 00:13:41,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 61 [2023-11-29 00:13:41,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-11-29 00:13:41,691 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 29 treesize of output 27 [2023-11-29 00:13:45,788 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse0 8) 0) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (let ((.cse21 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|))) (let ((.cse11 (exists ((|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse23 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse24 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse23 0) 0) (not (= .cse24 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse23 8) 0) (not (= .cse24 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse24 (select |v_#memory_$Pointer$#0.base_231| .cse24)) |v_#memory_$Pointer$#0.base_231|) (= |c_#memory_$Pointer$#0.base| (store (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse24)) .cse24 (select |c_#memory_$Pointer$#0.base| .cse24))))))) (.cse6 (exists ((v_prenex_27 Int)) (let ((.cse22 (select .cse5 v_prenex_27))) (and (not (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| .cse22)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse22)))))) (.cse1 (= (select .cse21 8) 0)) (.cse2 (= (select .cse21 0) 0))) (or (and .cse1 .cse2 (or (exists ((v_prenex_27 Int)) (let ((.cse3 (select .cse5 v_prenex_27))) (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| .cse3))) (and (not (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse3)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) .cse4)) (= (select .cse4 0) 0))))) (and .cse6 (exists ((v_prenex_26 Int) (alloc_and_zero_internal_~pi~1.base Int)) (let ((.cse7 (select |c_#memory_$Pointer$#0.offset| v_prenex_26))) (and (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (= (select .cse7 0) 0) (= .cse7 (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)))))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse9 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse8 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (not (= .cse9 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse8 8) 0) (= (store (let ((.cse10 (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse9)))) (store .cse10 alloc_and_zero_internal_~pi~1.base (store (select .cse10 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse9 (select |c_#memory_$Pointer$#0.base| .cse9)) |c_#memory_$Pointer$#0.base|) (not (= .cse9 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse9 (select |v_#memory_$Pointer$#0.base_231| .cse9)) |v_#memory_$Pointer$#0.base_231|)))) (and .cse11 (exists ((v_prenex_26 Int)) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0))) (and .cse1 .cse2 .cse6) .cse11 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse13 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse12 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (not (= .cse13 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse12 8) 0) (= (store (let ((.cse14 (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse13)))) (store .cse14 alloc_and_zero_internal_~pi~1.base (store (select .cse14 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse13 (select |c_#memory_$Pointer$#0.base| .cse13)) |c_#memory_$Pointer$#0.base|) (not (= .cse13 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse13 (select |v_#memory_$Pointer$#0.base_231| .cse13)) |v_#memory_$Pointer$#0.base_231|) (not (= .cse13 alloc_and_zero_internal_~pi~1.base))))) (and .cse1 (or (exists ((v_prenex_27 Int)) (let ((.cse15 (select .cse5 v_prenex_27))) (and (not (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| .cse15)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse15)) (= (select (select |c_#memory_$Pointer$#0.offset| .cse15) 0) 0)))) (and .cse6 (exists ((v_prenex_26 Int)) (and (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0))))) .cse2) (and .cse1 .cse2 (or (and (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) 0) 0)) .cse6)) (and .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0)) .cse2 .cse6) (exists ((v_prenex_26 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse18 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse17 (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base))) (and (= (select .cse16 0) 0) (= (select .cse17 0) 0) (not (= .cse18 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse16 8) 0) (= (store (let ((.cse19 (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse18)))) (store .cse19 alloc_and_zero_internal_~pi~1.base (store (select .cse19 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse18 (select |c_#memory_$Pointer$#0.base| .cse18)) |c_#memory_$Pointer$#0.base|) (not (= .cse18 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse18 (select |v_#memory_$Pointer$#0.base_231| .cse18)) |v_#memory_$Pointer$#0.base_231|) (= (select |c_#memory_$Pointer$#0.offset| v_prenex_26) .cse17)))) (and .cse1 (exists ((v_prenex_27 Int) (v_prenex_26 Int)) (let ((.cse20 (select .cse5 v_prenex_27))) (and (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (not (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| .cse20)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse20)) (not (= v_prenex_26 .cse20)) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0)))) .cse2)))) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (select .cse0 0) 0))) is different from false [2023-11-29 00:13:45,796 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (and (= (select .cse0 8) 0) (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (let ((.cse21 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|))) (let ((.cse11 (exists ((|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse23 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse24 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse23 0) 0) (not (= .cse24 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse23 8) 0) (not (= .cse24 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse24 (select |v_#memory_$Pointer$#0.base_231| .cse24)) |v_#memory_$Pointer$#0.base_231|) (= |c_#memory_$Pointer$#0.base| (store (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse24)) .cse24 (select |c_#memory_$Pointer$#0.base| .cse24))))))) (.cse6 (exists ((v_prenex_27 Int)) (let ((.cse22 (select .cse5 v_prenex_27))) (and (not (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| .cse22)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse22)))))) (.cse1 (= (select .cse21 8) 0)) (.cse2 (= (select .cse21 0) 0))) (or (and .cse1 .cse2 (or (exists ((v_prenex_27 Int)) (let ((.cse3 (select .cse5 v_prenex_27))) (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| .cse3))) (and (not (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse3)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) .cse4)) (= (select .cse4 0) 0))))) (and .cse6 (exists ((v_prenex_26 Int) (alloc_and_zero_internal_~pi~1.base Int)) (let ((.cse7 (select |c_#memory_$Pointer$#0.offset| v_prenex_26))) (and (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (= (select .cse7 0) 0) (= .cse7 (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)))))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse9 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse8 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (not (= .cse9 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse8 8) 0) (= (store (let ((.cse10 (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse9)))) (store .cse10 alloc_and_zero_internal_~pi~1.base (store (select .cse10 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse9 (select |c_#memory_$Pointer$#0.base| .cse9)) |c_#memory_$Pointer$#0.base|) (not (= .cse9 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse9 (select |v_#memory_$Pointer$#0.base_231| .cse9)) |v_#memory_$Pointer$#0.base_231|)))) (and .cse11 (exists ((v_prenex_26 Int)) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0))) (and .cse1 .cse2 .cse6) .cse11 (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse13 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|))) (and (= (select .cse12 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (not (= .cse13 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse12 8) 0) (= (store (let ((.cse14 (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse13)))) (store .cse14 alloc_and_zero_internal_~pi~1.base (store (select .cse14 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse13 (select |c_#memory_$Pointer$#0.base| .cse13)) |c_#memory_$Pointer$#0.base|) (not (= .cse13 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse13 (select |v_#memory_$Pointer$#0.base_231| .cse13)) |v_#memory_$Pointer$#0.base_231|) (not (= .cse13 alloc_and_zero_internal_~pi~1.base))))) (and .cse1 (or (exists ((v_prenex_27 Int)) (let ((.cse15 (select .cse5 v_prenex_27))) (and (not (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| .cse15)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse15)) (= (select (select |c_#memory_$Pointer$#0.offset| .cse15) 0) 0)))) (and .cse6 (exists ((v_prenex_26 Int)) (and (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0))))) .cse2) (and .cse1 .cse2 (or (and (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) 0) 0)) .cse6)) (and .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0)) .cse2 .cse6) (exists ((v_prenex_26 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse18 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse17 (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base))) (and (= (select .cse16 0) 0) (= (select .cse17 0) 0) (not (= .cse18 |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select .cse16 8) 0) (= (store (let ((.cse19 (store |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |c_ULTIMATE.start_create_internal_~sll~0#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse18)))) (store .cse19 alloc_and_zero_internal_~pi~1.base (store (select .cse19 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse18 (select |c_#memory_$Pointer$#0.base| .cse18)) |c_#memory_$Pointer$#0.base|) (not (= .cse18 |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse18 (select |v_#memory_$Pointer$#0.base_231| .cse18)) |v_#memory_$Pointer$#0.base_231|) (= (select |c_#memory_$Pointer$#0.offset| v_prenex_26) .cse17)))) (and .cse1 (exists ((v_prenex_27 Int) (v_prenex_26 Int)) (let ((.cse20 (select .cse5 v_prenex_27))) (and (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (not (= |c_ULTIMATE.start_create_internal_~sll~0#1.base| .cse20)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| .cse20)) (not (= v_prenex_26 .cse20)) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0)))) .cse2)))) (not (= |c_ULTIMATE.start_main_~l~0#1.base| |c_ULTIMATE.start_create_internal_~sll~0#1.base|)) (= (select .cse0 0) 0))) is different from true [2023-11-29 00:13:51,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_set_~x#1.base|))) (and (= (select .cse0 0) 0) (= (select .cse0 8) 0) (let ((.cse24 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_set_~x#1.base|))) (let ((.cse1 (= (select .cse24 8) 0)) (.cse7 (exists ((v_prenex_27 Int) (|ULTIMATE.start_set_~shared#1.base| Int)) (let ((.cse25 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) v_prenex_27))) (and (not (= .cse25 |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| .cse25)))))) (.cse3 (= (select .cse24 0) 0))) (or (and .cse1 (exists ((v_prenex_27 Int) (v_prenex_26 Int) (|ULTIMATE.start_set_~shared#1.base| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) v_prenex_27))) (and (not (= v_prenex_26 .cse2)) (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (not (= .cse2 |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0)))) .cse3) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse5 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_set_~x#1.base|))) (and (= |c_#memory_$Pointer$#0.base| (store (store |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse4)) .cse4 (select |c_#memory_$Pointer$#0.base| .cse4))) (not (= .cse4 |c_ULTIMATE.start_set_~x#1.base|)) (= (select .cse5 0) 0) (not (= .cse4 |ULTIMATE.start_set_~shared#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse4 (select |v_#memory_$Pointer$#0.base_231| .cse4)) |v_#memory_$Pointer$#0.base_231|) (= (select .cse5 8) 0)))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)))) (and .cse1 (or (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_set_~shared#1.base|) 0) 0) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)))) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((v_prenex_27 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) v_prenex_27))) (and (not (= .cse6 |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| .cse6))))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|))))) .cse3) (and .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0)) .cse7 .cse3) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse10 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_set_~x#1.base|))) (and (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (not (= .cse8 |c_ULTIMATE.start_set_~x#1.base|)) (= |c_#memory_$Pointer$#0.base| (store (let ((.cse9 (store |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse8)))) (store .cse9 alloc_and_zero_internal_~pi~1.base (store (select .cse9 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse8 (select |c_#memory_$Pointer$#0.base| .cse8))) (= (select .cse10 0) 0) (not (= .cse8 |ULTIMATE.start_set_~shared#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse8 (select |v_#memory_$Pointer$#0.base_231| .cse8)) |v_#memory_$Pointer$#0.base_231|) (not (= .cse8 alloc_and_zero_internal_~pi~1.base)) (= (select .cse10 8) 0)))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)))) (and .cse1 (or (and .cse7 (exists ((v_prenex_26 Int)) (and (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0)))) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((v_prenex_27 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) v_prenex_27))) (and (not (= .cse11 |c_ULTIMATE.start_set_~x#1.base|)) (= (select (select |c_#memory_$Pointer$#0.offset| .cse11) 0) 0) (not (= |ULTIMATE.start_set_~shared#1.base| .cse11))))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|))))) .cse3) (and .cse1 .cse3 (or (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)) (exists ((v_prenex_27 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) v_prenex_27))) (let ((.cse12 (select |c_#memory_$Pointer$#0.offset| .cse13))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) .cse12)) (not (= .cse13 |c_ULTIMATE.start_set_~x#1.base|)) (= (select .cse12 0) 0) (not (= |ULTIMATE.start_set_~shared#1.base| .cse13)))))))) (and (exists ((v_prenex_26 Int) (alloc_and_zero_internal_~pi~1.base Int)) (let ((.cse14 (select |c_#memory_$Pointer$#0.offset| v_prenex_26))) (and (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (= (select .cse14 0) 0) (= .cse14 (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base))))) .cse7))) (and .cse1 .cse7 .cse3) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse15 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse17 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_set_~x#1.base|))) (and (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (not (= .cse15 |c_ULTIMATE.start_set_~x#1.base|)) (= |c_#memory_$Pointer$#0.base| (store (let ((.cse16 (store |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse15)))) (store .cse16 alloc_and_zero_internal_~pi~1.base (store (select .cse16 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse15 (select |c_#memory_$Pointer$#0.base| .cse15))) (= (select .cse17 0) 0) (not (= .cse15 |ULTIMATE.start_set_~shared#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse15 (select |v_#memory_$Pointer$#0.base_231| .cse15)) |v_#memory_$Pointer$#0.base_231|) (= (select .cse17 8) 0)))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)))) (and (exists ((|ULTIMATE.start_set_~shared#1.base| Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse18 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse19 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_set_~x#1.base|))) (and (= |c_#memory_$Pointer$#0.base| (store (store |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse18)) .cse18 (select |c_#memory_$Pointer$#0.base| .cse18))) (not (= .cse18 |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)) (= (select .cse19 0) 0) (not (= .cse18 |ULTIMATE.start_set_~shared#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse18 (select |v_#memory_$Pointer$#0.base_231| .cse18)) |v_#memory_$Pointer$#0.base_231|) (= (select .cse19 8) 0)))) (exists ((v_prenex_26 Int)) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0))) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((v_prenex_26 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse20 (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) (.cse23 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_set_~x#1.base|))) (and (= (select .cse20 0) 0) (not (= .cse21 |c_ULTIMATE.start_set_~x#1.base|)) (= |c_#memory_$Pointer$#0.base| (store (let ((.cse22 (store |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse21)))) (store .cse22 alloc_and_zero_internal_~pi~1.base (store (select .cse22 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse21 (select |c_#memory_$Pointer$#0.base| .cse21))) (= (select .cse23 0) 0) (not (= .cse21 |ULTIMATE.start_set_~shared#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse21 (select |v_#memory_$Pointer$#0.base_231| .cse21)) |v_#memory_$Pointer$#0.base_231|) (= (select |c_#memory_$Pointer$#0.offset| v_prenex_26) .cse20) (= (select .cse23 8) 0)))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|))))))) (= |c_ULTIMATE.start_set_~x#1.offset| 0))) is different from false [2023-11-29 00:13:51,701 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_set_~x#1.base|))) (and (= (select .cse0 0) 0) (= (select .cse0 8) 0) (let ((.cse24 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_set_~x#1.base|))) (let ((.cse1 (= (select .cse24 8) 0)) (.cse7 (exists ((v_prenex_27 Int) (|ULTIMATE.start_set_~shared#1.base| Int)) (let ((.cse25 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) v_prenex_27))) (and (not (= .cse25 |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| .cse25)))))) (.cse3 (= (select .cse24 0) 0))) (or (and .cse1 (exists ((v_prenex_27 Int) (v_prenex_26 Int) (|ULTIMATE.start_set_~shared#1.base| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) v_prenex_27))) (and (not (= v_prenex_26 .cse2)) (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (not (= .cse2 |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0)))) .cse3) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse5 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_set_~x#1.base|))) (and (= |c_#memory_$Pointer$#0.base| (store (store |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse4)) .cse4 (select |c_#memory_$Pointer$#0.base| .cse4))) (not (= .cse4 |c_ULTIMATE.start_set_~x#1.base|)) (= (select .cse5 0) 0) (not (= .cse4 |ULTIMATE.start_set_~shared#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse4 (select |v_#memory_$Pointer$#0.base_231| .cse4)) |v_#memory_$Pointer$#0.base_231|) (= (select .cse5 8) 0)))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)))) (and .cse1 (or (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_set_~shared#1.base|) 0) 0) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)))) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((v_prenex_27 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) v_prenex_27))) (and (not (= .cse6 |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| .cse6))))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|))))) .cse3) (and .cse1 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0)) .cse7 .cse3) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse10 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_set_~x#1.base|))) (and (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (not (= .cse8 |c_ULTIMATE.start_set_~x#1.base|)) (= |c_#memory_$Pointer$#0.base| (store (let ((.cse9 (store |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse8)))) (store .cse9 alloc_and_zero_internal_~pi~1.base (store (select .cse9 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse8 (select |c_#memory_$Pointer$#0.base| .cse8))) (= (select .cse10 0) 0) (not (= .cse8 |ULTIMATE.start_set_~shared#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse8 (select |v_#memory_$Pointer$#0.base_231| .cse8)) |v_#memory_$Pointer$#0.base_231|) (not (= .cse8 alloc_and_zero_internal_~pi~1.base)) (= (select .cse10 8) 0)))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)))) (and .cse1 (or (and .cse7 (exists ((v_prenex_26 Int)) (and (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0)))) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((v_prenex_27 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) v_prenex_27))) (and (not (= .cse11 |c_ULTIMATE.start_set_~x#1.base|)) (= (select (select |c_#memory_$Pointer$#0.offset| .cse11) 0) 0) (not (= |ULTIMATE.start_set_~shared#1.base| .cse11))))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|))))) .cse3) (and .cse1 .cse3 (or (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)) (exists ((v_prenex_27 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_set_~shared#1.base|) v_prenex_27))) (let ((.cse12 (select |c_#memory_$Pointer$#0.offset| .cse13))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) .cse12)) (not (= .cse13 |c_ULTIMATE.start_set_~x#1.base|)) (= (select .cse12 0) 0) (not (= |ULTIMATE.start_set_~shared#1.base| .cse13)))))))) (and (exists ((v_prenex_26 Int) (alloc_and_zero_internal_~pi~1.base Int)) (let ((.cse14 (select |c_#memory_$Pointer$#0.offset| v_prenex_26))) (and (= (select (select |c_#memory_$Pointer$#0.base| v_prenex_26) 0) 0) (= (select .cse14 0) 0) (= .cse14 (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base))))) .cse7))) (and .cse1 .cse7 .cse3) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse15 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse17 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_set_~x#1.base|))) (and (= (select (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base) 0) 0) (not (= .cse15 |c_ULTIMATE.start_set_~x#1.base|)) (= |c_#memory_$Pointer$#0.base| (store (let ((.cse16 (store |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse15)))) (store .cse16 alloc_and_zero_internal_~pi~1.base (store (select .cse16 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse15 (select |c_#memory_$Pointer$#0.base| .cse15))) (= (select .cse17 0) 0) (not (= .cse15 |ULTIMATE.start_set_~shared#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse15 (select |v_#memory_$Pointer$#0.base_231| .cse15)) |v_#memory_$Pointer$#0.base_231|) (= (select .cse17 8) 0)))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)))) (and (exists ((|ULTIMATE.start_set_~shared#1.base| Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse18 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse19 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_set_~x#1.base|))) (and (= |c_#memory_$Pointer$#0.base| (store (store |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse18)) .cse18 (select |c_#memory_$Pointer$#0.base| .cse18))) (not (= .cse18 |c_ULTIMATE.start_set_~x#1.base|)) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|)) (= (select .cse19 0) 0) (not (= .cse18 |ULTIMATE.start_set_~shared#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse18 (select |v_#memory_$Pointer$#0.base_231| .cse18)) |v_#memory_$Pointer$#0.base_231|) (= (select .cse19 8) 0)))) (exists ((v_prenex_26 Int)) (= (select (select |c_#memory_$Pointer$#0.offset| v_prenex_26) 0) 0))) (exists ((|ULTIMATE.start_set_~shared#1.base| Int)) (and (exists ((v_prenex_26 Int) (alloc_and_zero_internal_~pi~1.base Int) (|v_#memory_$Pointer$#0.base_231| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_internal_~now~0#1.offset_46| Int) (|v_#memory_$Pointer$#0.base_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |v_#memory_$Pointer$#0.base_231|)) (.cse20 (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) (.cse23 (select |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| |c_ULTIMATE.start_set_~x#1.base|))) (and (= (select .cse20 0) 0) (not (= .cse21 |c_ULTIMATE.start_set_~x#1.base|)) (= |c_#memory_$Pointer$#0.base| (store (let ((.cse22 (store |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base| (store (select |v_#memory_$Pointer$#0.base_231| |ULTIMATE.start_set_~shared#1.base|) |v_ULTIMATE.start_create_internal_~now~0#1.offset_46| .cse21)))) (store .cse22 alloc_and_zero_internal_~pi~1.base (store (select .cse22 alloc_and_zero_internal_~pi~1.base) 0 0))) .cse21 (select |c_#memory_$Pointer$#0.base| .cse21))) (= (select .cse23 0) 0) (not (= .cse21 |ULTIMATE.start_set_~shared#1.base|)) (= (store |v_#memory_$Pointer$#0.base_BEFORE_CALL_16| .cse21 (select |v_#memory_$Pointer$#0.base_231| .cse21)) |v_#memory_$Pointer$#0.base_231|) (= (select |c_#memory_$Pointer$#0.offset| v_prenex_26) .cse20) (= (select .cse23 8) 0)))) (not (= |ULTIMATE.start_set_~shared#1.base| |c_ULTIMATE.start_set_~x#1.base|))))))) (= |c_ULTIMATE.start_set_~x#1.offset| 0))) is different from true [2023-11-29 00:13:57,400 INFO L349 Elim1Store]: treesize reduction 1086, result has 19.5 percent of original size [2023-11-29 00:13:57,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 119 case distinctions, treesize of input 825 treesize of output 1034 [2023-11-29 00:15:28,231 WARN L293 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 658 DAG size of output: 658 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:10,816 WARN L293 SmtUtils]: Spent 20.07s on a formula simplification that was a NOOP. DAG size: 978 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:31,718 WARN L293 SmtUtils]: Spent 10.34s on a formula simplification that was a NOOP. DAG size: 969 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:42,349 WARN L293 SmtUtils]: Spent 10.62s on a formula simplification that was a NOOP. DAG size: 1254 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:42,441 WARN L293 SmtUtils]: Spent 23.07s on a formula simplification. DAG size of input: 964 DAG size of output: 962 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:36,432 WARN L293 SmtUtils]: Spent 55.05s on a formula simplification. DAG size of input: 1049 DAG size of output: 1049 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:24:13,623 WARN L293 SmtUtils]: Spent 18.49s on a formula simplification that was a NOOP. DAG size: 1041 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:24:33,215 WARN L293 SmtUtils]: Spent 19.58s on a formula simplification that was a NOOP. DAG size: 1360 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)