./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/dll-middle-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/dll-middle-data.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:08:08,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:08:08,772 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-12-02 14:08:08,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:08:08,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:08:08,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:08:08,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:08:08,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:08:08,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:08:08,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:08:08,807 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:08:08,807 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:08:08,808 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:08:08,808 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:08:08,809 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:08:08,809 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:08:08,810 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:08:08,810 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:08:08,811 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:08:08,811 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:08:08,812 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:08:08,813 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:08:08,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:08:08,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:08:08,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:08:08,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:08:08,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:08:08,816 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:08:08,816 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:08:08,817 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:08:08,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:08:08,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:08:08,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:08:08,818 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:08:08,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:08:08,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:08:08,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:08:08,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:08:08,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:08:08,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:08:08,820 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:08:08,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:08:08,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:08:08,821 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:08:08,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:08:08,821 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/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_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 [2023-12-02 14:08:09,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:08:09,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:08:09,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:08:09,066 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:08:09,067 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:08:09,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/memsafety-broom/dll-middle-data.i [2023-12-02 14:08:11,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:08:12,073 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:08:12,074 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/sv-benchmarks/c/memsafety-broom/dll-middle-data.i [2023-12-02 14:08:12,101 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/data/a3af8c3df/7a691a2aa1f34a1bb307ed464bd92b35/FLAGf83217f70 [2023-12-02 14:08:12,112 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/data/a3af8c3df/7a691a2aa1f34a1bb307ed464bd92b35 [2023-12-02 14:08:12,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:08:12,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:08:12,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:08:12,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:08:12,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:08:12,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ebb3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12, skipping insertion in model container [2023-12-02 14:08:12,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,188 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:08:12,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:08:12,448 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:08:12,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:08:12,514 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:08:12,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12 WrapperNode [2023-12-02 14:08:12,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:08:12,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:08:12,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:08:12,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:08:12,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,559 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 80 [2023-12-02 14:08:12,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:08:12,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:08:12,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:08:12,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:08:12,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:08:12,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:08:12,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:08:12,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:08:12,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (1/1) ... [2023-12-02 14:08:12,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:08:12,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:12,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:08:12,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:08:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 14:08:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2023-12-02 14:08:12,657 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2023-12-02 14:08:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 14:08:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 14:08:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 14:08:12,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:08:12,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:08:12,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:08:12,769 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:08:12,771 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:08:13,033 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:08:13,085 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:08:13,085 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 14:08:13,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:13 BoogieIcfgContainer [2023-12-02 14:08:13,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:08:13,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:08:13,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:08:13,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:08:13,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:08:12" (1/3) ... [2023-12-02 14:08:13,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7f68f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:13, skipping insertion in model container [2023-12-02 14:08:13,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:12" (2/3) ... [2023-12-02 14:08:13,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7f68f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:13, skipping insertion in model container [2023-12-02 14:08:13,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:13" (3/3) ... [2023-12-02 14:08:13,096 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-middle-data.i [2023-12-02 14:08:13,115 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:08:13,115 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-12-02 14:08:13,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:08:13,157 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=FINITE_AUTOMATA, 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;@6720a68a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:08:13,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2023-12-02 14:08:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 14:08:13,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:13,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 14:08:13,166 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 33 more)] === [2023-12-02 14:08:13,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash 5092341, now seen corresponding path program 1 times [2023-12-02 14:08:13,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:13,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720143287] [2023-12-02 14:08:13,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:13,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:13,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720143287] [2023-12-02 14:08:13,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720143287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:13,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:13,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:08:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792712529] [2023-12-02 14:08:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:13,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:13,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:13,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:08:13,418 INFO L87 Difference]: Start difference. First operand has 68 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-12-02 14:08:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:13,524 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2023-12-02 14:08:13,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:13,526 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-12-02 14:08:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:13,534 INFO L225 Difference]: With dead ends: 64 [2023-12-02 14:08:13,534 INFO L226 Difference]: Without dead ends: 63 [2023-12-02 14:08:13,536 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-12-02 14:08:13,539 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:13,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 65 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-02 14:08:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-12-02 14:08:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-12-02 14:08:13,577 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 4 [2023-12-02 14:08:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:13,577 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-12-02 14:08:13,578 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-12-02 14:08:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-12-02 14:08:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 14:08:13,578 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:13,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 14:08:13,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 14:08:13,579 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 33 more)] === [2023-12-02 14:08:13,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash 5092342, now seen corresponding path program 1 times [2023-12-02 14:08:13,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:13,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062503594] [2023-12-02 14:08:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:13,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062503594] [2023-12-02 14:08:13,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062503594] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:13,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:13,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:08:13,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325920624] [2023-12-02 14:08:13,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:13,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:13,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:13,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:13,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:08:13,669 INFO L87 Difference]: Start difference. First operand 63 states and 66 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-12-02 14:08:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:13,751 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2023-12-02 14:08:13,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:13,752 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-12-02 14:08:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:13,753 INFO L225 Difference]: With dead ends: 59 [2023-12-02 14:08:13,753 INFO L226 Difference]: Without dead ends: 59 [2023-12-02 14:08:13,753 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-12-02 14:08:13,755 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:13,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 68 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-02 14:08:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-02 14:08:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2023-12-02 14:08:13,763 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 4 [2023-12-02 14:08:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:13,763 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2023-12-02 14:08:13,764 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-12-02 14:08:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2023-12-02 14:08:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 14:08:13,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:13,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:13,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 14:08:13,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:13,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:13,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1088257845, now seen corresponding path program 1 times [2023-12-02 14:08:13,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:13,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508134429] [2023-12-02 14:08:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:13,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:13,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:13,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508134429] [2023-12-02 14:08:13,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508134429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:13,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:13,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:08:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042655444] [2023-12-02 14:08:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:13,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:08:13,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:13,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:08:13,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:08:13,924 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:14,083 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-12-02 14:08:14,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:08:14,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-02 14:08:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:14,086 INFO L225 Difference]: With dead ends: 57 [2023-12-02 14:08:14,086 INFO L226 Difference]: Without dead ends: 57 [2023-12-02 14:08:14,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:08:14,088 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:14,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-02 14:08:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2023-12-02 14:08:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2023-12-02 14:08:14,098 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 10 [2023-12-02 14:08:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:14,098 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2023-12-02 14:08:14,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2023-12-02 14:08:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 14:08:14,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:14,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:14,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 14:08:14,100 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:14,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1088257846, now seen corresponding path program 1 times [2023-12-02 14:08:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:14,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979930734] [2023-12-02 14:08:14,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:14,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:14,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:14,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979930734] [2023-12-02 14:08:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979930734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:08:14,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124651105] [2023-12-02 14:08:14,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:14,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:08:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:14,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:08:14,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:08:14,326 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:14,477 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2023-12-02 14:08:14,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:08:14,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-02 14:08:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:14,479 INFO L225 Difference]: With dead ends: 55 [2023-12-02 14:08:14,479 INFO L226 Difference]: Without dead ends: 55 [2023-12-02 14:08:14,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:08:14,481 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:14,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 104 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-02 14:08:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2023-12-02 14:08:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2023-12-02 14:08:14,487 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 10 [2023-12-02 14:08:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:14,488 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2023-12-02 14:08:14,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2023-12-02 14:08:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 14:08:14,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:14,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:14,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 14:08:14,490 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:14,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1724489561, now seen corresponding path program 1 times [2023-12-02 14:08:14,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:14,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995139716] [2023-12-02 14:08:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:14,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:14,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995139716] [2023-12-02 14:08:14,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995139716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:14,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:14,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 14:08:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30438737] [2023-12-02 14:08:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:14,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 14:08:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:14,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 14:08:14,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:08:14,617 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:14,761 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2023-12-02 14:08:14,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:08:14,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-12-02 14:08:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:14,763 INFO L225 Difference]: With dead ends: 58 [2023-12-02 14:08:14,763 INFO L226 Difference]: Without dead ends: 58 [2023-12-02 14:08:14,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:08:14,764 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:14,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 122 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-02 14:08:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2023-12-02 14:08:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2023-12-02 14:08:14,772 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 16 [2023-12-02 14:08:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:14,772 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2023-12-02 14:08:14,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2023-12-02 14:08:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 14:08:14,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:14,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:14,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 14:08:14,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:14,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1724489562, now seen corresponding path program 1 times [2023-12-02 14:08:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508631075] [2023-12-02 14:08:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:14,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:15,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:15,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508631075] [2023-12-02 14:08:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508631075] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:15,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:15,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 14:08:15,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223870048] [2023-12-02 14:08:15,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:15,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 14:08:15,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:15,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 14:08:15,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:08:15,044 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:15,198 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-12-02 14:08:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:08:15,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-12-02 14:08:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:15,202 INFO L225 Difference]: With dead ends: 57 [2023-12-02 14:08:15,202 INFO L226 Difference]: Without dead ends: 57 [2023-12-02 14:08:15,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:08:15,204 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:15,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 122 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-02 14:08:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2023-12-02 14:08:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2023-12-02 14:08:15,210 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 16 [2023-12-02 14:08:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:15,210 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2023-12-02 14:08:15,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2023-12-02 14:08:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 14:08:15,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:15,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:15,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 14:08:15,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:15,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1919585171, now seen corresponding path program 1 times [2023-12-02 14:08:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:15,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678584116] [2023-12-02 14:08:15,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:15,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:15,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678584116] [2023-12-02 14:08:15,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678584116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:15,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:15,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 14:08:15,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819971847] [2023-12-02 14:08:15,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:15,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 14:08:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 14:08:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:08:15,308 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:15,409 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2023-12-02 14:08:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:08:15,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-12-02 14:08:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:15,410 INFO L225 Difference]: With dead ends: 60 [2023-12-02 14:08:15,410 INFO L226 Difference]: Without dead ends: 60 [2023-12-02 14:08:15,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:08:15,412 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:15,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 177 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-02 14:08:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2023-12-02 14:08:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-12-02 14:08:15,417 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 17 [2023-12-02 14:08:15,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:15,418 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-12-02 14:08:15,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-12-02 14:08:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 14:08:15,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:15,419 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:15,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 14:08:15,419 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:15,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash -622863686, now seen corresponding path program 1 times [2023-12-02 14:08:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:15,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132548342] [2023-12-02 14:08:15,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:15,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:16,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:16,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132548342] [2023-12-02 14:08:16,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132548342] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:16,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148303165] [2023-12-02 14:08:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:16,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:16,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:16,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:16,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 14:08:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:16,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-02 14:08:16,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:16,384 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-12-02 14:08:16,392 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-12-02 14:08:16,412 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-12-02 14:08:16,421 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-12-02 14:08:16,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:08:16,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:08:16,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:08:16,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:08:16,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:08:16,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:08:16,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:08:16,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:08:16,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:08:16,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:08:16,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:08:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:16,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:08:17,075 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_261 (Array Int Int))) (or (not (= v_ArrVal_261 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_261 .cse0)))) (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))) (forall ((v_ArrVal_262 (Array Int Int))) (or (not (= v_ArrVal_262 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_262 .cse0)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 0))))) is different from false [2023-12-02 14:08:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:17,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148303165] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:08:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1120579459] [2023-12-02 14:08:17,757 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 14:08:17,757 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:08:17,761 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:08:17,766 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:08:17,767 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:08:18,492 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2023-12-02 14:08:18,528 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:08:25,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1120579459] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:25,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:08:25,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [10, 11, 10] total 37 [2023-12-02 14:08:25,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156612341] [2023-12-02 14:08:25,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:25,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 14:08:25,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:25,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 14:08:25,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1114, Unknown=2, NotChecked=68, Total=1332 [2023-12-02 14:08:25,614 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:30,194 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2023-12-02 14:08:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 14:08:30,195 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-12-02 14:08:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:30,195 INFO L225 Difference]: With dead ends: 66 [2023-12-02 14:08:30,195 INFO L226 Difference]: Without dead ends: 66 [2023-12-02 14:08:30,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=148, Invalid=1114, Unknown=2, NotChecked=68, Total=1332 [2023-12-02 14:08:30,197 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:30,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 706 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2023-12-02 14:08:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-02 14:08:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2023-12-02 14:08:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.6) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2023-12-02 14:08:30,201 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 18 [2023-12-02 14:08:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:30,201 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2023-12-02 14:08:30,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2023-12-02 14:08:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 14:08:30,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:30,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:30,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 14:08:30,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-02 14:08:30,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:30,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2128888750, now seen corresponding path program 1 times [2023-12-02 14:08:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:30,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905171807] [2023-12-02 14:08:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 14:08:30,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:30,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905171807] [2023-12-02 14:08:30,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905171807] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:30,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:30,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 14:08:30,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753324891] [2023-12-02 14:08:30,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:30,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:08:30,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:30,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:08:30,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:08:30,510 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:30,630 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2023-12-02 14:08:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 14:08:30,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-12-02 14:08:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:30,631 INFO L225 Difference]: With dead ends: 73 [2023-12-02 14:08:30,631 INFO L226 Difference]: Without dead ends: 73 [2023-12-02 14:08:30,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:08:30,632 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:30,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 158 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-02 14:08:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2023-12-02 14:08:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 60 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2023-12-02 14:08:30,638 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 19 [2023-12-02 14:08:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:30,639 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2023-12-02 14:08:30,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2023-12-02 14:08:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 14:08:30,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:30,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:30,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 14:08:30,640 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:30,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2128890097, now seen corresponding path program 1 times [2023-12-02 14:08:30,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:30,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120501517] [2023-12-02 14:08:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 14:08:30,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:30,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120501517] [2023-12-02 14:08:30,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120501517] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:30,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:30,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 14:08:30,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083462665] [2023-12-02 14:08:30,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:30,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:08:30,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:30,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:08:30,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:08:30,772 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:30,936 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2023-12-02 14:08:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 14:08:30,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-12-02 14:08:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:30,937 INFO L225 Difference]: With dead ends: 73 [2023-12-02 14:08:30,937 INFO L226 Difference]: Without dead ends: 73 [2023-12-02 14:08:30,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:08:30,938 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:30,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 117 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-02 14:08:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2023-12-02 14:08:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.558139534883721) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2023-12-02 14:08:30,944 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 19 [2023-12-02 14:08:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:30,944 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2023-12-02 14:08:30,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2023-12-02 14:08:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 14:08:30,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:30,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:30,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 14:08:30,946 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:30,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2128890096, now seen corresponding path program 1 times [2023-12-02 14:08:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:30,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594845420] [2023-12-02 14:08:30,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 14:08:31,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594845420] [2023-12-02 14:08:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594845420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:31,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:31,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 14:08:31,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592030073] [2023-12-02 14:08:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:31,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:08:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:31,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:08:31,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:08:31,141 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:31,316 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2023-12-02 14:08:31,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 14:08:31,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-12-02 14:08:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:31,317 INFO L225 Difference]: With dead ends: 82 [2023-12-02 14:08:31,318 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 14:08:31,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:08:31,319 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:31,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 101 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:08:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 14:08:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2023-12-02 14:08:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-12-02 14:08:31,324 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 19 [2023-12-02 14:08:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:31,325 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-12-02 14:08:31,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-12-02 14:08:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 14:08:31,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:31,326 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:31,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 14:08:31,327 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:31,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:31,327 INFO L85 PathProgramCache]: Analyzing trace with hash 918695024, now seen corresponding path program 1 times [2023-12-02 14:08:31,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:31,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023052787] [2023-12-02 14:08:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:31,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:31,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023052787] [2023-12-02 14:08:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023052787] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904089319] [2023-12-02 14:08:31,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:31,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:31,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:31,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:31,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 14:08:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:31,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 14:08:31,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:31,642 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-12-02 14:08:31,677 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 14:08:31,678 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-12-02 14:08:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:31,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:31,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904089319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:31,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:31,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2023-12-02 14:08:31,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710555393] [2023-12-02 14:08:31,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:31,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:08:31,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:31,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:08:31,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2023-12-02 14:08:31,682 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:31,743 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2023-12-02 14:08:31,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:08:31,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-12-02 14:08:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:31,744 INFO L225 Difference]: With dead ends: 70 [2023-12-02 14:08:31,744 INFO L226 Difference]: Without dead ends: 70 [2023-12-02 14:08:31,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2023-12-02 14:08:31,745 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:31,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2023-12-02 14:08:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-02 14:08:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2023-12-02 14:08:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 63 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:08:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-12-02 14:08:31,749 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 21 [2023-12-02 14:08:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:31,750 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-12-02 14:08:31,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:31,750 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-12-02 14:08:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 14:08:31,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:31,751 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:31,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 14:08:31,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:31,955 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:31,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash 918695025, now seen corresponding path program 1 times [2023-12-02 14:08:31,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:31,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770509780] [2023-12-02 14:08:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:31,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:32,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770509780] [2023-12-02 14:08:32,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770509780] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562363640] [2023-12-02 14:08:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:32,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:32,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:32,318 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:32,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 14:08:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:32,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 14:08:32,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:32,515 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-12-02 14:08:32,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:08:32,543 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-12-02 14:08:32,552 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 14:08:32,553 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-12-02 14:08:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:32,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:32,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562363640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:32,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:32,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-12-02 14:08:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288958094] [2023-12-02 14:08:32,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:32,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 14:08:32,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:32,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 14:08:32,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2023-12-02 14:08:32,573 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:32,665 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2023-12-02 14:08:32,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:08:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-12-02 14:08:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:32,667 INFO L225 Difference]: With dead ends: 82 [2023-12-02 14:08:32,667 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 14:08:32,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2023-12-02 14:08:32,668 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:32,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 96 Unchecked, 0.1s Time] [2023-12-02 14:08:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 14:08:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2023-12-02 14:08:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 70 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:08:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2023-12-02 14:08:32,673 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 21 [2023-12-02 14:08:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:32,673 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2023-12-02 14:08:32,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:08:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2023-12-02 14:08:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 14:08:32,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:32,675 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] [2023-12-02 14:08:32,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 14:08:32,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:32,881 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:32,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1458913197, now seen corresponding path program 1 times [2023-12-02 14:08:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:32,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196301786] [2023-12-02 14:08:32,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:32,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 14:08:32,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:32,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196301786] [2023-12-02 14:08:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196301786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:32,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 14:08:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685990932] [2023-12-02 14:08:32,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:32,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:08:32,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:32,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:08:32,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:08:32,999 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:33,145 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2023-12-02 14:08:33,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 14:08:33,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-12-02 14:08:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:33,147 INFO L225 Difference]: With dead ends: 82 [2023-12-02 14:08:33,147 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 14:08:33,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:08:33,148 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 44 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:33,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 151 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 14:08:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2023-12-02 14:08:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 73 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:08:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2023-12-02 14:08:33,153 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 21 [2023-12-02 14:08:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:33,153 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2023-12-02 14:08:33,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2023-12-02 14:08:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 14:08:33,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:33,155 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:33,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 14:08:33,155 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:33,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1897252236, now seen corresponding path program 1 times [2023-12-02 14:08:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:33,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282184456] [2023-12-02 14:08:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:33,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 14:08:33,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:33,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282184456] [2023-12-02 14:08:33,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282184456] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:33,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:33,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 14:08:33,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144541700] [2023-12-02 14:08:33,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:33,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 14:08:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:33,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 14:08:33,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:08:33,432 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-12-02 14:08:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:33,587 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2023-12-02 14:08:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:08:33,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2023-12-02 14:08:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:33,589 INFO L225 Difference]: With dead ends: 78 [2023-12-02 14:08:33,589 INFO L226 Difference]: Without dead ends: 78 [2023-12-02 14:08:33,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:08:33,590 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:33,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 115 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-02 14:08:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-02 14:08:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 72 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:08:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2023-12-02 14:08:33,594 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 23 [2023-12-02 14:08:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:33,595 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2023-12-02 14:08:33,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-12-02 14:08:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2023-12-02 14:08:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 14:08:33,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:33,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:33,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 14:08:33,597 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:33,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:33,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1897252237, now seen corresponding path program 1 times [2023-12-02 14:08:33,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:33,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669090118] [2023-12-02 14:08:33,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:33,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:08:33,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:33,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669090118] [2023-12-02 14:08:33,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669090118] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:33,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:33,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 14:08:33,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366202652] [2023-12-02 14:08:33,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:33,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 14:08:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 14:08:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:08:33,735 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:08:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:33,869 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2023-12-02 14:08:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:08:33,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 23 [2023-12-02 14:08:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:33,870 INFO L225 Difference]: With dead ends: 77 [2023-12-02 14:08:33,870 INFO L226 Difference]: Without dead ends: 77 [2023-12-02 14:08:33,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:08:33,871 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:33,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 110 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:33,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-02 14:08:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-02 14:08:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.509090909090909) internal successors, (83), 71 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:08:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2023-12-02 14:08:33,876 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 23 [2023-12-02 14:08:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:33,876 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2023-12-02 14:08:33,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-12-02 14:08:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2023-12-02 14:08:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 14:08:33,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:33,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:33,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 14:08:33,878 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:33,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:33,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1708840574, now seen corresponding path program 1 times [2023-12-02 14:08:33,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:33,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240678362] [2023-12-02 14:08:33,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:33,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 14:08:34,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240678362] [2023-12-02 14:08:34,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240678362] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667209254] [2023-12-02 14:08:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:34,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:34,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:34,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:34,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 14:08:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:34,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 14:08:34,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:34,215 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 13 treesize of output 9 [2023-12-02 14:08:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 14:08:34,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:08:34,298 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_19| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_19|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_19| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-12-02 14:08:34,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667209254] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:34,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [957859480] [2023-12-02 14:08:34,303 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 14:08:34,303 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:08:34,303 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:08:34,303 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:08:34,304 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:08:35,936 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2023-12-02 14:08:35,978 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:08:51,851 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2736#(and (not (= |ULTIMATE.start_create_#res#1.base| 0)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~l~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 20) 2147483647) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (= |ULTIMATE.start_create_#res#1.offset| 0) (exists ((|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int)))) (and (= |v_#memory_int_86| (store |v_#memory_int_85| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_85| |ULTIMATE.start_create_#res#1.base|) 4 (select (select |v_#memory_int_86| |ULTIMATE.start_create_#res#1.base|) 4)))) (= |v_#memory_int_90| (store |v_#memory_int_87| |ULTIMATE.start_create_#res#1.base| (store (store (select |v_#memory_int_87| |ULTIMATE.start_create_#res#1.base|) 20 0) 0 (select (select |v_#memory_int_90| |ULTIMATE.start_create_#res#1.base|) 0)))) (<= (select (select |v_#memory_int_90| |ULTIMATE.start_create_#res#1.base|) 0) 2147483647) (= |#memory_int| (store |v_#memory_int_90| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_90| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 20)))) (<= 0 (+ (select (select |v_#memory_int_90| |ULTIMATE.start_create_#res#1.base|) 0) 2147483648)) (= (store |v_#memory_int_86| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_86| |ULTIMATE.start_create_#res#1.base|) 12 (select (select |v_#memory_int_87| |ULTIMATE.start_create_#res#1.base|) 12))) |v_#memory_int_87|))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#valid_91| (Array Int Int))) (and (= (store (store |v_#valid_91| |ULTIMATE.start_create_#res#1.base| 1) |ULTIMATE.start_main_~l~0#1.base| 0) |#valid|) (= (select |v_#valid_91| |ULTIMATE.start_create_#res#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_111| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_114| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_#res#1.base|) 20)))) (= (store |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_116| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_116|) (= |v_#memory_$Pointer$.offset_115| (store |v_#memory_$Pointer$.offset_114| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_114| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_create_#res#1.base|) 20)))) (= (store |v_#memory_$Pointer$.offset_111| |ULTIMATE.start_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_111| |ULTIMATE.start_create_#res#1.base|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.offset_114| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_114|))) (exists ((|v_#length_74| (Array Int Int))) (= |#length| (store |v_#length_74| |ULTIMATE.start_create_#res#1.base| 24))) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_create_#res#1.base|) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 20) 2147483648)) (= |ULTIMATE.start_main_#res#1| 0) (<= (+ |ULTIMATE.start_create_#res#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_116| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_114| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_111| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_114| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_114| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |v_#memory_$Pointer$.base_115| |ULTIMATE.start_create_#res#1.base|) 20))) |v_#memory_$Pointer$.base_115|) (= (store |v_#memory_$Pointer$.base_111| |ULTIMATE.start_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.base_111| |ULTIMATE.start_create_#res#1.base|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.base_114| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_114|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_116| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_116| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_#res#1.base|) 20)))) (= (store |v_#memory_$Pointer$.base_115| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_115| |ULTIMATE.start_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_116| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_116|))))' at error location [2023-12-02 14:08:51,851 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:08:51,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 14:08:51,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2023-12-02 14:08:51,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090849535] [2023-12-02 14:08:51,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 14:08:51,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 14:08:51,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:51,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 14:08:51,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=796, Unknown=2, NotChecked=56, Total=930 [2023-12-02 14:08:51,853 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:52,125 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2023-12-02 14:08:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 14:08:52,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-12-02 14:08:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:52,127 INFO L225 Difference]: With dead ends: 89 [2023-12-02 14:08:52,127 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 14:08:52,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=90, Invalid=968, Unknown=2, NotChecked=62, Total=1122 [2023-12-02 14:08:52,128 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:52,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 161 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:08:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 14:08:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2023-12-02 14:08:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 74 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:08:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2023-12-02 14:08:52,132 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 24 [2023-12-02 14:08:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:52,132 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2023-12-02 14:08:52,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:08:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2023-12-02 14:08:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 14:08:52,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:52,133 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:52,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 14:08:52,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 14:08:52,334 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:08:52,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:52,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1708841921, now seen corresponding path program 1 times [2023-12-02 14:08:52,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:52,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026329613] [2023-12-02 14:08:52,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:52,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026329613] [2023-12-02 14:08:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026329613] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723955926] [2023-12-02 14:08:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:52,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:52,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:52,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:52,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 14:08:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:52,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-02 14:08:52,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:52,850 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-12-02 14:08:52,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 14:08:52,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 14:08:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:53,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:08:53,137 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-02 14:08:53,137 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 26 treesize of output 23 [2023-12-02 14:08:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:08:53,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723955926] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:08:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [238981220] [2023-12-02 14:08:53,186 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 14:08:53,186 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:08:53,187 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:08:53,187 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:08:53,187 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:08:54,552 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2023-12-02 14:08:54,582 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:09:07,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [238981220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:09:07,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:09:07,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [12, 11, 8] total 40 [2023-12-02 14:09:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435851099] [2023-12-02 14:09:07,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:09:07,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 14:09:07,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:09:07,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 14:09:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1418, Unknown=1, NotChecked=0, Total=1560 [2023-12-02 14:09:07,505 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 19 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:09:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:09:14,088 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2023-12-02 14:09:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 14:09:14,089 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-12-02 14:09:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:09:14,090 INFO L225 Difference]: With dead ends: 85 [2023-12-02 14:09:14,090 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 14:09:14,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=141, Invalid=1418, Unknown=1, NotChecked=0, Total=1560 [2023-12-02 14:09:14,091 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:09:14,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 751 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2023-12-02 14:09:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 14:09:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-02 14:09:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 79 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:09:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2023-12-02 14:09:14,095 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 24 [2023-12-02 14:09:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:09:14,095 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2023-12-02 14:09:14,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:09:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2023-12-02 14:09:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 14:09:14,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:09:14,096 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] [2023-12-02 14:09:14,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 14:09:14,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 14:09:14,297 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:09:14,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:09:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2101791866, now seen corresponding path program 1 times [2023-12-02 14:09:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:09:14,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995010024] [2023-12-02 14:09:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:09:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:09:14,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:09:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995010024] [2023-12-02 14:09:14,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995010024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:09:14,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:09:14,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-02 14:09:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858621103] [2023-12-02 14:09:14,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:09:14,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 14:09:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:09:14,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 14:09:14,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-12-02 14:09:14,684 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 15 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:09:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:09:14,959 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2023-12-02 14:09:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 14:09:14,959 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-12-02 14:09:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:09:14,960 INFO L225 Difference]: With dead ends: 86 [2023-12-02 14:09:14,960 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 14:09:14,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-02 14:09:14,961 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:09:14,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 162 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:09:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 14:09:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-12-02 14:09:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 79 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:09:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2023-12-02 14:09:14,964 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 25 [2023-12-02 14:09:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:09:14,965 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2023-12-02 14:09:14,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:09:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2023-12-02 14:09:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 14:09:14,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:09:14,965 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] [2023-12-02 14:09:14,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 14:09:14,966 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:09:14,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:09:14,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2101791867, now seen corresponding path program 1 times [2023-12-02 14:09:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:09:14,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033195928] [2023-12-02 14:09:14,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:09:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:09:15,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:09:15,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033195928] [2023-12-02 14:09:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033195928] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:09:15,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869907204] [2023-12-02 14:09:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:15,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:09:15,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:09:15,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:09:15,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 14:09:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:15,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 14:09:15,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:09:15,578 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-12-02 14:09:15,662 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 14:09:15,662 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-12-02 14:09:15,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:09:15,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 14:09:15,764 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:09:15,764 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:09:15,768 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 30 treesize of output 13 [2023-12-02 14:09:15,779 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 31 treesize of output 13 [2023-12-02 14:09:15,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 14:09:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:09:15,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:09:15,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869907204] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:09:15,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:09:15,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2023-12-02 14:09:15,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864033086] [2023-12-02 14:09:15,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:09:15,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 14:09:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:09:15,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 14:09:15,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2023-12-02 14:09:15,808 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:09:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:09:16,085 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2023-12-02 14:09:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 14:09:16,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-12-02 14:09:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:09:16,086 INFO L225 Difference]: With dead ends: 85 [2023-12-02 14:09:16,086 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 14:09:16,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2023-12-02 14:09:16,087 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:09:16,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 121 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:09:16,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 14:09:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-02 14:09:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 79 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:09:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2023-12-02 14:09:16,091 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 25 [2023-12-02 14:09:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:09:16,091 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2023-12-02 14:09:16,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:09:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2023-12-02 14:09:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 14:09:16,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:09:16,092 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] [2023-12-02 14:09:16,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 14:09:16,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:09:16,298 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:09:16,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:09:16,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1187439265, now seen corresponding path program 1 times [2023-12-02 14:09:16,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:09:16,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762609058] [2023-12-02 14:09:16,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:16,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:09:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:09:16,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:09:16,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762609058] [2023-12-02 14:09:16,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762609058] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:09:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27538331] [2023-12-02 14:09:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:16,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:09:16,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:09:16,912 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:09:16,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 14:09:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:17,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 14:09:17,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:09:17,166 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 14:09:17,166 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-12-02 14:09:17,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:09:17,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:09:17,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:09:17,273 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2023-12-02 14:09:17,277 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 49 treesize of output 30 [2023-12-02 14:09:17,329 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:09:17,329 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2023-12-02 14:09:17,332 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 49 treesize of output 30 [2023-12-02 14:09:17,345 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 39 treesize of output 21 [2023-12-02 14:09:17,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-12-02 14:09:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:09:17,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:09:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27538331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:09:17,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:09:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2023-12-02 14:09:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272169024] [2023-12-02 14:09:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:09:17,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 14:09:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:09:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 14:09:17,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2023-12-02 14:09:17,376 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:09:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:09:17,732 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-12-02 14:09:17,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 14:09:17,732 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-12-02 14:09:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:09:17,733 INFO L225 Difference]: With dead ends: 86 [2023-12-02 14:09:17,733 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 14:09:17,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2023-12-02 14:09:17,734 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:09:17,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 155 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:09:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 14:09:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-12-02 14:09:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 79 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:09:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2023-12-02 14:09:17,744 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 27 [2023-12-02 14:09:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:09:17,744 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2023-12-02 14:09:17,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:09:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2023-12-02 14:09:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 14:09:17,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:09:17,745 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] [2023-12-02 14:09:17,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 14:09:17,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:09:17,947 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:09:17,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:09:17,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1187439264, now seen corresponding path program 1 times [2023-12-02 14:09:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:09:17,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224097263] [2023-12-02 14:09:17,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:09:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:09:18,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:09:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224097263] [2023-12-02 14:09:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224097263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:09:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:09:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-02 14:09:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584490372] [2023-12-02 14:09:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:09:18,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 14:09:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:09:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 14:09:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-12-02 14:09:18,399 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:09:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:09:18,650 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2023-12-02 14:09:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 14:09:18,651 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-12-02 14:09:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:09:18,651 INFO L225 Difference]: With dead ends: 85 [2023-12-02 14:09:18,651 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 14:09:18,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-12-02 14:09:18,652 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:09:18,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 158 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:09:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 14:09:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-02 14:09:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 79 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:09:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2023-12-02 14:09:18,655 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 27 [2023-12-02 14:09:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:09:18,655 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2023-12-02 14:09:18,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:09:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2023-12-02 14:09:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 14:09:18,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:09:18,656 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] [2023-12-02 14:09:18,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 14:09:18,656 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:09:18,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:09:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash 283146834, now seen corresponding path program 2 times [2023-12-02 14:09:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:09:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328041038] [2023-12-02 14:09:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:09:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:09:18,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:09:18,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328041038] [2023-12-02 14:09:18,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328041038] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:09:18,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668527357] [2023-12-02 14:09:18,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 14:09:18,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:09:18,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:09:18,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:09:18,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 14:09:19,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 14:09:19,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:09:19,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-02 14:09:19,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:09:19,272 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-12-02 14:09:19,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:09:19,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 14:09:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:09:19,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:09:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:09:19,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668527357] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:09:19,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2060354931] [2023-12-02 14:09:19,449 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 14:09:19,449 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:09:19,449 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:09:19,449 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:09:19,449 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:09:20,498 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2023-12-02 14:09:20,520 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:09:40,706 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4408#(and (exists ((|v_#valid_110| (Array Int Int))) (and (= (select |v_#valid_110| |ULTIMATE.start_create_#res#1.base|) 0) (= |#valid| (store (store |v_#valid_110| |ULTIMATE.start_create_#res#1.base| 1) |ULTIMATE.start_main_~l~0#1.base| 0)))) (not (= |ULTIMATE.start_create_#res#1.base| 0)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~l~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 20) 2147483647) (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int))) (|v_#memory_int_122| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_#memory_int_122| |ULTIMATE.start_create_#res#1.base|) 0) 2147483648)) (= |v_#memory_int_122| (store |v_#memory_int_119| |ULTIMATE.start_create_#res#1.base| (store (store (select |v_#memory_int_119| |ULTIMATE.start_create_#res#1.base|) 20 0) 0 (select (select |v_#memory_int_122| |ULTIMATE.start_create_#res#1.base|) 0)))) (<= (select (select |v_#memory_int_122| |ULTIMATE.start_create_#res#1.base|) 0) 2147483647) (= |#memory_int| (store |v_#memory_int_122| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_122| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 20)))) (= (store |v_#memory_int_117| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_117| |ULTIMATE.start_create_#res#1.base|) 4 (select (select |v_#memory_int_118| |ULTIMATE.start_create_#res#1.base|) 4))) |v_#memory_int_118|) (= (store |v_#memory_int_118| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_118| |ULTIMATE.start_create_#res#1.base|) 12 (select (select |v_#memory_int_119| |ULTIMATE.start_create_#res#1.base|) 12))) |v_#memory_int_119|))) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= (+ |ULTIMATE.start_main_~l~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_#res#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_152| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_153| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_154| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_#res#1.base|) 20)))) (= (store |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_create_#res#1.base|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.offset_152| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_152|) (= |v_#memory_$Pointer$.offset_154| (store |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_create_#res#1.base|) 0)))) (= (store |v_#memory_$Pointer$.offset_152| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_152| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_create_#res#1.base|) 20))) |v_#memory_$Pointer$.offset_153|))) (exists ((|v_#length_85| (Array Int Int))) (= (store |v_#length_85| |ULTIMATE.start_create_#res#1.base| 24) |#length|)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_155| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_154| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_153| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_153| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_153| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |v_#memory_$Pointer$.base_154| |ULTIMATE.start_create_#res#1.base|) 20))) |v_#memory_$Pointer$.base_154|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_155| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_155| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_#res#1.base|) 20)))) (= (store |v_#memory_$Pointer$.base_154| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_154| |ULTIMATE.start_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_155| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_155|) (= (store |v_#memory_$Pointer$.base_150| |ULTIMATE.start_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.base_150| |ULTIMATE.start_create_#res#1.base|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.base_153| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_153|))) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_create_#res#1.base|) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 20) 2147483648)) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-12-02 14:09:40,706 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:09:40,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:09:40,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 21 [2023-12-02 14:09:40,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911914908] [2023-12-02 14:09:40,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:09:40,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 14:09:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:09:40,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 14:09:40,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1424, Unknown=1, NotChecked=0, Total=1560 [2023-12-02 14:09:40,709 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 21 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:09:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:09:41,365 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2023-12-02 14:09:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 14:09:41,366 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2023-12-02 14:09:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:09:41,367 INFO L225 Difference]: With dead ends: 119 [2023-12-02 14:09:41,367 INFO L226 Difference]: Without dead ends: 111 [2023-12-02 14:09:41,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=216, Invalid=2135, Unknown=1, NotChecked=0, Total=2352 [2023-12-02 14:09:41,369 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 106 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:09:41,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 287 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 14:09:41,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-02 14:09:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2023-12-02 14:09:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 91 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:09:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2023-12-02 14:09:41,373 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 29 [2023-12-02 14:09:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:09:41,373 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2023-12-02 14:09:41,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:09:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2023-12-02 14:09:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 14:09:41,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:09:41,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:09:41,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 14:09:41,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-02 14:09:41,574 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:09:41,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:09:41,575 INFO L85 PathProgramCache]: Analyzing trace with hash 587957393, now seen corresponding path program 3 times [2023-12-02 14:09:41,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:09:41,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941055756] [2023-12-02 14:09:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:09:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:09:42,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:09:42,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941055756] [2023-12-02 14:09:42,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941055756] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:09:42,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701791008] [2023-12-02 14:09:42,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 14:09:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:09:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:09:42,109 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:09:42,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 14:09:42,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 14:09:42,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:09:42,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 14:09:42,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:09:42,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 14:09:42,300 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 22 [2023-12-02 14:09:42,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:09:42,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:09:42,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:09:42,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:09:42,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:09:42,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:09:42,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 14:09:42,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:09:42,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 14:09:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:09:42,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:09:42,808 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1644 (Array Int Int))) (or (not (= v_ArrVal_1644 (let ((.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_1644 .cse0))))) (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_1644) |c_ULTIMATE.start_create_~dll~0#1.base|) 4)))) is different from false [2023-12-02 14:09:43,162 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 20 treesize of output 18 [2023-12-02 14:09:43,166 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:09:43,168 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 90 treesize of output 86 [2023-12-02 14:09:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:09:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701791008] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:09:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2118108778] [2023-12-02 14:09:43,192 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 14:09:43,192 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:09:43,192 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:09:43,192 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:09:43,192 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:09:44,494 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2023-12-02 14:09:44,519 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:10:07,755 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4879#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~l~0#1.offset| 0) (not (= |ULTIMATE.start_main_~l~0#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 20) 2147483647) (exists ((|v_#memory_$Pointer$.base_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_188| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_187| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_186| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_186| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_186| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |v_#memory_$Pointer$.base_187| |ULTIMATE.start_create_#res#1.base|) 20))) |v_#memory_$Pointer$.base_187|) (= (store |v_#memory_$Pointer$.base_183| |ULTIMATE.start_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.base_183| |ULTIMATE.start_create_#res#1.base|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.base_186| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_186|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_188| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_188| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_#res#1.base|) 20)))) (= (store |v_#memory_$Pointer$.base_187| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_187| |ULTIMATE.start_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_188| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_188|))) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= (+ |ULTIMATE.start_main_~l~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_#res#1.offset| 0) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.offset_172| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_175| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_176| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_177| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_175| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_175| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |v_#memory_$Pointer$.offset_176| |ULTIMATE.start_create_#res#1.base|) 20))) |v_#memory_$Pointer$.offset_176|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_177| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_177| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_#res#1.base|) 20)))) (= (store |v_#memory_$Pointer$.offset_172| |ULTIMATE.start_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_172| |ULTIMATE.start_create_#res#1.base|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.offset_175| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_175|) (= (store |v_#memory_$Pointer$.offset_176| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_176| |ULTIMATE.start_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_177| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_177|))) (exists ((|v_#valid_121| (Array Int Int))) (and (= (store (store |v_#valid_121| |ULTIMATE.start_create_#res#1.base| 1) |ULTIMATE.start_main_~l~0#1.base| 0) |#valid|) (= (select |v_#valid_121| |ULTIMATE.start_create_#res#1.base|) 0))) (exists ((|v_#length_92| (Array Int Int))) (= (store |v_#length_92| |ULTIMATE.start_create_#res#1.base| 24) |#length|)) (exists ((|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_140| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_140| |ULTIMATE.start_create_#res#1.base|) 4 (select (select |v_#memory_int_141| |ULTIMATE.start_create_#res#1.base|) 4))) |v_#memory_int_141|) (= (store |v_#memory_int_142| |ULTIMATE.start_create_#res#1.base| (store (store (select |v_#memory_int_142| |ULTIMATE.start_create_#res#1.base|) 20 0) 0 (select (select |v_#memory_int_145| |ULTIMATE.start_create_#res#1.base|) 0))) |v_#memory_int_145|) (= |#memory_int| (store |v_#memory_int_145| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_145| |ULTIMATE.start_create_#res#1.base|) 20 (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 20)))) (<= 0 (+ 2147483648 (select (select |v_#memory_int_145| |ULTIMATE.start_create_#res#1.base|) 0))) (<= (select (select |v_#memory_int_145| |ULTIMATE.start_create_#res#1.base|) 0) 2147483647) (= |v_#memory_int_142| (store |v_#memory_int_141| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_141| |ULTIMATE.start_create_#res#1.base|) 12 (select (select |v_#memory_int_142| |ULTIMATE.start_create_#res#1.base|) 12)))))) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_create_#res#1.base|) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 20) 2147483648)) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-12-02 14:10:07,755 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:10:07,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:10:07,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 37 [2023-12-02 14:10:07,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029312640] [2023-12-02 14:10:07,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:10:07,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 14:10:07,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:10:07,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 14:10:07,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2735, Unknown=2, NotChecked=106, Total=3080 [2023-12-02 14:10:07,758 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 37 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:10:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:10:08,604 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2023-12-02 14:10:08,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 14:10:08,605 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-12-02 14:10:08,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:10:08,606 INFO L225 Difference]: With dead ends: 95 [2023-12-02 14:10:08,606 INFO L226 Difference]: Without dead ends: 80 [2023-12-02 14:10:08,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=307, Invalid=3601, Unknown=2, NotChecked=122, Total=4032 [2023-12-02 14:10:08,609 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:10:08,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 646 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 840 Invalid, 0 Unknown, 49 Unchecked, 0.5s Time] [2023-12-02 14:10:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-02 14:10:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-12-02 14:10:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 74 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:10:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2023-12-02 14:10:08,613 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 31 [2023-12-02 14:10:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:10:08,613 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2023-12-02 14:10:08,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:10:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2023-12-02 14:10:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 14:10:08,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:10:08,614 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:10:08,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 14:10:08,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 14:10:08,815 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:10:08,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:10:08,815 INFO L85 PathProgramCache]: Analyzing trace with hash 432530249, now seen corresponding path program 1 times [2023-12-02 14:10:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:10:08,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297538771] [2023-12-02 14:10:08,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:10:08,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:10:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:10:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:10:08,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:10:08,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297538771] [2023-12-02 14:10:08,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297538771] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:10:08,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011774637] [2023-12-02 14:10:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:10:08,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:10:08,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:10:08,924 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:10:08,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 14:10:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:10:09,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 14:10:09,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:10:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:10:09,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:10:09,139 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 14:10:09,140 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-12-02 14:10:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:10:09,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011774637] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:10:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2080583792] [2023-12-02 14:10:09,155 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 14:10:09,155 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:10:09,155 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:10:09,155 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:10:09,155 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:10:20,696 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2023-12-02 14:10:20,750 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:12:20,578 WARN L293 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 272 DAG size of output: 260 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:12:47,574 WARN L293 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 277 DAG size of output: 263 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:12:47,576 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5288#(and (= |ULTIMATE.start_main_~l~0#1.offset| |ULTIMATE.start_create_#res#1.offset|) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_loop_#in~l#1.base|) (= |ULTIMATE.start_loop_~l#1.base| |ULTIMATE.start_loop_#in~l#1.base|) (= |ULTIMATE.start_loop_~l#1.base| |ULTIMATE.start_loop_~node~0#1.base|) (= |ULTIMATE.start_loop_~node~0#1.offset| |ULTIMATE.start_loop_~l#1.offset|) (= |ULTIMATE.start_loop_#in~l#1.offset| |ULTIMATE.start_loop_~l#1.offset|) (or (not (= |ULTIMATE.start_loop_~node~0#1.base| 0)) (not (= |ULTIMATE.start_loop_~node~0#1.offset| 0))) (not (= (select |#valid| |ULTIMATE.start_loop_~node~0#1.base|) 1)) (exists ((|v_ULTIMATE.start_create_~now~0#1.offset_57| Int) (|v_#memory_$Pointer$.offset_215| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~0#1.base_64| Int) (|v_#memory_$Pointer$.offset_216| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_218| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_229| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_227| (Array Int (Array Int Int))) (|v_#memory_int_187| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_226| (Array Int (Array Int Int))) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_185| (Array Int (Array Int Int))) (|v_#memory_int_186| (Array Int (Array Int Int)))) (and (<= (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_218| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 20)) 2147483647) (= (store |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_create_~now~0#1.base_64| (store (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|) (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))) |v_#memory_$Pointer$.offset_216|) (= (select |#valid| |v_ULTIMATE.start_create_~now~0#1.base_64|) 1) (= (store |v_#memory_$Pointer$.base_226| |v_ULTIMATE.start_create_~now~0#1.base_64| (store (select |v_#memory_$Pointer$.base_226| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|) (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))) |v_#memory_$Pointer$.base_227|) (= (store (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (select (select |v_#memory_$Pointer$.base_229| (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))))) |v_#memory_$Pointer$.base_229|) (<= 0 (select (select (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_218| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_218| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_218| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 20) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_218| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 20))))) (<= 0 (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (= (store |v_#memory_int_185| |v_ULTIMATE.start_create_~now~0#1.base_64| (store (select |v_#memory_int_185| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|) (select (select |v_#memory_int_186| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))) |v_#memory_int_186|) (<= (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 20) (select |#length| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))) (= (store (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (select (select |v_#memory_$Pointer$.offset_218| (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))))) |v_#memory_$Pointer$.offset_218|) (<= 0 (+ (select (select |v_#memory_int_188| (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) 2147483648)) (<= 0 (+ (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_218| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 20)) 2147483648)) (= (store |v_#memory_int_187| (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_int_187| (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (select (select |v_#memory_int_188| (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))))) |v_#memory_int_188|) (= (store |v_#memory_$Pointer$.base_229| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_229| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_218| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 20) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_218| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 20)))) |#memory_$Pointer$.base|) (<= (select (select |v_#memory_int_188| (select (select (store |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_227| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_64|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select (store |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_216| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_57|)) |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) 2147483647) (<= (+ (select (select |v_#memory_$Pointer$.offset_218| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 24) (select |#length| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))) (<= (+ 12 |v_ULTIMATE.start_create_~now~0#1.offset_57|) (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_64|)) (<= 0 (+ (select (select |v_#memory_$Pointer$.offset_218| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 20)) (= |#memory_int| (store |v_#memory_int_188| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_int_188| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_218| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 20) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_218| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 20))))) (= (store |v_#memory_int_186| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_int_186| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12) (select (select |v_#memory_int_187| (select (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (+ (select (select |v_#memory_$Pointer$.offset_216| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 12)))) |v_#memory_int_187|) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_229| |v_ULTIMATE.start_create_~now~0#1.base_64|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) 1))) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_create_#res#1.base|) (= |ULTIMATE.start_loop_#in~l#1.offset| |ULTIMATE.start_main_~l~0#1.offset|))' at error location [2023-12-02 14:12:47,576 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:12:47,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:12:47,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2023-12-02 14:12:47,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082753192] [2023-12-02 14:12:47,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:12:47,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:12:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:12:47,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:12:47,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=711, Unknown=25, NotChecked=0, Total=812 [2023-12-02 14:12:47,578 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:12:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:12:47,709 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2023-12-02 14:12:47,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:12:47,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-12-02 14:12:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:12:47,711 INFO L225 Difference]: With dead ends: 87 [2023-12-02 14:12:47,711 INFO L226 Difference]: Without dead ends: 87 [2023-12-02 14:12:47,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 146.8s TimeCoverageRelationStatistics Valid=76, Invalid=711, Unknown=25, NotChecked=0, Total=812 [2023-12-02 14:12:47,712 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:12:47,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:12:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-02 14:12:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2023-12-02 14:12:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 79 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:12:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2023-12-02 14:12:47,716 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 33 [2023-12-02 14:12:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:12:47,716 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2023-12-02 14:12:47,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:12:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2023-12-02 14:12:47,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 14:12:47,716 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:12:47,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:12:47,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 14:12:47,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 14:12:47,917 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:12:47,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:12:47,918 INFO L85 PathProgramCache]: Analyzing trace with hash 432530250, now seen corresponding path program 1 times [2023-12-02 14:12:47,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:12:47,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043240915] [2023-12-02 14:12:47,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:12:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:12:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:12:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 14:12:48,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:12:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043240915] [2023-12-02 14:12:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043240915] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:12:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447814489] [2023-12-02 14:12:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:12:48,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:12:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:12:48,223 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:12:48,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 14:12:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:12:48,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 14:12:48,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:12:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:12:48,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:12:48,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:12:48,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 14:12:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:12:48,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447814489] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:12:48,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102561991] [2023-12-02 14:12:48,994 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 14:12:48,994 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:12:48,995 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:12:48,995 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:12:48,995 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:12:56,559 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2023-12-02 14:12:56,604 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:14:41,749 WARN L293 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 272 DAG size of output: 260 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:15:04,238 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification. DAG size of input: 277 DAG size of output: 263 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:15:04,240 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5692#(and (= |ULTIMATE.start_main_~l~0#1.offset| |ULTIMATE.start_create_#res#1.offset|) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_loop_#in~l#1.base|) (= |ULTIMATE.start_loop_~l#1.base| |ULTIMATE.start_loop_#in~l#1.base|) (exists ((|v_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_259| (Array Int (Array Int Int))) (|v_#memory_int_229| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~0#1.base_70| Int) (|v_ULTIMATE.start_create_~now~0#1.offset_63| Int) (|v_#memory_$Pointer$.base_270| (Array Int (Array Int Int))) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_268| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_267| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_256| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_257| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (select (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (select (select |v_#memory_$Pointer$.base_270| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (select (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))))) |v_#memory_$Pointer$.base_270|) (<= 0 (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (= (store |v_#memory_int_228| |v_ULTIMATE.start_create_~now~0#1.base_70| (store (select |v_#memory_int_228| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|) (select (select |v_#memory_int_229| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)))) |v_#memory_int_229|) (<= (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_259| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 20)) 2147483647) (= (store |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_create_~now~0#1.base_70| (store (select |v_#memory_$Pointer$.offset_256| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|) (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)))) |v_#memory_$Pointer$.offset_257|) (= (store (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (select (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (select (select |v_#memory_$Pointer$.offset_259| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (select (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))))) |v_#memory_$Pointer$.offset_259|) (= (store |v_#memory_$Pointer$.base_270| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_270| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_259| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 20) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_259| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 20)))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_231| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_int_231| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_259| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 20) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_259| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 20))))) (<= (select (select |v_#memory_int_231| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (select (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) 2147483647) (<= (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 20) (select |#length| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)))) (<= (+ (select (select |v_#memory_$Pointer$.offset_259| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 24) (select |#length| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_259| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_259| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_259| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 20) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_259| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 20))))) (= (store |v_#memory_int_229| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_int_229| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) (select (select |v_#memory_int_230| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12)))) |v_#memory_int_230|) (<= 0 (select (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (= (store |v_#memory_$Pointer$.base_267| |v_ULTIMATE.start_create_~now~0#1.base_70| (store (select |v_#memory_$Pointer$.base_267| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|) (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)))) |v_#memory_$Pointer$.base_268|) (<= 0 (+ (select (select |v_#memory_$Pointer$.offset_259| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 20)) (<= 0 (+ 2147483648 (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_259| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 20)))) (= (select |#valid| |v_ULTIMATE.start_create_~now~0#1.base_70|) 1) (= |v_#memory_int_231| (store |v_#memory_int_230| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_int_230| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (select (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (select (select |v_#memory_int_231| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (select (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)))))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_270| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) 1) (<= 0 (+ (select (select |v_#memory_int_231| (select (select (store |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.base_268| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_70|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (select (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_268| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) (+ (select (select |v_#memory_$Pointer$.offset_257| |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_63|)) |v_ULTIMATE.start_create_~now~0#1.base_70|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_63|))) 2147483648)) (<= (+ 12 |v_ULTIMATE.start_create_~now~0#1.offset_63|) (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_70|)))) (= |ULTIMATE.start_loop_~l#1.base| |ULTIMATE.start_loop_~node~0#1.base|) (= |ULTIMATE.start_loop_~node~0#1.offset| |ULTIMATE.start_loop_~l#1.offset|) (or (< (select |#length| |ULTIMATE.start_loop_~node~0#1.base|) (+ |ULTIMATE.start_loop_~node~0#1.offset| 12)) (< (+ |ULTIMATE.start_loop_~node~0#1.offset| 4) 0)) (= |ULTIMATE.start_loop_#in~l#1.offset| |ULTIMATE.start_loop_~l#1.offset|) (or (not (= |ULTIMATE.start_loop_~node~0#1.base| 0)) (not (= |ULTIMATE.start_loop_~node~0#1.offset| 0))) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_create_#res#1.base|) (= |ULTIMATE.start_loop_#in~l#1.offset| |ULTIMATE.start_main_~l~0#1.offset|))' at error location [2023-12-02 14:15:04,240 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:15:04,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:15:04,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 16 [2023-12-02 14:15:04,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026166761] [2023-12-02 14:15:04,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:15:04,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 14:15:04,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:15:04,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 14:15:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1393, Unknown=28, NotChecked=0, Total=1560 [2023-12-02 14:15:04,243 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 14:15:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:15:04,562 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2023-12-02 14:15:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 14:15:04,563 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2023-12-02 14:15:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:15:04,564 INFO L225 Difference]: With dead ends: 86 [2023-12-02 14:15:04,564 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 14:15:04,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 128.0s TimeCoverageRelationStatistics Valid=144, Invalid=1468, Unknown=28, NotChecked=0, Total=1640 [2023-12-02 14:15:04,566 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:15:04,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 214 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:15:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 14:15:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-12-02 14:15:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.507936507936508) internal successors, (95), 79 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:15:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2023-12-02 14:15:04,571 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 33 [2023-12-02 14:15:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:15:04,571 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2023-12-02 14:15:04,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 14:15:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2023-12-02 14:15:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 14:15:04,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:15:04,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:15:04,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 14:15:04,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 14:15:04,773 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:15:04,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:15:04,773 INFO L85 PathProgramCache]: Analyzing trace with hash -950213974, now seen corresponding path program 1 times [2023-12-02 14:15:04,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:15:04,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640409919] [2023-12-02 14:15:04,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:15:04,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:15:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:15:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:15:05,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:15:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640409919] [2023-12-02 14:15:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640409919] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:15:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624548645] [2023-12-02 14:15:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:15:05,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:15:05,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:15:05,840 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:15:05,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 14:15:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:15:06,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-02 14:15:06,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:15:06,244 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 14:15:06,245 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-12-02 14:15:06,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:15:06,480 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:15:06,481 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-12-02 14:15:06,598 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:15:06,598 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-12-02 14:15:06,679 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:15:06,680 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-12-02 14:15:06,823 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 31 treesize of output 13 [2023-12-02 14:15:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:15:06,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:15:06,986 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2183 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2183) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))))) is different from false [2023-12-02 14:15:06,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2183 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) v_ArrVal_2183) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) 1)) is different from false [2023-12-02 14:15:07,237 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2183 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2182))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2183))) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) 1)) is different from false [2023-12-02 14:15:07,248 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2182 (Array Int Int)) (v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2183 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2181))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2182)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2183))) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) 1)) is different from false [2023-12-02 14:15:07,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:15:07,393 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 90 treesize of output 61 [2023-12-02 14:15:07,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:15:07,411 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 3452 treesize of output 2821 [2023-12-02 14:15:07,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:15:07,560 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 955 treesize of output 763 [2023-12-02 14:15:07,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:15:07,587 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 755 treesize of output 711 [2023-12-02 14:15:07,602 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 703 treesize of output 647 [2023-12-02 14:15:11,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624548645] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:15:11,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [902118019] [2023-12-02 14:15:11,546 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 14:15:11,546 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:15:11,547 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:15:11,547 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:15:11,547 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:15:24,484 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2023-12-02 14:15:24,539 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:16:50,452 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6079#(and (or (not (= |ULTIMATE.start_loop_~node~0#1.base| 0)) (not (= |ULTIMATE.start_loop_~node~0#1.offset| 0))) (not (= (select |#valid| |ULTIMATE.start_loop_~node~0#1.base|) 1)))' at error location [2023-12-02 14:16:50,452 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:16:50,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 14:16:50,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2023-12-02 14:16:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856142261] [2023-12-02 14:16:50,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 14:16:50,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 14:16:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:16:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 14:16:50,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3161, Unknown=51, NotChecked=468, Total=3906 [2023-12-02 14:16:50,456 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 31 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 14:16:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:16:51,776 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2023-12-02 14:16:51,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 14:16:51,776 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2023-12-02 14:16:51,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:16:51,777 INFO L225 Difference]: With dead ends: 89 [2023-12-02 14:16:51,777 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 14:16:51,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 88.6s TimeCoverageRelationStatistics Valid=335, Invalid=4183, Unknown=54, NotChecked=540, Total=5112 [2023-12-02 14:16:51,780 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:16:51,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 364 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 14:16:51,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 14:16:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2023-12-02 14:16:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.523076923076923) internal successors, (99), 81 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:16:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2023-12-02 14:16:51,783 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 35 [2023-12-02 14:16:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:16:51,783 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2023-12-02 14:16:51,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 14:16:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2023-12-02 14:16:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 14:16:51,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:16:51,784 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:16:51,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 14:16:51,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 14:16:51,985 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:16:51,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:16:51,985 INFO L85 PathProgramCache]: Analyzing trace with hash -950213973, now seen corresponding path program 1 times [2023-12-02 14:16:51,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:16:51,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109550128] [2023-12-02 14:16:51,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:16:51,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:16:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:16:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:16:53,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:16:53,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109550128] [2023-12-02 14:16:53,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109550128] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:16:53,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429777108] [2023-12-02 14:16:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:16:53,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:16:53,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:16:53,354 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:16:53,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 14:16:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:16:53,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-02 14:16:53,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:16:53,679 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-12-02 14:16:53,809 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 14:16:53,809 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-12-02 14:16:53,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:16:53,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 14:16:54,068 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:16:54,068 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:16:54,081 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 30 treesize of output 13 [2023-12-02 14:16:54,222 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:16:54,222 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:16:54,232 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 30 treesize of output 13 [2023-12-02 14:16:54,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:16:54,342 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:16:54,355 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 30 treesize of output 13 [2023-12-02 14:16:54,537 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 31 treesize of output 13 [2023-12-02 14:16:54,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-02 14:16:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:16:54,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:16:55,024 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2369) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2370) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))) (forall ((v_ArrVal_2369 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2369) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))))) is different from false [2023-12-02 14:16:55,042 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2367))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2368) .cse0 v_ArrVal_2369) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2370) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2368) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2367) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_2369) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))))) is different from false [2023-12-02 14:16:55,063 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2368) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2367) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2369) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))) (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2367))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2368) .cse3 v_ArrVal_2369) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2370) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))))))))) is different from false [2023-12-02 14:16:55,089 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2366))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse0 v_ArrVal_2367))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2365) .cse0 v_ArrVal_2368) .cse1 v_ArrVal_2369) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2370) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2366))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2365) .cse6 v_ArrVal_2368) (select (select (store .cse7 .cse6 v_ArrVal_2367) |c_ULTIMATE.start_create_~now~0#1.base|) .cse4) v_ArrVal_2369))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4))))) is different from false [2023-12-02 14:16:55,115 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2366))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2365) .cse1 v_ArrVal_2368) (select (select (store .cse2 .cse1 v_ArrVal_2367) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_2369))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4))) (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2370 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2366))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_2367))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2365) .cse5 v_ArrVal_2368) .cse6 v_ArrVal_2369) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 12) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_2370) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 14:16:55,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:16:55,130 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 177 treesize of output 178 [2023-12-02 14:16:55,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:16:55,140 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 167 treesize of output 108 [2023-12-02 14:16:55,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:16:55,172 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 9098 treesize of output 7531 [2023-12-02 14:16:55,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:16:55,387 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 34009 treesize of output 33006 [2023-12-02 14:16:55,647 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 3679 treesize of output 3471 [2023-12-02 14:16:55,696 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 3471 treesize of output 3263 [2023-12-02 14:16:55,735 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 3263 treesize of output 3199 [2023-12-02 14:16:55,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:16:55,791 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 3199 treesize of output 2783 [2023-12-02 14:16:55,837 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 2775 treesize of output 2711 [2023-12-02 14:16:55,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:16:55,894 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 2711 treesize of output 2079 [2023-12-02 14:17:02,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:02,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2023-12-02 14:17:02,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:02,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2023-12-02 14:17:02,903 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:17:02,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 55 [2023-12-02 14:17:02,912 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:17:02,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:17:02,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 14:17:03,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429777108] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:17:03,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1910261492] [2023-12-02 14:17:03,176 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 14:17:03,176 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:17:03,176 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:17:03,176 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:17:03,177 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:17:17,120 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2023-12-02 14:17:17,189 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:18:48,398 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6487#(and (or (< (select |#length| |ULTIMATE.start_loop_~node~0#1.base|) (+ |ULTIMATE.start_loop_~node~0#1.offset| 12)) (< (+ |ULTIMATE.start_loop_~node~0#1.offset| 4) 0)) (or (not (= |ULTIMATE.start_loop_~node~0#1.base| 0)) (not (= |ULTIMATE.start_loop_~node~0#1.offset| 0))))' at error location [2023-12-02 14:18:48,398 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:18:48,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 14:18:48,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 30 [2023-12-02 14:18:48,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621750008] [2023-12-02 14:18:48,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 14:18:48,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 14:18:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:18:48,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 14:18:48,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3159, Unknown=63, NotChecked=590, Total=4032 [2023-12-02 14:18:48,401 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand has 31 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 14:18:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:18:50,135 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2023-12-02 14:18:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 14:18:50,136 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2023-12-02 14:18:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:18:50,137 INFO L225 Difference]: With dead ends: 88 [2023-12-02 14:18:50,137 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 14:18:50,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 93.8s TimeCoverageRelationStatistics Valid=324, Invalid=4183, Unknown=69, NotChecked=680, Total=5256 [2023-12-02 14:18:50,139 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 14:18:50,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 402 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 14:18:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 14:18:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2023-12-02 14:18:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 81 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:18:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2023-12-02 14:18:50,144 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 35 [2023-12-02 14:18:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:18:50,144 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2023-12-02 14:18:50,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 14:18:50,144 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2023-12-02 14:18:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 14:18:50,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:18:50,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:18:50,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 14:18:50,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 14:18:50,346 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:18:50,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:18:50,346 INFO L85 PathProgramCache]: Analyzing trace with hash 608152863, now seen corresponding path program 1 times [2023-12-02 14:18:50,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:18:50,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126597273] [2023-12-02 14:18:50,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:50,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:18:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 14:18:50,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:18:50,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126597273] [2023-12-02 14:18:50,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126597273] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:18:50,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742781882] [2023-12-02 14:18:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:50,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:18:50,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:18:50,493 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:18:50,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 14:18:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:50,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 14:18:50,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:50,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 14:18:50,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:18:50,811 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 14:18:50,812 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-12-02 14:18:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 14:18:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742781882] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:18:50,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1183376981] [2023-12-02 14:18:50,838 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-12-02 14:18:50,838 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:18:50,838 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:18:50,838 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:18:50,839 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:19:00,346 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2023-12-02 14:19:00,399 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:20:44,442 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6919#(and (= |ULTIMATE.start_destroy_#in~l#1.offset| |ULTIMATE.start_main_~l~0#1.offset|) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_destroy_#in~l#1.base|) (not (= (select |#valid| |ULTIMATE.start_destroy_~l#1.base|) 1)) (= |ULTIMATE.start_destroy_#in~l#1.offset| |ULTIMATE.start_destroy_~l#1.offset|) (or (not (= |ULTIMATE.start_destroy_~l#1.base| 0)) (not (= |ULTIMATE.start_destroy_~l#1.offset| 0))) (= |ULTIMATE.start_destroy_#in~l#1.base| |ULTIMATE.start_destroy_~l#1.base|))' at error location [2023-12-02 14:20:44,442 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:20:44,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:20:44,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2023-12-02 14:20:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373429326] [2023-12-02 14:20:44,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:20:44,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 14:20:44,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:20:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 14:20:44,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=817, Unknown=32, NotChecked=0, Total=930 [2023-12-02 14:20:44,444 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:20:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:20:44,684 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2023-12-02 14:20:44,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 14:20:44,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2023-12-02 14:20:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:20:44,685 INFO L225 Difference]: With dead ends: 104 [2023-12-02 14:20:44,685 INFO L226 Difference]: Without dead ends: 104 [2023-12-02 14:20:44,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 104.1s TimeCoverageRelationStatistics Valid=85, Invalid=874, Unknown=33, NotChecked=0, Total=992 [2023-12-02 14:20:44,687 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:20:44,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 95 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:20:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-02 14:20:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2023-12-02 14:20:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 87 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:20:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2023-12-02 14:20:44,692 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 36 [2023-12-02 14:20:44,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:20:44,692 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2023-12-02 14:20:44,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:20:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2023-12-02 14:20:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 14:20:44,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:20:44,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:20:44,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 14:20:44,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 14:20:44,894 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:20:44,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:20:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash 608152864, now seen corresponding path program 1 times [2023-12-02 14:20:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:20:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988904441] [2023-12-02 14:20:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:20:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 14:20:45,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:20:45,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988904441] [2023-12-02 14:20:45,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988904441] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:20:45,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922625852] [2023-12-02 14:20:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:45,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:20:45,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:20:45,186 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:20:45,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 14:20:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:45,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 14:20:45,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 14:20:45,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:45,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:45,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 14:20:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 14:20:46,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922625852] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:20:46,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690914185] [2023-12-02 14:20:46,007 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-12-02 14:20:46,007 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:20:46,007 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:20:46,007 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:20:46,008 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:20:59,943 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2023-12-02 14:20:59,984 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:22:22,394 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7371#(and (= |ULTIMATE.start_destroy_#in~l#1.offset| |ULTIMATE.start_main_~l~0#1.offset|) (or (< (select |#length| |ULTIMATE.start_destroy_~l#1.base|) (+ |ULTIMATE.start_destroy_~l#1.offset| 12)) (< (+ |ULTIMATE.start_destroy_~l#1.offset| 4) 0)) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_destroy_#in~l#1.base|) (= |ULTIMATE.start_destroy_#in~l#1.offset| |ULTIMATE.start_destroy_~l#1.offset|) (or (not (= |ULTIMATE.start_destroy_~l#1.base| 0)) (not (= |ULTIMATE.start_destroy_~l#1.offset| 0))) (= |ULTIMATE.start_destroy_#in~l#1.base| |ULTIMATE.start_destroy_~l#1.base|))' at error location [2023-12-02 14:22:22,394 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:22:22,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:22:22,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2023-12-02 14:22:22,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029171446] [2023-12-02 14:22:22,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:22:22,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 14:22:22,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:22:22,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 14:22:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1646, Unknown=30, NotChecked=0, Total=1806 [2023-12-02 14:22:22,397 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 19 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 14:22:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:22:23,101 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2023-12-02 14:22:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 14:22:23,102 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2023-12-02 14:22:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:22:23,103 INFO L225 Difference]: With dead ends: 97 [2023-12-02 14:22:23,103 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 14:22:23,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 83.1s TimeCoverageRelationStatistics Valid=185, Invalid=2229, Unknown=36, NotChecked=0, Total=2450 [2023-12-02 14:22:23,104 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 79 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:22:23,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 193 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 14:22:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 14:22:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2023-12-02 14:22:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 87 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:22:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2023-12-02 14:22:23,108 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 36 [2023-12-02 14:22:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:22:23,108 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2023-12-02 14:22:23,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 14:22:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2023-12-02 14:22:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 14:22:23,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:22:23,108 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:22:23,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 14:22:23,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:22:23,309 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2023-12-02 14:22:23,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:22:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1672449483, now seen corresponding path program 2 times [2023-12-02 14:22:23,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:22:23,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887930068] [2023-12-02 14:22:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:22:23,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:22:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:22:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:22:25,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:22:25,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887930068] [2023-12-02 14:22:25,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887930068] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:22:25,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392575079] [2023-12-02 14:22:25,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 14:22:25,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:22:25,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:22:25,850 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:22:25,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60935eeb-b324-489e-9f6d-69e44b403a50/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 14:22:27,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 14:22:27,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:22:27,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 106 conjunts are in the unsatisfiable core [2023-12-02 14:22:27,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:22:27,643 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-12-02 14:22:27,649 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-12-02 14:22:27,706 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 11 [2023-12-02 14:22:27,711 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 11 [2023-12-02 14:22:27,724 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 11 [2023-12-02 14:22:27,730 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 11 [2023-12-02 14:22:27,740 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 11 [2023-12-02 14:22:27,746 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 11 [2023-12-02 14:22:27,806 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 14:22:27,806 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-12-02 14:22:27,831 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 22 [2023-12-02 14:22:27,843 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 15 [2023-12-02 14:22:28,001 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 14:22:28,001 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 1 case distinctions, treesize of input 69 treesize of output 50 [2023-12-02 14:22:28,009 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 36 [2023-12-02 14:22:28,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:22:28,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:22:28,249 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 14:22:28,249 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 75 [2023-12-02 14:22:28,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:22:28,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:22:28,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2023-12-02 14:22:28,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:22:28,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:22:28,415 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 14:22:28,416 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 83 [2023-12-02 14:22:28,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:22:28,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:22:28,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2023-12-02 14:22:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:22:28,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:22:29,060 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse1 (+ 20 |c_ULTIMATE.start_create_#t~mem12#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2923 (Array Int Int))) (or (not (= v_ArrVal_2923 (store .cse0 .cse1 (select v_ArrVal_2923 .cse1)))) (forall ((v_ArrVal_2925 Int)) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2923))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base| (store .cse3 .cse1 v_ArrVal_2925)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)) (+ (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4))) 0)))) (forall ((v_ArrVal_2923 (Array Int Int))) (or (not (= v_ArrVal_2923 (store .cse0 .cse1 (select v_ArrVal_2923 .cse1)))) (forall ((v_ArrVal_2925 Int)) (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base| (store .cse3 .cse1 v_ArrVal_2925)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2923) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4)) 0)))))) is different from false [2023-12-02 14:22:29,099 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4)) (.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (and (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_48| Int)) (or (forall ((v_ArrVal_2923 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_48| 20))) (or (not (= v_ArrVal_2923 (store .cse0 .cse1 (select v_ArrVal_2923 .cse1)))) (forall ((v_ArrVal_2925 Int)) (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse1 v_ArrVal_2925)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2923) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4)) 0))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_48| .cse6))) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_48| Int)) (or (forall ((v_ArrVal_2923 (Array Int Int))) (let ((.cse7 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_48| 20))) (or (not (= v_ArrVal_2923 (store .cse0 .cse7 (select v_ArrVal_2923 .cse7)))) (forall ((v_ArrVal_2925 Int)) (= (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2923))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse7 v_ArrVal_2925)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)) (+ (select (select .cse8 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4))) 0))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_48| .cse6))))))) is different from false [2023-12-02 14:22:29,776 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse6 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$.base| .cse7)) (.cse9 (select |c_#memory_$Pointer$.offset| .cse7))) (and (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_48| Int)) (or (forall ((v_ArrVal_2922 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_48| Int) (v_ArrVal_2920 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_2922))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_48| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_2923 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| v_ArrVal_2920)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse5 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_48| 20))) (or (forall ((v_ArrVal_2925 Int)) (= (let ((.cse2 (store .cse0 .cse4 v_ArrVal_2923))) (select (select .cse2 (select (select (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_2925)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6)) (+ (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4))) 0)) (not (= v_ArrVal_2923 (store (select .cse0 .cse4) .cse5 (select v_ArrVal_2923 .cse5))))))))))) (not (= (store .cse9 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| (select v_ArrVal_2922 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|)) v_ArrVal_2922)))) (< .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|))) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_48| Int)) (or (< .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|) (forall ((v_ArrVal_2922 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_48| Int) (v_ArrVal_2920 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_2922))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_48| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_2923 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| v_ArrVal_2920)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse15 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_48| 20))) (or (forall ((v_ArrVal_2925 Int)) (= (select (let ((.cse12 (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 v_ArrVal_2925)))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6))) (+ (select (select (store .cse11 .cse14 v_ArrVal_2923) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4)) 0)) (not (= v_ArrVal_2923 (store (select .cse11 .cse14) .cse15 (select v_ArrVal_2923 .cse15))))))))))) (not (= (store .cse9 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| (select v_ArrVal_2922 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|)) v_ArrVal_2922)))))))))) is different from false [2023-12-02 14:22:29,888 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_ULTIMATE.start_create_#t~mem9#1.offset| 12))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) .cse18 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse8 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|) .cse18 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse10 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (let ((.cse7 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse11 (select .cse9 .cse10)) (.cse1 (select .cse12 .cse10)) (.cse0 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (and (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_48| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|) (forall ((v_ArrVal_2922 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| (select v_ArrVal_2922 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|)) v_ArrVal_2922)) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_48| Int) (v_ArrVal_2920 Int)) (let ((.cse2 (store .cse12 .cse10 v_ArrVal_2922))) (or (forall ((v_ArrVal_2923 (Array Int Int))) (let ((.cse6 (store .cse9 .cse10 (store .cse11 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| v_ArrVal_2920)))) (let ((.cse4 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_48| 20)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (or (not (= v_ArrVal_2923 (store (select .cse2 .cse3) .cse4 (select v_ArrVal_2923 .cse4)))) (forall ((v_ArrVal_2925 Int)) (= (let ((.cse5 (store .cse2 .cse3 v_ArrVal_2923))) (select (select .cse5 (select (select (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 v_ArrVal_2925)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7)) (+ (select (select .cse5 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7) 4))) 0)))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_48| (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_48| Int)) (or (forall ((v_ArrVal_2922 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_48| Int) (v_ArrVal_2920 Int)) (let ((.cse13 (store .cse12 .cse10 v_ArrVal_2922))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_48| (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (forall ((v_ArrVal_2923 (Array Int Int))) (let ((.cse15 (store .cse9 .cse10 (store .cse11 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| v_ArrVal_2920)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (.cse17 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_48| 20))) (or (forall ((v_ArrVal_2925 Int)) (= (select (let ((.cse14 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 v_ArrVal_2925)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7))) (+ (select (select (store .cse13 .cse16 v_ArrVal_2923) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7) 4)) 0)) (not (= v_ArrVal_2923 (store (select .cse13 .cse16) .cse17 (select v_ArrVal_2923 .cse17))))))))))) (not (= (store .cse1 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| (select v_ArrVal_2922 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|)) v_ArrVal_2922)))) (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|)))))))) is different from false [2023-12-02 14:22:30,014 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse19 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7) 12))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse18 (store (select |c_#memory_$Pointer$.base| .cse18) .cse19 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse11 (store |c_#memory_$Pointer$.offset| .cse18 (store (select |c_#memory_$Pointer$.offset| .cse18) .cse19 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (let ((.cse0 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse12 (select .cse11 .cse9)) (.cse5 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse10 (select .cse8 .cse9))) (and (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_48| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|) (forall ((v_ArrVal_2922 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_48| Int) (v_ArrVal_2920 Int)) (let ((.cse6 (store .cse11 .cse9 v_ArrVal_2922))) (or (forall ((v_ArrVal_2923 (Array Int Int))) (let ((.cse2 (store .cse8 .cse9 (store .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| v_ArrVal_2920)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse4 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_48| 20))) (or (forall ((v_ArrVal_2925 Int)) (= (let ((.cse1 (store .cse6 .cse3 v_ArrVal_2923))) (select (select .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_2925)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5)) (+ (select (select .cse1 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4))) 0)) (not (= v_ArrVal_2923 (store (select .cse6 .cse3) .cse4 (select v_ArrVal_2923 .cse4)))))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_48| (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))))) (not (= v_ArrVal_2922 (store .cse12 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| (select v_ArrVal_2922 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|)))))))) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_48| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|) (forall ((v_ArrVal_2922 (Array Int Int))) (or (not (= v_ArrVal_2922 (store .cse12 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| (select v_ArrVal_2922 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|)))) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_48| Int) (v_ArrVal_2920 Int)) (let ((.cse17 (store .cse11 .cse9 v_ArrVal_2922))) (or (forall ((v_ArrVal_2923 (Array Int Int))) (let ((.cse14 (store .cse8 .cse9 (store .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| v_ArrVal_2920)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse16 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_48| 20))) (or (forall ((v_ArrVal_2925 Int)) (= (select (let ((.cse13 (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 v_ArrVal_2925)))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5))) (+ (select (select (store .cse17 .cse15 v_ArrVal_2923) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4)) 0)) (not (= v_ArrVal_2923 (store (select .cse17 .cse15) .cse16 (select v_ArrVal_2923 .cse16)))))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_48| (select (select .cse17 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))))))))))))))) is different from false [2023-12-02 14:22:30,180 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (+ 12 |c_ULTIMATE.start_create_#t~ret8#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse8 (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (store .cse20 |c_ULTIMATE.start_create_#t~ret8#1.base| (store (select .cse20 |c_ULTIMATE.start_create_#t~ret8#1.base|) .cse19 |c_ULTIMATE.start_create_~now~0#1.base|))))) (let ((.cse11 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7 |c_ULTIMATE.start_create_#t~ret8#1.offset|)))) (store .cse18 |c_ULTIMATE.start_create_#t~ret8#1.base| (store (select .cse18 |c_ULTIMATE.start_create_#t~ret8#1.base|) .cse19 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (.cse9 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (let ((.cse0 (select .cse11 .cse9)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse10 (select .cse8 .cse9)) (.cse12 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (and (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_48| Int)) (or (forall ((v_ArrVal_2922 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| (select v_ArrVal_2922 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|)) v_ArrVal_2922)) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_48| Int) (v_ArrVal_2920 Int)) (let ((.cse6 (store .cse11 .cse9 v_ArrVal_2922))) (or (forall ((v_ArrVal_2923 (Array Int Int))) (let ((.cse3 (store .cse8 .cse9 (store .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| v_ArrVal_2920)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse5 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_48| 20))) (or (forall ((v_ArrVal_2925 Int)) (= (select (let ((.cse1 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_2925)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (+ (select (select (store .cse6 .cse4 v_ArrVal_2923) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4)) 0)) (not (= (store (select .cse6 .cse4) .cse5 (select v_ArrVal_2923 .cse5)) v_ArrVal_2923)))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_48| (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))))))) (< .cse12 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|))) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_48| Int)) (or (forall ((v_ArrVal_2922 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| (select v_ArrVal_2922 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|)) v_ArrVal_2922)) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_48| Int) (v_ArrVal_2920 Int)) (let ((.cse13 (store .cse11 .cse9 v_ArrVal_2922))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_48| (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (forall ((v_ArrVal_2923 (Array Int Int))) (let ((.cse17 (store .cse8 .cse9 (store .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_48| v_ArrVal_2920)))) (let ((.cse15 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_48| 20)) (.cse14 (select (select .cse17 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (or (not (= (store (select .cse13 .cse14) .cse15 (select v_ArrVal_2923 .cse15)) v_ArrVal_2923)) (forall ((v_ArrVal_2925 Int)) (= (let ((.cse16 (store .cse13 .cse14 v_ArrVal_2923))) (select (select .cse16 (select (select (store .cse17 .cse14 (store (select .cse17 .cse14) .cse15 v_ArrVal_2925)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (+ (select (select .cse16 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4))) 0))))))))))) (< .cse12 |v_ULTIMATE.start_create_#t~mem10#1.offset_48|)))))))) is different from false [2023-12-02 14:22:33,423 INFO L349 Elim1Store]: treesize reduction 5469, result has 32.5 percent of original size [2023-12-02 14:22:33,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 3318909 treesize of output 3223344