./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/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_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/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 32bit --witnessprinter.graph.data.programhash 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:25:38,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:25:38,825 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 16:25:38,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:25:38,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:25:38,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:25:38,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:25:38,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:25:38,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:25:38,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:25:38,856 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:25:38,857 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:25:38,857 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:25:38,858 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 16:25:38,858 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:25:38,859 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:25:38,860 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 16:25:38,860 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 16:25:38,860 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:25:38,861 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 16:25:38,861 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 16:25:38,863 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 16:25:38,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 16:25:38,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 16:25:38,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:25:38,865 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:25:38,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:25:38,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:25:38,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:25:38,867 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 16:25:38,867 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 16:25:38,867 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 16:25:38,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:25:38,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 16:25:38,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:25:38,868 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:25:38,868 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:25:38,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:25:38,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:25:38,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:25:38,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:25:38,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:25:38,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:25:38,870 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 16:25:38,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 16:25:38,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:25:38,871 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:25:38,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:25:38,871 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_00152099-1cf5-47e3-a10b-6141914ea1ae/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_00152099-1cf5-47e3-a10b-6141914ea1ae/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2023-12-02 16:25:39,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:25:39,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:25:39,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:25:39,139 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:25:39,139 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:25:39,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/dll-reverse.i [2023-12-02 16:25:41,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:25:42,130 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:25:42,131 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/sv-benchmarks/c/forester-heap/dll-reverse.i [2023-12-02 16:25:42,144 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/data/1de0d290c/737a529743b146c5a213b62dd9e0efec/FLAGac9f75629 [2023-12-02 16:25:42,156 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/data/1de0d290c/737a529743b146c5a213b62dd9e0efec [2023-12-02 16:25:42,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:25:42,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:25:42,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:25:42,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:25:42,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:25:42,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102d7b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42, skipping insertion in model container [2023-12-02 16:25:42,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,218 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:25:42,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:25:42,498 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:25:42,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:25:42,571 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:25:42,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42 WrapperNode [2023-12-02 16:25:42,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:25:42,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:25:42,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:25:42,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:25:42,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,616 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2023-12-02 16:25:42,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:25:42,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:25:42,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:25:42,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:25:42,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:25:42,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:25:42,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:25:42,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:25:42,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (1/1) ... [2023-12-02 16:25:42,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:25:42,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:25:42,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:25:42,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:25:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 16:25:42,716 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 16:25:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 16:25:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 16:25:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 16:25:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:25:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 16:25:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 16:25:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 16:25:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 16:25:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:25:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:25:42,833 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:25:42,835 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:25:43,215 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:25:43,269 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:25:43,269 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-12-02 16:25:43,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:25:43 BoogieIcfgContainer [2023-12-02 16:25:43,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:25:43,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:25:43,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:25:43,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:25:43,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:25:42" (1/3) ... [2023-12-02 16:25:43,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6f8ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:25:43, skipping insertion in model container [2023-12-02 16:25:43,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:25:42" (2/3) ... [2023-12-02 16:25:43,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6f8ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:25:43, skipping insertion in model container [2023-12-02 16:25:43,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:25:43" (3/3) ... [2023-12-02 16:25:43,279 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2023-12-02 16:25:43,294 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:25:43,294 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2023-12-02 16:25:43,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:25:43,341 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;@5d8a139c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:25:43,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2023-12-02 16:25:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 59 states have (on average 2.4745762711864407) internal successors, (146), 126 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:25:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 16:25:43,349 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:43,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 16:25:43,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:43,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash 10181, now seen corresponding path program 1 times [2023-12-02 16:25:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:43,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576159254] [2023-12-02 16:25:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:43,530 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 16:25:43,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:43,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576159254] [2023-12-02 16:25:43,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576159254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:43,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:43,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 16:25:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415671558] [2023-12-02 16:25:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:43,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:25:43,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:43,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:25:43,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:25:43,566 INFO L87 Difference]: Start difference. First operand has 131 states, 59 states have (on average 2.4745762711864407) internal successors, (146), 126 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:43,717 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2023-12-02 16:25:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:25:43,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 16:25:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:43,727 INFO L225 Difference]: With dead ends: 123 [2023-12-02 16:25:43,728 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 16:25:43,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:25:43,733 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 83 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:43,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 90 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:25:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 16:25:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-12-02 16:25:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 55 states have (on average 2.327272727272727) internal successors, (128), 120 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2023-12-02 16:25:43,768 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 2 [2023-12-02 16:25:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:43,768 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2023-12-02 16:25:43,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2023-12-02 16:25:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 16:25:43,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:43,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 16:25:43,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 16:25:43,770 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:43,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:43,771 INFO L85 PathProgramCache]: Analyzing trace with hash 10182, now seen corresponding path program 1 times [2023-12-02 16:25:43,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:43,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570385970] [2023-12-02 16:25:43,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:43,860 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 16:25:43,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:43,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570385970] [2023-12-02 16:25:43,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570385970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:43,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:43,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 16:25:43,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197077436] [2023-12-02 16:25:43,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:43,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:25:43,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:43,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:25:43,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:25:43,864 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:43,997 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2023-12-02 16:25:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:25:43,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 16:25:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:44,000 INFO L225 Difference]: With dead ends: 119 [2023-12-02 16:25:44,000 INFO L226 Difference]: Without dead ends: 119 [2023-12-02 16:25:44,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:25:44,002 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 80 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:44,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 89 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:25:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-02 16:25:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-12-02 16:25:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 55 states have (on average 2.272727272727273) internal successors, (125), 117 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2023-12-02 16:25:44,015 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 2 [2023-12-02 16:25:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:44,015 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2023-12-02 16:25:44,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2023-12-02 16:25:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 16:25:44,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:44,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:25:44,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 16:25:44,017 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:44,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash -590619927, now seen corresponding path program 1 times [2023-12-02 16:25:44,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:44,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029225301] [2023-12-02 16:25:44,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:44,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:44,211 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 16:25:44,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029225301] [2023-12-02 16:25:44,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029225301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:44,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:44,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:25:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158314358] [2023-12-02 16:25:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:44,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:25:44,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:44,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:25:44,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:25:44,215 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:44,416 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-12-02 16:25:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:25:44,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 16:25:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:44,419 INFO L225 Difference]: With dead ends: 109 [2023-12-02 16:25:44,419 INFO L226 Difference]: Without dead ends: 109 [2023-12-02 16:25:44,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:25:44,421 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 133 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:44,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 60 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:25:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-02 16:25:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2023-12-02 16:25:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 104 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2023-12-02 16:25:44,432 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 7 [2023-12-02 16:25:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:44,432 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2023-12-02 16:25:44,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2023-12-02 16:25:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 16:25:44,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:44,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:25:44,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 16:25:44,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:44,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash -590619926, now seen corresponding path program 1 times [2023-12-02 16:25:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:44,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568586389] [2023-12-02 16:25:44,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:44,590 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 16:25:44,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568586389] [2023-12-02 16:25:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568586389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:44,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:44,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:25:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263662344] [2023-12-02 16:25:44,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:44,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:25:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:25:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:25:44,593 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:44,816 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2023-12-02 16:25:44,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:25:44,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 16:25:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:44,818 INFO L225 Difference]: With dead ends: 139 [2023-12-02 16:25:44,818 INFO L226 Difference]: Without dead ends: 139 [2023-12-02 16:25:44,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:25:44,820 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 131 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:44,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 92 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:25:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-02 16:25:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 128. [2023-12-02 16:25:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.7901234567901234) internal successors, (145), 126 states have internal predecessors, (145), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 148 transitions. [2023-12-02 16:25:44,830 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 148 transitions. Word has length 7 [2023-12-02 16:25:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:44,830 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 148 transitions. [2023-12-02 16:25:44,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 148 transitions. [2023-12-02 16:25:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 16:25:44,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:44,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:25:44,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 16:25:44,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:44,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash -649816720, now seen corresponding path program 1 times [2023-12-02 16:25:44,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:44,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845450281] [2023-12-02 16:25:44,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:44,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:44,943 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 16:25:44,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:44,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845450281] [2023-12-02 16:25:44,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845450281] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:44,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:44,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:25:44,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051137589] [2023-12-02 16:25:44,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:44,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:25:44,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:44,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:25:44,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:25:44,946 INFO L87 Difference]: Start difference. First operand 128 states and 148 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:45,120 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2023-12-02 16:25:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:25:45,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 16:25:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:45,122 INFO L225 Difference]: With dead ends: 127 [2023-12-02 16:25:45,122 INFO L226 Difference]: Without dead ends: 127 [2023-12-02 16:25:45,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:25:45,124 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:45,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:25:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-02 16:25:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-12-02 16:25:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 81 states have (on average 1.7654320987654322) internal successors, (143), 125 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2023-12-02 16:25:45,133 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 9 [2023-12-02 16:25:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:45,133 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2023-12-02 16:25:45,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2023-12-02 16:25:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 16:25:45,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:45,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:25:45,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 16:25:45,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:45,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -649816719, now seen corresponding path program 1 times [2023-12-02 16:25:45,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:45,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162926446] [2023-12-02 16:25:45,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:45,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:45,305 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 16:25:45,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:45,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162926446] [2023-12-02 16:25:45,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162926446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:45,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:45,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:25:45,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325411543] [2023-12-02 16:25:45,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:45,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:25:45,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:45,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:25:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:25:45,307 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:45,519 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2023-12-02 16:25:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:25:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 16:25:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:45,521 INFO L225 Difference]: With dead ends: 126 [2023-12-02 16:25:45,521 INFO L226 Difference]: Without dead ends: 126 [2023-12-02 16:25:45,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:25:45,522 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:45,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 204 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:25:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-02 16:25:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-12-02 16:25:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.7407407407407407) internal successors, (141), 124 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2023-12-02 16:25:45,530 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 9 [2023-12-02 16:25:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:45,530 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2023-12-02 16:25:45,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2023-12-02 16:25:45,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 16:25:45,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:45,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:25:45,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 16:25:45,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:45,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:45,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1703357705, now seen corresponding path program 1 times [2023-12-02 16:25:45,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:45,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981191456] [2023-12-02 16:25:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:45,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:45,762 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 16:25:45,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:45,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981191456] [2023-12-02 16:25:45,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981191456] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:45,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:45,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 16:25:45,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320545469] [2023-12-02 16:25:45,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:45,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:25:45,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:45,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:25:45,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:25:45,764 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:46,096 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2023-12-02 16:25:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 16:25:46,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 16:25:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:46,098 INFO L225 Difference]: With dead ends: 126 [2023-12-02 16:25:46,098 INFO L226 Difference]: Without dead ends: 126 [2023-12-02 16:25:46,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 16:25:46,099 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 130 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:46,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 152 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:25:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-02 16:25:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2023-12-02 16:25:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 81 states have (on average 1.728395061728395) internal successors, (140), 123 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2023-12-02 16:25:46,106 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 11 [2023-12-02 16:25:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:46,107 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2023-12-02 16:25:46,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2023-12-02 16:25:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 16:25:46,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:46,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:25:46,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 16:25:46,108 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:46,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1703357704, now seen corresponding path program 1 times [2023-12-02 16:25:46,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:46,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814109572] [2023-12-02 16:25:46,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:46,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:46,360 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 16:25:46,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814109572] [2023-12-02 16:25:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814109572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:46,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:46,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 16:25:46,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970594907] [2023-12-02 16:25:46,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:46,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 16:25:46,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:46,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 16:25:46,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 16:25:46,363 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:46,823 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2023-12-02 16:25:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 16:25:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 16:25:46,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:46,825 INFO L225 Difference]: With dead ends: 122 [2023-12-02 16:25:46,825 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 16:25:46,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-12-02 16:25:46,826 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 123 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:46,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 172 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:25:46,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 16:25:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2023-12-02 16:25:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.7066666666666668) internal successors, (128), 112 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2023-12-02 16:25:46,832 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 11 [2023-12-02 16:25:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:46,832 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2023-12-02 16:25:46,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2023-12-02 16:25:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 16:25:46,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:46,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:25:46,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 16:25:46,834 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:46,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash 84494377, now seen corresponding path program 1 times [2023-12-02 16:25:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:46,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514918028] [2023-12-02 16:25:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:46,875 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 16:25:46,875 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:46,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514918028] [2023-12-02 16:25:46,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514918028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:46,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:46,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:25:46,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481718749] [2023-12-02 16:25:46,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:46,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:25:46,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:46,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:25:46,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:25:46,877 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:47,005 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2023-12-02 16:25:47,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:25:47,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 16:25:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:47,009 INFO L225 Difference]: With dead ends: 127 [2023-12-02 16:25:47,009 INFO L226 Difference]: Without dead ends: 127 [2023-12-02 16:25:47,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:25:47,010 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 115 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:47,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 132 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:25:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-02 16:25:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2023-12-02 16:25:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 112 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2023-12-02 16:25:47,015 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2023-12-02 16:25:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:47,015 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2023-12-02 16:25:47,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2023-12-02 16:25:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 16:25:47,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:47,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:25:47,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 16:25:47,016 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:47,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:47,016 INFO L85 PathProgramCache]: Analyzing trace with hash 85574505, now seen corresponding path program 1 times [2023-12-02 16:25:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:47,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137162575] [2023-12-02 16:25:47,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:25:47,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:47,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137162575] [2023-12-02 16:25:47,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137162575] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:47,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:47,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:25:47,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639035543] [2023-12-02 16:25:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:47,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:25:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:47,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:25:47,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:25:47,220 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:47,394 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2023-12-02 16:25:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:25:47,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 16:25:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:47,396 INFO L225 Difference]: With dead ends: 131 [2023-12-02 16:25:47,396 INFO L226 Difference]: Without dead ends: 131 [2023-12-02 16:25:47,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:25:47,397 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 23 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:47,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 235 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:25:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-02 16:25:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2023-12-02 16:25:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.6375) internal successors, (131), 117 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2023-12-02 16:25:47,401 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 13 [2023-12-02 16:25:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:47,401 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2023-12-02 16:25:47,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2023-12-02 16:25:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 16:25:47,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:47,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:25:47,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 16:25:47,403 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:47,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash -686501995, now seen corresponding path program 1 times [2023-12-02 16:25:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:47,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791125755] [2023-12-02 16:25:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:47,634 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 16:25:47,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:47,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791125755] [2023-12-02 16:25:47,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791125755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:47,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:47,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:25:47,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232555256] [2023-12-02 16:25:47,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:47,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:25:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:47,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:25:47,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:25:47,636 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:47,803 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2023-12-02 16:25:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:25:47,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 16:25:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:47,805 INFO L225 Difference]: With dead ends: 127 [2023-12-02 16:25:47,805 INFO L226 Difference]: Without dead ends: 127 [2023-12-02 16:25:47,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:25:47,806 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 15 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:47,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 234 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:25:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-02 16:25:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2023-12-02 16:25:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.6) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2023-12-02 16:25:47,810 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 16 [2023-12-02 16:25:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:47,810 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2023-12-02 16:25:47,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2023-12-02 16:25:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 16:25:47,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:47,811 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 16:25:47,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 16:25:47,811 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:47,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash 192721482, now seen corresponding path program 1 times [2023-12-02 16:25:47,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:47,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011570024] [2023-12-02 16:25:47,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:47,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 16:25:47,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:47,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011570024] [2023-12-02 16:25:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011570024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:47,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:47,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:25:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938139715] [2023-12-02 16:25:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:47,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:25:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:25:47,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:25:47,922 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:48,072 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2023-12-02 16:25:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:25:48,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 16:25:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:48,074 INFO L225 Difference]: With dead ends: 123 [2023-12-02 16:25:48,074 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 16:25:48,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:25:48,075 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:48,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:25:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 16:25:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-12-02 16:25:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 85 states have (on average 1.576470588235294) internal successors, (134), 121 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2023-12-02 16:25:48,079 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 17 [2023-12-02 16:25:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:48,080 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2023-12-02 16:25:48,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2023-12-02 16:25:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 16:25:48,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:48,081 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 16:25:48,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 16:25:48,081 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:48,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:48,082 INFO L85 PathProgramCache]: Analyzing trace with hash 192721483, now seen corresponding path program 1 times [2023-12-02 16:25:48,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:48,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797148919] [2023-12-02 16:25:48,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:48,239 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 16:25:48,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797148919] [2023-12-02 16:25:48,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797148919] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:48,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:48,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:25:48,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220010556] [2023-12-02 16:25:48,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:48,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:25:48,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:48,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:25:48,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:25:48,241 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:48,406 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2023-12-02 16:25:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:25:48,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 16:25:48,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:48,407 INFO L225 Difference]: With dead ends: 122 [2023-12-02 16:25:48,407 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 16:25:48,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:25:48,408 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:48,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 191 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:25:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 16:25:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-12-02 16:25:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.5529411764705883) internal successors, (132), 120 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2023-12-02 16:25:48,413 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 17 [2023-12-02 16:25:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:48,413 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2023-12-02 16:25:48,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2023-12-02 16:25:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 16:25:48,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:48,414 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 16:25:48,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 16:25:48,414 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:48,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash 521907602, now seen corresponding path program 1 times [2023-12-02 16:25:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:48,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563857383] [2023-12-02 16:25:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:48,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:48,724 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 16:25:48,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:48,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563857383] [2023-12-02 16:25:48,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563857383] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:48,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:48,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 16:25:48,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156792895] [2023-12-02 16:25:48,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:48,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 16:25:48,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:48,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 16:25:48,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 16:25:48,727 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:49,031 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2023-12-02 16:25:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 16:25:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 16:25:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:49,033 INFO L225 Difference]: With dead ends: 122 [2023-12-02 16:25:49,033 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 16:25:49,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-12-02 16:25:49,034 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 110 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:49,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 136 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:25:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 16:25:49,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2023-12-02 16:25:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 85 states have (on average 1.5294117647058822) internal successors, (130), 118 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2023-12-02 16:25:49,038 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 19 [2023-12-02 16:25:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:49,039 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2023-12-02 16:25:49,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2023-12-02 16:25:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 16:25:49,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:49,039 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 16:25:49,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 16:25:49,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:49,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:49,040 INFO L85 PathProgramCache]: Analyzing trace with hash 521907601, now seen corresponding path program 1 times [2023-12-02 16:25:49,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:49,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526264965] [2023-12-02 16:25:49,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:49,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:49,244 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 16:25:49,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:49,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526264965] [2023-12-02 16:25:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526264965] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:25:49,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:25:49,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 16:25:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910398651] [2023-12-02 16:25:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:25:49,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:25:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:25:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:25:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:25:49,246 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:25:49,506 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2023-12-02 16:25:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 16:25:49,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 16:25:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:25:49,507 INFO L225 Difference]: With dead ends: 120 [2023-12-02 16:25:49,507 INFO L226 Difference]: Without dead ends: 120 [2023-12-02 16:25:49,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 16:25:49,508 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 106 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:25:49,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 124 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:25:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-02 16:25:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2023-12-02 16:25:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 117 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-12-02 16:25:49,513 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 19 [2023-12-02 16:25:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:25:49,513 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-12-02 16:25:49,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:25:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-12-02 16:25:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 16:25:49,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:25:49,514 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] [2023-12-02 16:25:49,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 16:25:49,515 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:25:49,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:25:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1230437568, now seen corresponding path program 1 times [2023-12-02 16:25:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:25:49,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811599266] [2023-12-02 16:25:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:25:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:25:49,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:25:49,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811599266] [2023-12-02 16:25:49,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811599266] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:25:49,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348235415] [2023-12-02 16:25:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:25:49,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:25:49,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:25:49,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:25:49,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 16:25:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:25:49,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 16:25:50,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:25:50,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:25:50,159 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 16:25:50,159 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 16:25:50,222 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 15 treesize of output 1 [2023-12-02 16:25:50,321 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:25:50,321 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 34 treesize of output 33 [2023-12-02 16:25:50,392 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 16:25:50,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-12-02 16:25:50,424 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:25:50,425 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 34 treesize of output 33 [2023-12-02 16:25:50,583 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 25 treesize of output 13 [2023-12-02 16:25:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:25:50,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:25:51,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:25:51,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-12-02 16:25:51,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:25:51,067 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 252 treesize of output 227 [2023-12-02 16:25:51,085 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 171 treesize of output 163 [2023-12-02 16:25:51,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:25:51,100 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 163 treesize of output 159 [2023-12-02 16:25:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:25:53,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348235415] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:25:53,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1041836035] [2023-12-02 16:25:53,821 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 16:25:53,821 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:25:53,825 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:25:53,829 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:25:53,829 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:26:00,882 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:26:35,798 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4105#(and (not (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_146| Int) (|v_ULTIMATE.start_main_~x~0#1.base_172| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_146|) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_172|) |v_ULTIMATE.start_main_~x~0#1.offset_146|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_172|) 1) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_172|) |v_ULTIMATE.start_main_~x~0#1.offset_146|) |ULTIMATE.start_main_~x~0#1.offset|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_146|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_172|)))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_169| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_143| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_143|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_169|) 1) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_143|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_169|)) (exists ((|v_#memory_int_88| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.base_20| Int) (|v_#memory_int_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_109| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_114| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.offset_18| Int) (|v_#memory_$Pointer$.offset_110| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int)))) (and (= |v_#memory_int_90| (store |v_#memory_int_89| |v_ULTIMATE.start_main_~x~0#1.base_169| (store (select |v_#memory_int_89| |v_ULTIMATE.start_main_~x~0#1.base_169|) |v_ULTIMATE.start_main_~x~0#1.offset_143| (select (select |v_#memory_int_90| |v_ULTIMATE.start_main_~x~0#1.base_169|) |v_ULTIMATE.start_main_~x~0#1.offset_143|)))) (<= 1 |#StackHeapBarrier|) (<= (+ (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~x~0#1.base_169| (store (store (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~x~0#1.base_169|) |v_ULTIMATE.start_main_~x~0#1.offset_143| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_143|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_169|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_143|))))) (= (select |#valid| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_main_~x~0#1.base_169| (store (store (select |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_main_~x~0#1.base_169|) |v_ULTIMATE.start_main_~x~0#1.offset_143| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_143|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_169|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_143|))))) (= (store |v_#memory_int_88| |v_ULTIMATE.start_main_#t~mem4#1.base_20| (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4) (select (select |v_#memory_int_89| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) |v_#memory_int_89|) (= (store |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_#t~mem4#1.base_20| (store (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4) (select (select |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) |v_#memory_$Pointer$.base_114|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= (+ 8 |v_ULTIMATE.start_main_#t~mem4#1.offset_18|) (select |#length| |v_ULTIMATE.start_main_#t~mem4#1.base_20|)) (= (select (select |v_#memory_$Pointer$.offset_110| (select (select |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) |v_ULTIMATE.start_main_~x~0#1.offset_143|) (<= 0 (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) 1) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)) (= |#memory_int| (store |v_#memory_int_90| |v_ULTIMATE.start_main_~x~0#1.base_169| (store (select |v_#memory_int_90| |v_ULTIMATE.start_main_~x~0#1.base_169|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_143|) 0))) (= |v_ULTIMATE.start_main_~x~0#1.base_169| (select (select |v_#memory_$Pointer$.base_114| (select (select |v_#memory_$Pointer$.base_114| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) (= |v_#memory_$Pointer$.offset_110| (store |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_#t~mem4#1.base_20| (store (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4) (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))))))))))))' at error location [2023-12-02 16:26:35,798 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:26:35,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:26:35,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2023-12-02 16:26:35,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552851550] [2023-12-02 16:26:35,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:26:35,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 16:26:35,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:26:35,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 16:26:35,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1806, Unknown=33, NotChecked=0, Total=2070 [2023-12-02 16:26:35,801 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 30 states, 29 states have (on average 2.0) internal successors, (58), 30 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:26:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:26:37,943 INFO L93 Difference]: Finished difference Result 229 states and 255 transitions. [2023-12-02 16:26:37,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 16:26:37,944 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 30 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 16:26:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:26:37,945 INFO L225 Difference]: With dead ends: 229 [2023-12-02 16:26:37,945 INFO L226 Difference]: Without dead ends: 229 [2023-12-02 16:26:37,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=296, Invalid=2221, Unknown=33, NotChecked=0, Total=2550 [2023-12-02 16:26:37,948 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 666 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:26:37,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 496 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 16:26:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-02 16:26:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 134. [2023-12-02 16:26:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 100 states have (on average 1.47) internal successors, (147), 132 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:26:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2023-12-02 16:26:37,953 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 21 [2023-12-02 16:26:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:26:37,954 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2023-12-02 16:26:37,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 30 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:26:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2023-12-02 16:26:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 16:26:37,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:26:37,955 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] [2023-12-02 16:26:37,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-02 16:26:38,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:26:38,162 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:26:38,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:26:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1230437567, now seen corresponding path program 1 times [2023-12-02 16:26:38,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:26:38,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489236876] [2023-12-02 16:26:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:26:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:26:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:26:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:26:38,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:26:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489236876] [2023-12-02 16:26:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489236876] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:26:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84383461] [2023-12-02 16:26:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:26:38,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:26:38,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:26:38,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:26:38,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 16:26:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:26:38,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 16:26:38,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:26:38,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:26:38,869 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:26:38,870 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 16:26:38,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 16:26:38,908 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 16:26:38,914 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 15 treesize of output 1 [2023-12-02 16:26:39,034 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:26:39,035 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 50 treesize of output 45 [2023-12-02 16:26:39,040 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 24 treesize of output 11 [2023-12-02 16:26:39,106 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 16:26:39,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-12-02 16:26:39,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:26:39,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 16:26:39,143 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:26:39,144 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 50 treesize of output 45 [2023-12-02 16:26:39,147 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 24 treesize of output 11 [2023-12-02 16:26:39,293 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 25 treesize of output 13 [2023-12-02 16:26:39,300 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 7 treesize of output 3 [2023-12-02 16:26:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:26:39,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:26:39,888 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_150| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_150| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_150|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_587) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_150|) 1)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_150| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_583))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) .cse0 v_ArrVal_587) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_150|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_150|))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_150| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_150|)))) is different from false [2023-12-02 16:26:39,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_150| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_150| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_150|) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_583))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_584) .cse1 v_ArrVal_587) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_150|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_150|))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_150| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_150| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_150|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_584) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_583) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_587) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_150|) 1)))))) is different from false [2023-12-02 16:26:39,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:26:39,937 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 73 treesize of output 74 [2023-12-02 16:26:39,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:26:39,945 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 65 treesize of output 50 [2023-12-02 16:26:39,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:26:39,961 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 334 treesize of output 301 [2023-12-02 16:26:39,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:26:39,995 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 474 treesize of output 457 [2023-12-02 16:26:40,016 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 180 treesize of output 172 [2023-12-02 16:26:40,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:26:40,030 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 172 treesize of output 162 [2023-12-02 16:26:40,040 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 154 treesize of output 146 [2023-12-02 16:26:40,051 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 74 treesize of output 70 [2023-12-02 16:26:40,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:26:40,374 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 38 treesize of output 39 [2023-12-02 16:26:40,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:26:40,399 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 30 treesize of output 31 [2023-12-02 16:26:40,409 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 16:26:40,412 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 28 treesize of output 20 [2023-12-02 16:26:40,416 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 16:26:40,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:26:40,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:26:40,422 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 16:26:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:26:40,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84383461] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:26:40,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [416679984] [2023-12-02 16:26:40,697 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 16:26:40,697 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:26:40,698 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:26:40,698 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:26:40,698 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:26:46,995 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:27:24,720 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4646#(and (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_158| Int) (|v_ULTIMATE.start_main_~x~0#1.base_185| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_158|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_158|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_185|)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_185|) |v_ULTIMATE.start_main_~x~0#1.offset_158|) |ULTIMATE.start_main_~x~0#1.base|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_185|) 1) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_185|) |v_ULTIMATE.start_main_~x~0#1.offset_158|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_182| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_155| Int)) (and (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_155|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_182|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_182|) 1) (exists ((|v_#memory_$Pointer$.base_141| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_140| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.offset_22| Int) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.base_25| Int) (|v_#memory_$Pointer$.offset_136| (Array Int (Array Int Int)))) (and (= (select |#valid| (select (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4))) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_~x~0#1.base_182| (store (store (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_~x~0#1.base_182|) |v_ULTIMATE.start_main_~x~0#1.offset_155| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_155|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_182|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_155|))))) (<= 1 |#StackHeapBarrier|) (= |v_ULTIMATE.start_main_~x~0#1.base_182| (select (select |v_#memory_$Pointer$.base_141| (select (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4))) (select (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_~x~0#1.base_182| (store (store (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_~x~0#1.base_182|) |v_ULTIMATE.start_main_~x~0#1.offset_155| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_155|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_182|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_155|))))) (= (store |v_#memory_$Pointer$.base_140| |v_ULTIMATE.start_main_#t~mem4#1.base_25| (store (select |v_#memory_$Pointer$.base_140| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4) (select (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4)))) |v_#memory_$Pointer$.base_141|) (= (select (select |v_#memory_$Pointer$.offset_137| (select (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4))) (select (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4))) |v_ULTIMATE.start_main_~x~0#1.offset_155|) (<= (+ (select (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4)) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4)))) (<= (+ 8 |v_ULTIMATE.start_main_#t~mem4#1.offset_22|) (select |#length| |v_ULTIMATE.start_main_#t~mem4#1.base_25|)) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |#memory_int| (store |v_#memory_int_113| |v_ULTIMATE.start_main_~x~0#1.base_182| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~x~0#1.base_182|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_155|) 0))) (= (select |#valid| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) 1) (= (store |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_main_#t~mem4#1.base_25| (store (select |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4) (select (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4)))) |v_#memory_$Pointer$.offset_137|) (= (store |v_#memory_int_111| |v_ULTIMATE.start_main_#t~mem4#1.base_25| (store (select |v_#memory_int_111| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4) (select (select |v_#memory_int_112| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4)))) |v_#memory_int_112|) (= (store |v_#memory_int_112| |v_ULTIMATE.start_main_~x~0#1.base_182| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~x~0#1.base_182|) |v_ULTIMATE.start_main_~x~0#1.offset_155| (select (select |v_#memory_int_113| |v_ULTIMATE.start_main_~x~0#1.base_182|) |v_ULTIMATE.start_main_~x~0#1.offset_155|))) |v_#memory_int_113|) (<= 0 (select (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_#t~mem4#1.base_25|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_22| 4))))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_155|))))) (or (< (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (< |ULTIMATE.start_main_~x~0#1.offset| 0)))' at error location [2023-12-02 16:27:24,720 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:27:24,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:27:24,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2023-12-02 16:27:24,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476192262] [2023-12-02 16:27:24,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:27:24,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 16:27:24,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:27:24,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 16:27:24,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1872, Unknown=17, NotChecked=178, Total=2256 [2023-12-02 16:27:24,722 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:27:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:27:26,992 INFO L93 Difference]: Finished difference Result 201 states and 227 transitions. [2023-12-02 16:27:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 16:27:26,992 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 16:27:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:27:26,994 INFO L225 Difference]: With dead ends: 201 [2023-12-02 16:27:26,994 INFO L226 Difference]: Without dead ends: 201 [2023-12-02 16:27:26,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=406, Invalid=3007, Unknown=17, NotChecked=230, Total=3660 [2023-12-02 16:27:26,996 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 562 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:27:26,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 537 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1405 Invalid, 0 Unknown, 422 Unchecked, 1.3s Time] [2023-12-02 16:27:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-02 16:27:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 130. [2023-12-02 16:27:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 128 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:27:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2023-12-02 16:27:27,000 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 21 [2023-12-02 16:27:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:27:27,000 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2023-12-02 16:27:27,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:27:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2023-12-02 16:27:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 16:27:27,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:27:27,001 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 16:27:27,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 16:27:27,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 16:27:27,208 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:27:27,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:27:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1540690850, now seen corresponding path program 1 times [2023-12-02 16:27:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:27:27,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121700165] [2023-12-02 16:27:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:27:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:27:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:27:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:27:27,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:27:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121700165] [2023-12-02 16:27:27,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121700165] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:27:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38954399] [2023-12-02 16:27:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:27:27,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:27:27,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:27:27,611 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:27:27,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 16:27:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:27:27,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 16:27:27,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:27:27,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:27:27,880 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 16:27:27,880 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 16:27:27,933 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 15 treesize of output 1 [2023-12-02 16:27:28,052 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:27:28,053 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 34 treesize of output 33 [2023-12-02 16:27:28,135 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 16:27:28,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-12-02 16:27:28,160 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:27:28,160 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 34 treesize of output 33 [2023-12-02 16:27:28,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-12-02 16:27:28,317 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 25 treesize of output 13 [2023-12-02 16:27:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:27:28,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:27:28,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:27:28,754 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 38 treesize of output 31 [2023-12-02 16:27:28,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:27:28,766 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 252 treesize of output 227 [2023-12-02 16:27:28,777 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 171 treesize of output 163 [2023-12-02 16:27:28,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:27:28,792 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 163 treesize of output 159 [2023-12-02 16:27:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:27:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38954399] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:27:30,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [489433433] [2023-12-02 16:27:30,503 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 16:27:30,503 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:27:30,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:27:30,504 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:27:30,504 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:27:36,635 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:28:50,111 WARN L293 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 242 DAG size of output: 229 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:28:50,813 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5188#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1.offset|) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1)) (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~mem14#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))' at error location [2023-12-02 16:28:50,813 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:28:50,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:28:50,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2023-12-02 16:28:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635133180] [2023-12-02 16:28:50,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:28:50,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 16:28:50,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:50,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 16:28:50,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2155, Unknown=35, NotChecked=0, Total=2450 [2023-12-02 16:28:50,817 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:52,247 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2023-12-02 16:28:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:28:52,247 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 16:28:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:52,248 INFO L225 Difference]: With dead ends: 185 [2023-12-02 16:28:52,249 INFO L226 Difference]: Without dead ends: 185 [2023-12-02 16:28:52,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 75.5s TimeCoverageRelationStatistics Valid=293, Invalid=2324, Unknown=35, NotChecked=0, Total=2652 [2023-12-02 16:28:52,250 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 397 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:52,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 473 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 16:28:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-02 16:28:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2023-12-02 16:28:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.4311926605504588) internal successors, (156), 135 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2023-12-02 16:28:52,260 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 24 [2023-12-02 16:28:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:52,260 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2023-12-02 16:28:52,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2023-12-02 16:28:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 16:28:52,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:52,261 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 16:28:52,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 16:28:52,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 16:28:52,462 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:28:52,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1540690849, now seen corresponding path program 1 times [2023-12-02 16:28:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48966114] [2023-12-02 16:28:52,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:52,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:28:52,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48966114] [2023-12-02 16:28:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48966114] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:28:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248391508] [2023-12-02 16:28:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:52,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:28:52,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:28:52,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:28:52,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 16:28:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:53,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 16:28:53,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:28:53,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:28:53,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 16:28:53,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:28:53,191 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 16:28:53,234 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 15 treesize of output 1 [2023-12-02 16:28:53,239 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 16:28:53,348 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:28:53,348 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 50 treesize of output 45 [2023-12-02 16:28:53,354 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 24 treesize of output 11 [2023-12-02 16:28:53,414 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:28:53,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 16:28:53,429 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 16:28:53,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-12-02 16:28:53,463 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:28:53,464 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 50 treesize of output 45 [2023-12-02 16:28:53,468 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 24 treesize of output 11 [2023-12-02 16:28:53,591 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 33 treesize of output 17 [2023-12-02 16:28:53,599 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 16:28:53,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 16:28:53,627 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 7 treesize of output 3 [2023-12-02 16:28:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:28:53,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:28:53,879 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_815 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_167| Int)) (or (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_167| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_167|))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_167| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_167| 0) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_167|)))) is different from false [2023-12-02 16:28:53,929 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_815 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_167| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_167| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_167|) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_815) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|) 9)))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_167| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_167| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_167|) (< (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_815) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_814) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|))))))) is different from false [2023-12-02 16:28:53,962 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_167| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_167| 0) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_811) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_810) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_815) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_167|))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_167| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_167| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_167|) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_810))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ 11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_811) .cse0 v_ArrVal_815) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_814) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_167|)))))))) is different from false [2023-12-02 16:28:54,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:28:54,134 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 73 treesize of output 74 [2023-12-02 16:28:54,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:28:54,141 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 65 treesize of output 50 [2023-12-02 16:28:54,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:28:54,160 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 334 treesize of output 301 [2023-12-02 16:28:54,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:28:54,191 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 474 treesize of output 457 [2023-12-02 16:28:54,206 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 180 treesize of output 172 [2023-12-02 16:28:54,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:28:54,221 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 172 treesize of output 162 [2023-12-02 16:28:54,231 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 154 treesize of output 146 [2023-12-02 16:28:54,243 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 74 treesize of output 70 [2023-12-02 16:28:54,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:28:54,428 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 38 treesize of output 39 [2023-12-02 16:28:54,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:28:54,436 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 30 treesize of output 31 [2023-12-02 16:28:54,439 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 16:28:54,442 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 28 treesize of output 20 [2023-12-02 16:28:54,446 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 16:28:54,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:28:54,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:28:54,451 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 16:28:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:28:54,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248391508] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:28:54,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [645485062] [2023-12-02 16:28:54,679 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 16:28:54,679 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:28:54,680 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:28:54,680 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:28:54,680 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:29:00,718 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:30:12,163 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5703#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1.offset|) (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~mem14#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (or (< (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 12 |ULTIMATE.start_main_#t~mem14#1.offset|)) (< (+ 8 |ULTIMATE.start_main_#t~mem14#1.offset|) 0)) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))' at error location [2023-12-02 16:30:12,163 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:30:12,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:30:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 30 [2023-12-02 16:30:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625390639] [2023-12-02 16:30:12,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:30:12,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 16:30:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:30:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 16:30:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1998, Unknown=30, NotChecked=282, Total=2550 [2023-12-02 16:30:12,166 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:30:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:30:13,780 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2023-12-02 16:30:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:30:13,780 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 16:30:13,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:30:13,781 INFO L225 Difference]: With dead ends: 184 [2023-12-02 16:30:13,781 INFO L226 Difference]: Without dead ends: 184 [2023-12-02 16:30:13,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 72.7s TimeCoverageRelationStatistics Valid=351, Invalid=2601, Unknown=30, NotChecked=324, Total=3306 [2023-12-02 16:30:13,783 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 402 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:30:13,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 460 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1153 Invalid, 0 Unknown, 530 Unchecked, 1.1s Time] [2023-12-02 16:30:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-02 16:30:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 137. [2023-12-02 16:30:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.4220183486238531) internal successors, (155), 135 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:30:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2023-12-02 16:30:13,789 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 24 [2023-12-02 16:30:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:30:13,790 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2023-12-02 16:30:13,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:30:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2023-12-02 16:30:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 16:30:13,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:30:13,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:30:13,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 16:30:13,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:30:13,992 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:30:13,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:30:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash 880448805, now seen corresponding path program 1 times [2023-12-02 16:30:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:30:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482523006] [2023-12-02 16:30:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:30:13,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:30:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:30:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:30:14,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:30:14,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482523006] [2023-12-02 16:30:14,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482523006] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:30:14,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031127523] [2023-12-02 16:30:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:30:14,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:30:14,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:30:14,108 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:30:14,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 16:30:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:30:14,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 16:30:14,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:30:14,312 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 25 treesize of output 17 [2023-12-02 16:30:14,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-02 16:30:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:30:14,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:30:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:30:14,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031127523] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:30:14,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [399312214] [2023-12-02 16:30:14,373 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 16:30:14,373 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:30:14,374 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:30:14,374 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:30:14,374 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:30:20,568 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 147 for LOIs [2023-12-02 16:30:20,645 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:31:00,182 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6220#(exists ((|v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| Int)) (and (<= 0 |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) (or (and (= (select |#valid| 0) 1) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_210| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_181| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_210|) |v_ULTIMATE.start_main_~x~0#1.offset_181|) 0) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_181|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_210|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_210|) 1) (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_210|) |v_ULTIMATE.start_main_~x~0#1.offset_181|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_181|))) (exists ((|v_ULTIMATE.start_main_#t~short8#1_18| Bool) (|v_ULTIMATE.start_main_#t~nondet7#1_51| Int) (|v_ULTIMATE.start_main_#t~nondet7#1_50| Int)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.base| 0) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| 0) 0) 0))) |v_ULTIMATE.start_main_#t~short8#1_18|) (and (= (select (select |#memory_$Pointer$.offset| 0) 0) 0) (not |v_ULTIMATE.start_main_#t~short8#1_18|) (= (select (select |#memory_$Pointer$.base| 0) 0) 0))) (or (and (= |v_ULTIMATE.start_main_#t~nondet7#1_51| |v_ULTIMATE.start_main_#t~nondet7#1_50|) (not |v_ULTIMATE.start_main_#t~short8#1_18|)) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_51| 0) |v_ULTIMATE.start_main_#t~short8#1_18|)))) (<= 4 (select |#length| 0))) (and (= (select |#valid| 0) 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~mem4#1.offset_33| Int) (|v_#memory_$Pointer$.offset_207| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_208| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_217| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_216| (Array Int (Array Int Int))) (|v_#memory_int_177| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_179| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.base_38| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) 1) (= |v_#memory_$Pointer$.base_217| (store |v_#memory_$Pointer$.base_216| |v_ULTIMATE.start_main_#t~mem4#1.base_38| (store (select |v_#memory_$Pointer$.base_216| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4) (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))))) (= (store |v_#memory_int_177| |v_ULTIMATE.start_main_#t~mem4#1.base_38| (store (select |v_#memory_int_177| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4) (select (select |v_#memory_int_178| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) |v_#memory_int_178|) (= |v_#memory_$Pointer$.offset_208| (store |v_#memory_$Pointer$.offset_207| |v_ULTIMATE.start_main_#t~mem4#1.base_38| (store (select |v_#memory_$Pointer$.offset_207| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))))) (<= (+ (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (store (store (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) 0) (+ (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) 8) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) (+ (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) 8))))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (store (store (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) 0) (+ (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) 8) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) (+ (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) 8))))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) 1) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)) (= (store |v_#memory_int_178| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (store (select |v_#memory_int_178| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_int_179| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))))) |v_#memory_int_179|) (<= (+ 8 |v_ULTIMATE.start_main_#t~mem4#1.offset_33|) (select |#length| |v_ULTIMATE.start_main_#t~mem4#1.base_38|)) (<= 0 (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (= |#memory_int| (store |v_#memory_int_179| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (store (select |v_#memory_int_179| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) (+ (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) 8) 0))) (<= 0 (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4)))) (<= (+ (select (select |v_#memory_$Pointer$.offset_208| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) 12) (select |#length| (select (select |v_#memory_$Pointer$.base_217| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) (select (select |v_#memory_$Pointer$.offset_208| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_217| |v_ULTIMATE.start_main_#t~mem4#1.base_38|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_33| 4))) 1))) (exists ((|v_ULTIMATE.start_main_#t~nondet7#1_45| Int) (|v_ULTIMATE.start_main_#t~short8#1_18| Bool) (|v_ULTIMATE.start_main_#t~nondet7#1_51| Int)) (and (or (and (= |v_ULTIMATE.start_main_#t~nondet7#1_45| |v_ULTIMATE.start_main_#t~nondet7#1_51|) (not |v_ULTIMATE.start_main_#t~short8#1_18|)) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_51| 0) |v_ULTIMATE.start_main_#t~short8#1_18|)) (or (and (or (not (= (select (select |#memory_$Pointer$.base| 0) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| 0) 0) 0))) |v_ULTIMATE.start_main_#t~short8#1_18|) (and (= (select (select |#memory_$Pointer$.offset| 0) 0) 0) (not |v_ULTIMATE.start_main_#t~short8#1_18|) (= (select (select |#memory_$Pointer$.base| 0) 0) 0))))) (= |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| 0) (= |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| 0) (<= 4 (select |#length| 0))))))' at error location [2023-12-02 16:31:00,182 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 16:31:00,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:31:00,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2023-12-02 16:31:00,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168574536] [2023-12-02 16:31:00,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:31:00,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 16:31:00,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:31:00,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 16:31:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=637, Unknown=17, NotChecked=0, Total=756 [2023-12-02 16:31:00,184 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 16:31:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:31:00,618 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2023-12-02 16:31:00,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 16:31:00,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 26 [2023-12-02 16:31:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:31:00,620 INFO L225 Difference]: With dead ends: 138 [2023-12-02 16:31:00,620 INFO L226 Difference]: Without dead ends: 138 [2023-12-02 16:31:00,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=151, Invalid=888, Unknown=17, NotChecked=0, Total=1056 [2023-12-02 16:31:00,621 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 183 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:31:00,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 116 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:31:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-02 16:31:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2023-12-02 16:31:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.4) internal successors, (147), 129 states have internal predecessors, (147), 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 16:31:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2023-12-02 16:31:00,627 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 26 [2023-12-02 16:31:00,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:31:00,627 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2023-12-02 16:31:00,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 16:31:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2023-12-02 16:31:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 16:31:00,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:31:00,628 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] [2023-12-02 16:31:00,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 16:31:00,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:31:00,829 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:31:00,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:31:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash 881528933, now seen corresponding path program 2 times [2023-12-02 16:31:00,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:31:00,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289393375] [2023-12-02 16:31:00,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:31:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:31:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:31:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:31:01,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:31:01,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289393375] [2023-12-02 16:31:01,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289393375] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:31:01,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600789805] [2023-12-02 16:31:01,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:31:01,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:31:01,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:31:01,464 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:31:01,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 16:31:01,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 16:31:01,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:31:01,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-02 16:31:01,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:31:01,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:31:01,823 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:31:01,824 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 16:31:01,864 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 16:31:01,867 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 15 treesize of output 1 [2023-12-02 16:31:01,957 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:31:01,957 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 41 treesize of output 38 [2023-12-02 16:31:01,961 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 16 treesize of output 1 [2023-12-02 16:31:02,014 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 16:31:02,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 16:31:02,032 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 16:31:02,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2023-12-02 16:31:02,096 INFO L349 Elim1Store]: treesize reduction 63, result has 10.0 percent of original size [2023-12-02 16:31:02,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 90 [2023-12-02 16:31:02,115 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2023-12-02 16:31:02,115 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2023-12-02 16:31:02,446 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 16:31:02,446 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 53 [2023-12-02 16:31:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:31:02,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:31:02,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_1011 (Array Int Int))) (or (forall ((v_ArrVal_1012 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1012 .cse1)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (or (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|))) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_185| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_185|))))) (not (= (store .cse3 .cse1 (select v_ArrVal_1011 .cse1)) v_ArrVal_1011)))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (forall ((v_ArrVal_1012 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1012 .cse1)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_185| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_185|) (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1012))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) 0))))) (not (= (store .cse3 .cse1 (select v_ArrVal_1011 .cse1)) v_ArrVal_1011)))))) is different from false [2023-12-02 16:31:02,983 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse0 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse0 .cse1 (select v_ArrVal_1011 .cse1)))) (forall ((v_ArrVal_1012 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_1012 .cse1)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_185| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_185|) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1012))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) 0))))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (forall ((v_ArrVal_1012 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_1012 .cse1)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (or (= (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|))) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_185| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_185|))))) (not (= v_ArrVal_1011 (store .cse0 .cse1 (select v_ArrVal_1011 .cse1)))))))) is different from false [2023-12-02 16:31:03,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse6 0)) (.cse2 (store (select |c_#memory_$Pointer$.base| .cse4) .cse6 0)) (.cse1 (+ 8 .cse6))) (and (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse0 .cse1 (select v_ArrVal_1011 .cse1)))) (forall ((v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_1012 (store .cse2 .cse1 (select v_ArrVal_1012 .cse1)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (or (= 0 (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1011))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1012) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_185| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_185|))))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse0 .cse1 (select v_ArrVal_1011 .cse1)))) (forall ((v_ArrVal_1012 (Array Int Int))) (or (not (= v_ArrVal_1012 (store .cse2 .cse1 (select v_ArrVal_1012 .cse1)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_185| 0) (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1012))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1011) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_185|)))))))))) is different from false [2023-12-02 16:31:03,126 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1006))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1007))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ 8 .cse2))) (or (not (= (store (store (select .cse0 .cse1) .cse2 0) .cse3 (select v_ArrVal_1011 .cse3)) v_ArrVal_1011)) (forall ((v_ArrVal_1012 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_185| 0) (= (let ((.cse4 (store .cse0 .cse1 v_ArrVal_1011))) (select (select .cse4 (select (select (store .cse5 .cse1 v_ArrVal_1012) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|))) 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (not (= v_ArrVal_1012 (store (store (select .cse5 .cse1) .cse2 0) .cse3 (select v_ArrVal_1012 .cse3))))))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1006))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1007))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse11 (+ 8 .cse10))) (or (forall ((v_ArrVal_1012 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (or (= (select (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1012))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (select (select (store .cse9 .cse8 v_ArrVal_1011) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_185| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (not (= v_ArrVal_1012 (store (store (select .cse7 .cse8) .cse10 0) .cse11 (select v_ArrVal_1012 .cse11)))))) (not (= (store (store (select .cse9 .cse8) .cse10 0) .cse11 (select v_ArrVal_1011 .cse11)) v_ArrVal_1011)))))))) is different from false [2023-12-02 16:31:03,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1006))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1007))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (+ .cse4 8))) (or (forall ((v_ArrVal_1012 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_185| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_185|) (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1012))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (select (select (store .cse3 .cse2 v_ArrVal_1011) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) 0))) (not (= (store (store (select .cse1 .cse2) .cse4 0) .cse5 (select v_ArrVal_1012 .cse5)) v_ArrVal_1012)))) (not (= (store (store (select .cse3 .cse2) .cse4 0) .cse5 (select v_ArrVal_1011 .cse5)) v_ArrVal_1011))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1006))) (let ((.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse12 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1007))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse10 (+ .cse9 8))) (or (not (= (store (store (select .cse7 .cse8) .cse9 0) .cse10 (select v_ArrVal_1011 .cse10)) v_ArrVal_1011)) (forall ((v_ArrVal_1012 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_185| 0) (= 0 (let ((.cse11 (store .cse7 .cse8 v_ArrVal_1011))) (select (select .cse11 (select (select (store .cse12 .cse8 v_ArrVal_1012) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (not (= (store (store (select .cse12 .cse8) .cse9 0) .cse10 (select v_ArrVal_1012 .cse10)) v_ArrVal_1012))))))))))) is different from false [2023-12-02 16:31:03,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:31:03,258 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 281 treesize of output 225 [2023-12-02 16:31:03,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:31:03,269 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 217 treesize of output 161 [2023-12-02 16:31:03,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:31:03,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 2798 treesize of output 2706 [2023-12-02 16:31:03,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:31:03,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:31:03,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2198 treesize of output 2154 [2023-12-02 16:31:04,364 INFO L349 Elim1Store]: treesize reduction 155, result has 43.8 percent of original size [2023-12-02 16:31:04,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 1458 treesize of output 1558 [2023-12-02 16:31:04,709 INFO L224 Elim1Store]: Index analysis took 135 ms [2023-12-02 16:31:06,075 INFO L349 Elim1Store]: treesize reduction 380, result has 48.0 percent of original size [2023-12-02 16:31:06,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 1526 treesize of output 1716 [2023-12-02 16:31:08,540 INFO L224 Elim1Store]: Index analysis took 118 ms [2023-12-02 16:31:08,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:31:09,191 INFO L349 Elim1Store]: treesize reduction 913, result has 9.8 percent of original size [2023-12-02 16:31:09,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 29 case distinctions, treesize of input 150 treesize of output 192 [2023-12-02 16:31:10,021 INFO L224 Elim1Store]: Index analysis took 254 ms [2023-12-02 16:31:10,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:31:11,077 INFO L349 Elim1Store]: treesize reduction 913, result has 9.8 percent of original size [2023-12-02 16:31:11,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 29 case distinctions, treesize of input 150 treesize of output 192 [2023-12-02 16:32:02,882 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 1078 treesize of output 1070 [2023-12-02 16:38:55,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 16:38:55,953 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 16:38:55,954 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2023-12-02 16:38:55,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [119191927] [2023-12-02 16:38:55,956 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 16:38:55,956 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:38:55,956 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:38:55,956 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:38:55,956 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:38:55,961 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:332) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:223) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2023-12-02 16:38:55,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:38:55,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-12-02 16:38:55,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190921716] [2023-12-02 16:38:55,964 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-02 16:38:55,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 16:38:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:38:55,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 16:38:55,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=683, Unknown=5, NotChecked=280, Total=1056 [2023-12-02 16:38:55,965 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:38:55,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=683, Unknown=5, NotChecked=280, Total=1056 [2023-12-02 16:38:55,967 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:38:55,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:38:55,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-02 16:38:56,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 16:38:56,168 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2023-12-02 16:38:56,170 INFO L158 Benchmark]: Toolchain (without parser) took 794010.75ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 124.2MB in the beginning and 114.7MB in the end (delta: 9.5MB). Peak memory consumption was 190.9MB. Max. memory is 16.1GB. [2023-12-02 16:38:56,170 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory was 79.2MB in the beginning and 79.2MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 16:38:56,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.72ms. Allocated memory is still 163.6MB. Free memory was 123.8MB in the beginning and 105.8MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 16:38:56,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.14ms. Allocated memory is still 163.6MB. Free memory was 105.8MB in the beginning and 103.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 16:38:56,171 INFO L158 Benchmark]: Boogie Preprocessor took 37.41ms. Allocated memory is still 163.6MB. Free memory was 103.7MB in the beginning and 101.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 16:38:56,171 INFO L158 Benchmark]: RCFGBuilder took 616.21ms. Allocated memory is still 163.6MB. Free memory was 101.6MB in the beginning and 109.8MB in the end (delta: -8.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-12-02 16:38:56,172 INFO L158 Benchmark]: TraceAbstraction took 792896.36ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 109.8MB in the beginning and 114.7MB in the end (delta: -5.0MB). Peak memory consumption was 174.4MB. Max. memory is 16.1GB. [2023-12-02 16:38:56,173 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory was 79.2MB in the beginning and 79.2MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.72ms. Allocated memory is still 163.6MB. Free memory was 123.8MB in the beginning and 105.8MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.14ms. Allocated memory is still 163.6MB. Free memory was 105.8MB in the beginning and 103.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.41ms. Allocated memory is still 163.6MB. Free memory was 103.7MB in the beginning and 101.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 616.21ms. Allocated memory is still 163.6MB. Free memory was 101.6MB in the beginning and 109.8MB in the end (delta: -8.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 792896.36ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 109.8MB in the beginning and 114.7MB in the end (delta: -5.0MB). Peak memory consumption was 174.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/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_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/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 32bit --witnessprinter.graph.data.programhash 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:38:57,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:38:57,896 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 16:38:57,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:38:57,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:38:57,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:38:57,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:38:57,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:38:57,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:38:57,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:38:57,934 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:38:57,935 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:38:57,935 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:38:57,936 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:38:57,936 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:38:57,937 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:38:57,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 16:38:57,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 16:38:57,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:38:57,940 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:38:57,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:38:57,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:38:57,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:38:57,942 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 16:38:57,942 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 16:38:57,943 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 16:38:57,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:38:57,943 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 16:38:57,944 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 16:38:57,944 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 16:38:57,945 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:38:57,945 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:38:57,945 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:38:57,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:38:57,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 16:38:57,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:38:57,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:38:57,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:38:57,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:38:57,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:38:57,947 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 16:38:57,948 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 16:38:57,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:38:57,948 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:38:57,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:38:57,949 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_00152099-1cf5-47e3-a10b-6141914ea1ae/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_00152099-1cf5-47e3-a10b-6141914ea1ae/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2023-12-02 16:38:58,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:38:58,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:38:58,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:38:58,239 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:38:58,240 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:38:58,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/dll-reverse.i [2023-12-02 16:39:00,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:39:01,227 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:39:01,228 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/sv-benchmarks/c/forester-heap/dll-reverse.i [2023-12-02 16:39:01,243 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/data/a74905e5b/08a6b28d2c594e058c0f3be05b71fdd1/FLAG577c7b876 [2023-12-02 16:39:01,257 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/data/a74905e5b/08a6b28d2c594e058c0f3be05b71fdd1 [2023-12-02 16:39:01,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:39:01,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:39:01,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:39:01,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:39:01,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:39:01,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10449d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01, skipping insertion in model container [2023-12-02 16:39:01,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,320 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:39:01,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:39:01,607 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:39:01,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:39:01,679 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:39:01,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01 WrapperNode [2023-12-02 16:39:01,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:39:01,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:39:01,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:39:01,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:39:01,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,730 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2023-12-02 16:39:01,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:39:01,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:39:01,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:39:01,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:39:01,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:39:01,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:39:01,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:39:01,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:39:01,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (1/1) ... [2023-12-02 16:39:01,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:39:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:39:01,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:39:01,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:39:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 16:39:01,834 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 16:39:01,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 16:39:01,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 16:39:01,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:39:01,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 16:39:01,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 16:39:01,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 16:39:01,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 16:39:01,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 16:39:01,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:39:01,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:39:01,964 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:39:01,966 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:39:02,603 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:39:02,662 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:39:02,663 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-12-02 16:39:02,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:39:02 BoogieIcfgContainer [2023-12-02 16:39:02,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:39:02,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:39:02,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:39:02,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:39:02,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:39:01" (1/3) ... [2023-12-02 16:39:02,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9a9f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:39:02, skipping insertion in model container [2023-12-02 16:39:02,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:39:01" (2/3) ... [2023-12-02 16:39:02,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9a9f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:39:02, skipping insertion in model container [2023-12-02 16:39:02,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:39:02" (3/3) ... [2023-12-02 16:39:02,673 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2023-12-02 16:39:02,691 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:39:02,691 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2023-12-02 16:39:02,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:39:02,745 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;@29901f16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:39:02,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2023-12-02 16:39:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 63 states have (on average 2.4444444444444446) internal successors, (154), 130 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 16:39:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 16:39:02,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:02,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 16:39:02,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:02,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash 10181, now seen corresponding path program 1 times [2023-12-02 16:39:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:02,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193829734] [2023-12-02 16:39:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:02,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:02,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:02,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:02,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 16:39:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:02,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:39:02,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:02,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:39:02,924 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 16:39:02,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:02,925 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:02,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193829734] [2023-12-02 16:39:02,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193829734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:02,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:02,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 16:39:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911114890] [2023-12-02 16:39:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:02,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:39:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:39:02,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:39:02,959 INFO L87 Difference]: Start difference. First operand has 135 states, 63 states have (on average 2.4444444444444446) internal successors, (154), 130 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:03,318 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-12-02 16:39:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:39:03,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 16:39:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:03,330 INFO L225 Difference]: With dead ends: 127 [2023-12-02 16:39:03,330 INFO L226 Difference]: Without dead ends: 126 [2023-12-02 16:39:03,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:39:03,335 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 86 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:03,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 101 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:39:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-02 16:39:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-12-02 16:39:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 59 states have (on average 2.2542372881355934) internal successors, (133), 124 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2023-12-02 16:39:03,378 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 2 [2023-12-02 16:39:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:03,378 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2023-12-02 16:39:03,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2023-12-02 16:39:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 16:39:03,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:03,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 16:39:03,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 16:39:03,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:03,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:03,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 10182, now seen corresponding path program 1 times [2023-12-02 16:39:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145708977] [2023-12-02 16:39:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:03,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:03,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:03,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:03,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 16:39:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:03,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:39:03,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:03,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:39:03,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 16:39:03,664 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:03,664 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:03,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145708977] [2023-12-02 16:39:03,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145708977] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:03,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:03,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 16:39:03,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327603573] [2023-12-02 16:39:03,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:03,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:39:03,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:39:03,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:39:03,668 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:04,024 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2023-12-02 16:39:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:39:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 16:39:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:04,028 INFO L225 Difference]: With dead ends: 123 [2023-12-02 16:39:04,028 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 16:39:04,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:39:04,030 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 83 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:04,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 100 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:39:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 16:39:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-12-02 16:39:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 121 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2023-12-02 16:39:04,041 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 2 [2023-12-02 16:39:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:04,042 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2023-12-02 16:39:04,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2023-12-02 16:39:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 16:39:04,043 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:04,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:04,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 16:39:04,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:04,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:04,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash -590619927, now seen corresponding path program 1 times [2023-12-02 16:39:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:04,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922588031] [2023-12-02 16:39:04,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:04,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:04,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:04,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:04,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 16:39:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:04,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 16:39:04,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:04,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:39:04,385 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:39:04,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 16:39:04,412 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 16:39:04,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:04,413 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:04,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922588031] [2023-12-02 16:39:04,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922588031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:04,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:04,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:39:04,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039972581] [2023-12-02 16:39:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:04,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:39:04,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:39:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:39:04,416 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:04,826 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2023-12-02 16:39:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:39:04,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 16:39:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:04,829 INFO L225 Difference]: With dead ends: 114 [2023-12-02 16:39:04,829 INFO L226 Difference]: Without dead ends: 114 [2023-12-02 16:39:04,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:39:04,831 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 140 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:04,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 71 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 16:39:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-02 16:39:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2023-12-02 16:39:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 63 states have (on average 1.9206349206349207) internal successors, (121), 108 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2023-12-02 16:39:04,841 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 7 [2023-12-02 16:39:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:04,842 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2023-12-02 16:39:04,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2023-12-02 16:39:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 16:39:04,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:04,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:04,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 16:39:05,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:05,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:05,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -590619926, now seen corresponding path program 1 times [2023-12-02 16:39:05,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:05,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123251485] [2023-12-02 16:39:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:05,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:05,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:05,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:05,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 16:39:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:05,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 16:39:05,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:05,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:39:05,216 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 16:39:05,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 16:39:05,234 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 16:39:05,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:05,235 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:05,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123251485] [2023-12-02 16:39:05,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123251485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:05,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:05,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:39:05,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936709607] [2023-12-02 16:39:05,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:05,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:39:05,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:39:05,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:39:05,237 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:05,796 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2023-12-02 16:39:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:39:05,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 16:39:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:05,798 INFO L225 Difference]: With dead ends: 145 [2023-12-02 16:39:05,798 INFO L226 Difference]: Without dead ends: 145 [2023-12-02 16:39:05,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:39:05,799 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 140 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:05,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 105 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 16:39:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-02 16:39:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2023-12-02 16:39:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 86 states have (on average 1.7674418604651163) internal successors, (152), 131 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2023-12-02 16:39:05,808 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 7 [2023-12-02 16:39:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:05,808 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2023-12-02 16:39:05,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2023-12-02 16:39:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 16:39:05,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:05,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:05,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 16:39:06,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:06,010 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:06,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash -649816720, now seen corresponding path program 1 times [2023-12-02 16:39:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:06,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252627227] [2023-12-02 16:39:06,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:06,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:06,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:06,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:06,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 16:39:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:06,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 16:39:06,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:06,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:39:06,106 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 16:39:06,122 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 19 treesize of output 11 [2023-12-02 16:39:06,132 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 16:39:06,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:06,133 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252627227] [2023-12-02 16:39:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252627227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:06,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:06,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:39:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038499401] [2023-12-02 16:39:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:06,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:39:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:39:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:39:06,135 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:06,668 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2023-12-02 16:39:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:39:06,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 16:39:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:06,669 INFO L225 Difference]: With dead ends: 132 [2023-12-02 16:39:06,670 INFO L226 Difference]: Without dead ends: 132 [2023-12-02 16:39:06,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:39:06,671 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 6 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:06,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 251 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 16:39:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-02 16:39:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-12-02 16:39:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 86 states have (on average 1.744186046511628) internal successors, (150), 130 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2023-12-02 16:39:06,681 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 9 [2023-12-02 16:39:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:06,681 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2023-12-02 16:39:06,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2023-12-02 16:39:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 16:39:06,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:06,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:06,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 16:39:06,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:06,883 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:06,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash -649816719, now seen corresponding path program 1 times [2023-12-02 16:39:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:06,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635765541] [2023-12-02 16:39:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:06,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:06,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:06,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:06,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 16:39:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:06,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 16:39:06,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:06,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:39:06,984 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 16:39:06,992 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 16:39:07,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 16:39:07,040 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 16:39:07,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:07,041 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635765541] [2023-12-02 16:39:07,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635765541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:07,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:07,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:39:07,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964387893] [2023-12-02 16:39:07,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:07,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:39:07,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:07,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:39:07,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:39:07,043 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:07,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:07,648 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2023-12-02 16:39:07,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:39:07,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 16:39:07,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:07,649 INFO L225 Difference]: With dead ends: 131 [2023-12-02 16:39:07,649 INFO L226 Difference]: Without dead ends: 131 [2023-12-02 16:39:07,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:39:07,650 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 3 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:07,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 231 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 16:39:07,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-02 16:39:07,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-12-02 16:39:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.7209302325581395) internal successors, (148), 129 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2023-12-02 16:39:07,656 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 9 [2023-12-02 16:39:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:07,656 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2023-12-02 16:39:07,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2023-12-02 16:39:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 16:39:07,657 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:07,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:07,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 16:39:07,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:07,858 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:07,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1703357705, now seen corresponding path program 1 times [2023-12-02 16:39:07,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:07,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537302003] [2023-12-02 16:39:07,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:07,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:07,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:07,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:07,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 16:39:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:07,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 16:39:07,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:07,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:39:07,990 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 16:39:07,990 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 27 [2023-12-02 16:39:08,032 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 15 treesize of output 1 [2023-12-02 16:39:08,131 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:39:08,131 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 36 treesize of output 35 [2023-12-02 16:39:08,160 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 27 treesize of output 15 [2023-12-02 16:39:08,195 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 16:39:08,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:08,196 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537302003] [2023-12-02 16:39:08,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537302003] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:08,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:08,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 16:39:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305355297] [2023-12-02 16:39:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:08,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:39:08,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:39:08,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:39:08,198 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:09,379 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2023-12-02 16:39:09,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 16:39:09,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 16:39:09,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:09,381 INFO L225 Difference]: With dead ends: 156 [2023-12-02 16:39:09,381 INFO L226 Difference]: Without dead ends: 156 [2023-12-02 16:39:09,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-12-02 16:39:09,382 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 156 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:09,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 192 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 16:39:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-02 16:39:09,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2023-12-02 16:39:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 86 states have (on average 1.7093023255813953) internal successors, (147), 128 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2023-12-02 16:39:09,390 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 11 [2023-12-02 16:39:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:09,390 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2023-12-02 16:39:09,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2023-12-02 16:39:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 16:39:09,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:09,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:09,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 16:39:09,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:09,595 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:09,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1703357704, now seen corresponding path program 1 times [2023-12-02 16:39:09,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:09,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527639186] [2023-12-02 16:39:09,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:09,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:09,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:09,597 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:09,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 16:39:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:09,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 16:39:09,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:09,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:39:09,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:39:09,732 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:39:09,732 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 13 treesize of output 13 [2023-12-02 16:39:09,758 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 15 treesize of output 1 [2023-12-02 16:39:09,775 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 16:39:09,860 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:39:09,860 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 50 treesize of output 45 [2023-12-02 16:39:09,869 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 24 treesize of output 11 [2023-12-02 16:39:09,890 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 25 treesize of output 13 [2023-12-02 16:39:09,899 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 7 treesize of output 3 [2023-12-02 16:39:09,917 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 16:39:09,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:09,918 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527639186] [2023-12-02 16:39:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527639186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:09,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 16:39:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043933435] [2023-12-02 16:39:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:09,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:39:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:09,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:39:09,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:39:09,919 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:11,008 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2023-12-02 16:39:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 16:39:11,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 16:39:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:11,010 INFO L225 Difference]: With dead ends: 128 [2023-12-02 16:39:11,010 INFO L226 Difference]: Without dead ends: 128 [2023-12-02 16:39:11,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-02 16:39:11,011 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 129 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:11,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 195 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 16:39:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-02 16:39:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2023-12-02 16:39:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.6875) internal successors, (135), 117 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2023-12-02 16:39:11,016 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 11 [2023-12-02 16:39:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:11,016 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2023-12-02 16:39:11,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2023-12-02 16:39:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 16:39:11,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:11,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:11,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-02 16:39:11,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:11,218 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:11,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:11,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1136849510, now seen corresponding path program 1 times [2023-12-02 16:39:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:11,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251275387] [2023-12-02 16:39:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:11,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:11,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:11,220 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:11,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 16:39:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:11,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:39:11,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:11,313 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 16:39:11,313 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:11,313 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:11,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251275387] [2023-12-02 16:39:11,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251275387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:11,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:11,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:39:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4449009] [2023-12-02 16:39:11,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:11,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:39:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:11,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:39:11,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:39:11,314 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:11,607 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2023-12-02 16:39:11,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:39:11,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-02 16:39:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:11,608 INFO L225 Difference]: With dead ends: 132 [2023-12-02 16:39:11,608 INFO L226 Difference]: Without dead ends: 132 [2023-12-02 16:39:11,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:39:11,609 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 121 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:11,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 146 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:39:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-02 16:39:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2023-12-02 16:39:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.65) internal successors, (132), 117 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2023-12-02 16:39:11,613 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 14 [2023-12-02 16:39:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:11,613 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2023-12-02 16:39:11,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2023-12-02 16:39:11,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 16:39:11,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:11,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:11,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-02 16:39:11,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:11,814 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:11,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1135769382, now seen corresponding path program 1 times [2023-12-02 16:39:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:11,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107753450] [2023-12-02 16:39:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:11,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:11,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:11,816 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:11,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 16:39:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:11,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 16:39:11,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:11,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 11 treesize of output 7 [2023-12-02 16:39:11,893 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 16:39:11,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-02 16:39:11,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 16:39:11,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:39:11,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2023-12-02 16:39:11,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 16:39:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:39:12,043 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:12,043 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:12,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107753450] [2023-12-02 16:39:12,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107753450] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:12,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 16:39:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149654999] [2023-12-02 16:39:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:12,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:39:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:12,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:39:12,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:39:12,045 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:12,747 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2023-12-02 16:39:12,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 16:39:12,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-02 16:39:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:12,749 INFO L225 Difference]: With dead ends: 138 [2023-12-02 16:39:12,749 INFO L226 Difference]: Without dead ends: 138 [2023-12-02 16:39:12,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:39:12,750 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 29 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:12,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 265 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 16:39:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-02 16:39:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2023-12-02 16:39:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.6091954022988506) internal successors, (140), 124 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2023-12-02 16:39:12,754 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 14 [2023-12-02 16:39:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:12,755 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2023-12-02 16:39:12,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2023-12-02 16:39:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 16:39:12,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:12,756 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 16:39:12,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-02 16:39:12,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:12,956 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:12,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1900750470, now seen corresponding path program 1 times [2023-12-02 16:39:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:12,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546371791] [2023-12-02 16:39:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:12,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:12,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:12,958 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:12,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 16:39:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:13,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 16:39:13,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:13,049 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 16:39:13,051 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 16:39:13,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 16:39:13,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 16:39:13,165 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 16:39:13,165 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:13,165 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546371791] [2023-12-02 16:39:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546371791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:13,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:13,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:39:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792318822] [2023-12-02 16:39:13,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:13,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:39:13,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:13,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:39:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:39:13,167 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:13,674 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2023-12-02 16:39:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:39:13,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 16:39:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:13,676 INFO L225 Difference]: With dead ends: 144 [2023-12-02 16:39:13,676 INFO L226 Difference]: Without dead ends: 144 [2023-12-02 16:39:13,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:39:13,677 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 11 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:13,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 239 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 16:39:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-02 16:39:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2023-12-02 16:39:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 97 states have (on average 1.577319587628866) internal successors, (153), 134 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2023-12-02 16:39:13,681 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 17 [2023-12-02 16:39:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:13,682 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2023-12-02 16:39:13,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2023-12-02 16:39:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 16:39:13,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:13,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:13,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-02 16:39:13,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:13,883 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:13,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1206830727, now seen corresponding path program 1 times [2023-12-02 16:39:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944308347] [2023-12-02 16:39:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:13,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:13,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:13,885 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:13,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 16:39:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:13,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 16:39:13,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:13,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:39:13,975 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 16:39:13,989 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 19 treesize of output 11 [2023-12-02 16:39:13,997 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 16:39:13,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:13,998 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944308347] [2023-12-02 16:39:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944308347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:13,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:13,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:39:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273612078] [2023-12-02 16:39:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:13,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:39:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:39:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:39:13,999 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:14,482 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2023-12-02 16:39:14,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:39:14,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 16:39:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:14,483 INFO L225 Difference]: With dead ends: 135 [2023-12-02 16:39:14,484 INFO L226 Difference]: Without dead ends: 135 [2023-12-02 16:39:14,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:39:14,484 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:14,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 230 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 16:39:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-02 16:39:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-12-02 16:39:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 97 states have (on average 1.556701030927835) internal successors, (151), 133 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2023-12-02 16:39:14,489 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 18 [2023-12-02 16:39:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:14,489 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2023-12-02 16:39:14,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2023-12-02 16:39:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 16:39:14,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:14,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:14,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 16:39:14,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:14,691 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:14,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1206830726, now seen corresponding path program 1 times [2023-12-02 16:39:14,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:14,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750095939] [2023-12-02 16:39:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:14,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:14,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:14,693 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:14,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 16:39:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:14,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 16:39:14,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:14,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:39:14,800 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 16:39:14,804 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 16:39:14,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 16:39:14,847 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 16:39:14,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:14,847 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750095939] [2023-12-02 16:39:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750095939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:39:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831919897] [2023-12-02 16:39:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:14,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:39:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:39:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:39:14,849 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:15,383 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2023-12-02 16:39:15,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:39:15,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 16:39:15,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:15,384 INFO L225 Difference]: With dead ends: 134 [2023-12-02 16:39:15,384 INFO L226 Difference]: Without dead ends: 134 [2023-12-02 16:39:15,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:39:15,385 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:15,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 218 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 16:39:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-02 16:39:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-12-02 16:39:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 132 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2023-12-02 16:39:15,389 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 18 [2023-12-02 16:39:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:15,390 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2023-12-02 16:39:15,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2023-12-02 16:39:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 16:39:15,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:15,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:15,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-02 16:39:15,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:15,594 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:15,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash -123001599, now seen corresponding path program 1 times [2023-12-02 16:39:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:15,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016648084] [2023-12-02 16:39:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:15,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:15,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:15,596 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:15,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-02 16:39:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:15,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 16:39:15,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:15,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:39:15,801 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:39:15,802 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 13 treesize of output 13 [2023-12-02 16:39:15,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:39:15,839 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 16:39:15,849 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 15 treesize of output 1 [2023-12-02 16:39:15,927 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:39:15,928 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 50 treesize of output 45 [2023-12-02 16:39:15,934 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 24 treesize of output 11 [2023-12-02 16:39:15,954 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 25 treesize of output 13 [2023-12-02 16:39:15,961 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 7 treesize of output 3 [2023-12-02 16:39:15,979 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 16:39:15,979 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:15,979 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:15,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016648084] [2023-12-02 16:39:15,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016648084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:15,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:15,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 16:39:15,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283890265] [2023-12-02 16:39:15,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:15,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:39:15,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:15,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:39:15,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:39:15,981 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:16,701 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2023-12-02 16:39:16,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 16:39:16,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 16:39:16,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:16,703 INFO L225 Difference]: With dead ends: 134 [2023-12-02 16:39:16,703 INFO L226 Difference]: Without dead ends: 134 [2023-12-02 16:39:16,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-12-02 16:39:16,704 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 111 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:16,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 157 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 16:39:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-02 16:39:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2023-12-02 16:39:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.5154639175257731) internal successors, (147), 130 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2023-12-02 16:39:16,707 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 20 [2023-12-02 16:39:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:16,707 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2023-12-02 16:39:16,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2023-12-02 16:39:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 16:39:16,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:16,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:16,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-02 16:39:16,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:16,909 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:16,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash -123001600, now seen corresponding path program 1 times [2023-12-02 16:39:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:16,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993595659] [2023-12-02 16:39:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:16,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:16,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:16,910 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:16,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 16:39:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:17,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 16:39:17,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:17,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:39:17,088 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 16:39:17,089 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 27 [2023-12-02 16:39:17,120 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 15 treesize of output 1 [2023-12-02 16:39:17,189 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:39:17,190 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 36 treesize of output 35 [2023-12-02 16:39:17,205 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 27 treesize of output 15 [2023-12-02 16:39:17,230 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 16:39:17,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:39:17,230 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:17,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993595659] [2023-12-02 16:39:17,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993595659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:39:17,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:39:17,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 16:39:17,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369461993] [2023-12-02 16:39:17,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:39:17,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:39:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:17,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:39:17,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:39:17,232 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:39:17,994 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2023-12-02 16:39:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 16:39:17,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 16:39:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:39:17,995 INFO L225 Difference]: With dead ends: 137 [2023-12-02 16:39:17,995 INFO L226 Difference]: Without dead ends: 137 [2023-12-02 16:39:17,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-12-02 16:39:17,996 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 115 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:39:17,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 131 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 16:39:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-02 16:39:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2023-12-02 16:39:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.5051546391752577) internal successors, (146), 129 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2023-12-02 16:39:18,000 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 20 [2023-12-02 16:39:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:39:18,000 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2023-12-02 16:39:18,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:39:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2023-12-02 16:39:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 16:39:18,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:39:18,001 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:39:18,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-02 16:39:18,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:18,202 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-12-02 16:39:18,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:39:18,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1017529315, now seen corresponding path program 1 times [2023-12-02 16:39:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:39:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796193803] [2023-12-02 16:39:18,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:18,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 16:39:18,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:39:18,204 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 16:39:18,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-02 16:39:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:18,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 16:39:18,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:18,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:39:18,395 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 16:39:18,396 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 27 [2023-12-02 16:39:18,446 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 15 treesize of output 1 [2023-12-02 16:39:18,529 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:39:18,529 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 36 treesize of output 35 [2023-12-02 16:39:18,602 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 16:39:18,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 16:39:18,632 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:39:18,632 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 36 treesize of output 35 [2023-12-02 16:39:18,738 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 27 treesize of output 15 [2023-12-02 16:39:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:39:18,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:39:22,924 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_493)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-12-02 16:39:22,939 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_491))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_493)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-12-02 16:39:22,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:39:22,950 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 40 treesize of output 33 [2023-12-02 16:39:22,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:39:22,970 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 152 treesize of output 139 [2023-12-02 16:39:22,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:39:22,995 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 88 treesize of output 86 [2023-12-02 16:39:23,002 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 78 treesize of output 74 [2023-12-02 16:39:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:39:37,209 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:39:37,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796193803] [2023-12-02 16:39:37,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796193803] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:39:37,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1171026878] [2023-12-02 16:39:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:37,210 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 16:39:37,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 16:39:37,211 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 16:39:37,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-12-02 16:39:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:37,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 16:39:37,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:37,434 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 16:39:37,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 16:39:37,637 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 16:39:37,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 16:39:37,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 16:39:37,964 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:39:37,964 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 44 treesize of output 41 [2023-12-02 16:39:38,119 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 16:39:38,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 32 [2023-12-02 16:39:38,167 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:39:38,167 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 44 treesize of output 41 [2023-12-02 16:39:38,454 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 35 treesize of output 19 [2023-12-02 16:39:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:39:38,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:39:40,607 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_544))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_493)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-12-02 16:39:40,622 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_544))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_493)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-12-02 16:39:40,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:39:40,634 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 40 treesize of output 33 [2023-12-02 16:39:40,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:39:40,652 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 152 treesize of output 139 [2023-12-02 16:39:40,662 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 88 treesize of output 84 [2023-12-02 16:39:40,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:39:40,684 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 84 treesize of output 82 [2023-12-02 16:39:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:39:48,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1171026878] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:39:48,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904252186] [2023-12-02 16:39:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:39:48,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:39:48,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:39:48,513 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:39:48,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00152099-1cf5-47e3-a10b-6141914ea1ae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 16:39:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:39:48,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 16:39:48,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:39:48,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 16:39:48,666 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 16:39:48,666 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 13 treesize of output 13 [2023-12-02 16:39:48,721 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 15 treesize of output 1 [2023-12-02 16:39:48,855 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:39:48,855 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 25 treesize of output 26 [2023-12-02 16:39:48,941 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 16:39:48,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 16:39:49,021 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 16:39:49,021 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 36 treesize of output 35 [2023-12-02 16:39:49,197 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 27 treesize of output 15 [2023-12-02 16:39:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:39:49,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:39:51,292 INFO L349 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2023-12-02 16:39:51,292 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 23 treesize of output 22 [2023-12-02 16:39:51,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_493) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-12-02 16:39:51,393 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_595 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_595))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_493) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1)))) is different from false [2023-12-02 16:39:51,404 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_595 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_595))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_493) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1)))) is different from false [2023-12-02 16:39:51,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:39:51,415 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 51 treesize of output 36 [2023-12-02 16:39:51,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:39:51,440 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 222 treesize of output 189 [2023-12-02 16:39:51,454 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 108 treesize of output 102 [2023-12-02 16:39:51,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:39:51,476 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 102 treesize of output 92 [2023-12-02 16:39:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:39:53,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904252186] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:39:53,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 16:39:53,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 10, 10, 11] total 42 [2023-12-02 16:39:53,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506335505] [2023-12-02 16:39:53,757 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 16:39:53,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-02 16:39:53,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:39:53,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-02 16:39:53,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1078, Unknown=23, NotChecked=532, Total=1892 [2023-12-02 16:39:53,760 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 43 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)