./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-2.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_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:06:55,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:06:55,495 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 14:06:55,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:06:55,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:06:55,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:06:55,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:06:55,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:06:55,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:06:55,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:06:55,536 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:06:55,536 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:06:55,537 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:06:55,537 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:06:55,538 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:06:55,538 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:06:55,539 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:06:55,539 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:06:55,540 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:06:55,540 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:06:55,541 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:06:55,542 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:06:55,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:06:55,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:06:55,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:06:55,544 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:06:55,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:06:55,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:06:55,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:06:55,553 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:06:55,553 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:06:55,554 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:06:55,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:06:55,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:06:55,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:06:55,555 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:06:55,555 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:06:55,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:06:55,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:06:55,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:06:55,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:06:55,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:06:55,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:06:55,557 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:06:55,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:06:55,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:06:55,557 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:06:55,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:06:55,558 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_e30e14c3-7a60-494f-b946-5b0f62e505eb/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_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2023-12-02 14:06:55,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:06:55,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:06:55,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:06:55,787 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:06:55,787 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:06:55,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-12-02 14:06:58,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:06:58,756 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:06:58,756 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-12-02 14:06:58,771 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/data/c2f0ddc60/8568b2a65bb245f287786fd722481eab/FLAG360903a2c [2023-12-02 14:06:58,785 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/data/c2f0ddc60/8568b2a65bb245f287786fd722481eab [2023-12-02 14:06:58,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:06:58,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:06:58,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:06:58,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:06:58,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:06:58,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:06:58" (1/1) ... [2023-12-02 14:06:58,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f85e819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:58, skipping insertion in model container [2023-12-02 14:06:58,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:06:58" (1/1) ... [2023-12-02 14:06:58,847 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:06:59,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:06:59,139 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:06:59,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:06:59,210 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:06:59,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59 WrapperNode [2023-12-02 14:06:59,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:06:59,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:06:59,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:06:59,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:06:59,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,260 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 199 [2023-12-02 14:06:59,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:06:59,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:06:59,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:06:59,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:06:59,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:06:59,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:06:59,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:06:59,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:06:59,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (1/1) ... [2023-12-02 14:06:59,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:06:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:06:59,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:06:59,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:06:59,368 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 14:06:59,368 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 14:06:59,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 14:06:59,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 14:06:59,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 14:06:59,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:06:59,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 14:06:59,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 14:06:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:06:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 14:06:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:06:59,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:06:59,483 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:06:59,486 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:06:59,939 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:06:59,999 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:06:59,999 INFO L309 CfgBuilder]: Removed 18 assume(true) statements. [2023-12-02 14:07:00,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:07:00 BoogieIcfgContainer [2023-12-02 14:07:00,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:07:00,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:07:00,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:07:00,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:07:00,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:06:58" (1/3) ... [2023-12-02 14:07:00,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2b923e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:07:00, skipping insertion in model container [2023-12-02 14:07:00,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:06:59" (2/3) ... [2023-12-02 14:07:00,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2b923e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:07:00, skipping insertion in model container [2023-12-02 14:07:00,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:07:00" (3/3) ... [2023-12-02 14:07:00,009 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2023-12-02 14:07:00,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:07:00,025 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2023-12-02 14:07:00,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:07:00,075 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;@9ab417, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:07:00,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-12-02 14:07:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 77 states have (on average 2.4025974025974026) internal successors, (185), 152 states have internal predecessors, (185), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 14:07:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:07:00,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:00,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:07:00,085 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:00,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash 13219, now seen corresponding path program 1 times [2023-12-02 14:07:00,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:00,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497173114] [2023-12-02 14:07:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:07:00,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:00,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497173114] [2023-12-02 14:07:00,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497173114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:07:00,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:07:00,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:07:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073091974] [2023-12-02 14:07:00,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:07:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:07:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:00,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:07:00,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:07:00,311 INFO L87 Difference]: Start difference. First operand has 160 states, 77 states have (on average 2.4025974025974026) internal successors, (185), 152 states have internal predecessors, (185), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:07:00,496 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2023-12-02 14:07:00,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:07:00,499 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 14:07:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:07:00,507 INFO L225 Difference]: With dead ends: 152 [2023-12-02 14:07:00,508 INFO L226 Difference]: Without dead ends: 151 [2023-12-02 14:07:00,509 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 14:07:00,513 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 141 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:07:00,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 90 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:07:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-02 14:07:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2023-12-02 14:07:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 70 states have (on average 2.2285714285714286) internal successors, (156), 146 states have internal predecessors, (156), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2023-12-02 14:07:00,553 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 2 [2023-12-02 14:07:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:07:00,554 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2023-12-02 14:07:00,554 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 14:07:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2023-12-02 14:07:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:07:00,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:00,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:07:00,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 14:07:00,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:00,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash 13220, now seen corresponding path program 1 times [2023-12-02 14:07:00,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:00,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093998970] [2023-12-02 14:07:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:07:00,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:00,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093998970] [2023-12-02 14:07:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093998970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:07:00,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:07:00,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:07:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512959244] [2023-12-02 14:07:00,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:07:00,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:07:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:00,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:07:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:07:00,658 INFO L87 Difference]: Start difference. First operand 148 states and 162 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 14:07:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:07:00,809 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2023-12-02 14:07:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:07:00,810 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 14:07:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:07:00,812 INFO L225 Difference]: With dead ends: 148 [2023-12-02 14:07:00,812 INFO L226 Difference]: Without dead ends: 148 [2023-12-02 14:07:00,812 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 14:07:00,814 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 138 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:07:00,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 90 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:07:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-02 14:07:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2023-12-02 14:07:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 143 states have internal predecessors, (153), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2023-12-02 14:07:00,828 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 2 [2023-12-02 14:07:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:07:00,829 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2023-12-02 14:07:00,829 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 14:07:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2023-12-02 14:07:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 14:07:00,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:00,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:07:00,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 14:07:00,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:00,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:00,831 INFO L85 PathProgramCache]: Analyzing trace with hash 488403782, now seen corresponding path program 1 times [2023-12-02 14:07:00,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:00,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456027966] [2023-12-02 14:07:00,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:07:01,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:01,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456027966] [2023-12-02 14:07:01,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456027966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:07:01,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:07:01,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:07:01,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531764006] [2023-12-02 14:07:01,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:07:01,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:07:01,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:01,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:07:01,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:07:01,005 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 14:07:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:07:01,272 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2023-12-02 14:07:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:07:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 14:07:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:07:01,275 INFO L225 Difference]: With dead ends: 149 [2023-12-02 14:07:01,275 INFO L226 Difference]: Without dead ends: 149 [2023-12-02 14:07:01,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 14:07:01,277 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 239 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:07:01,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 67 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:07:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-02 14:07:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2023-12-02 14:07:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.9156626506024097) internal successors, (159), 138 states have internal predecessors, (159), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2023-12-02 14:07:01,289 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 7 [2023-12-02 14:07:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:07:01,289 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2023-12-02 14:07:01,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 14:07:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2023-12-02 14:07:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 14:07:01,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:01,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:07:01,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 14:07:01,291 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:01,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 488403783, now seen corresponding path program 1 times [2023-12-02 14:07:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:01,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767448009] [2023-12-02 14:07:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:07:01,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:01,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767448009] [2023-12-02 14:07:01,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767448009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:07:01,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:07:01,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:07:01,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179748272] [2023-12-02 14:07:01,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:07:01,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:07:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:01,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:07:01,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:07:01,525 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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 14:07:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:07:01,927 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2023-12-02 14:07:01,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:07:01,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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 14:07:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:07:01,929 INFO L225 Difference]: With dead ends: 204 [2023-12-02 14:07:01,930 INFO L226 Difference]: Without dead ends: 204 [2023-12-02 14:07:01,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:07:01,931 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 450 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:07:01,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 130 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 14:07:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-02 14:07:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 182. [2023-12-02 14:07:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 125 states have (on average 1.784) internal successors, (223), 180 states have internal predecessors, (223), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2023-12-02 14:07:01,944 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 7 [2023-12-02 14:07:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:07:01,945 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2023-12-02 14:07:01,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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 14:07:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2023-12-02 14:07:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 14:07:01,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:01,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:07:01,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 14:07:01,946 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:01,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:01,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1204949237, now seen corresponding path program 1 times [2023-12-02 14:07:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:01,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988473736] [2023-12-02 14:07:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:01,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:07:02,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:02,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988473736] [2023-12-02 14:07:02,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988473736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:07:02,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:07:02,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:07:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165246679] [2023-12-02 14:07:02,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:07:02,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:07:02,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:02,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:07:02,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:07:02,049 INFO L87 Difference]: Start difference. First operand 182 states and 229 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 14:07:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:07:02,233 INFO L93 Difference]: Finished difference Result 181 states and 227 transitions. [2023-12-02 14:07:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:07:02,234 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 14:07:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:07:02,235 INFO L225 Difference]: With dead ends: 181 [2023-12-02 14:07:02,236 INFO L226 Difference]: Without dead ends: 181 [2023-12-02 14:07:02,236 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 14:07:02,237 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:07:02,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 327 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:07:02,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-02 14:07:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-12-02 14:07:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 125 states have (on average 1.768) internal successors, (221), 179 states have internal predecessors, (221), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2023-12-02 14:07:02,249 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 9 [2023-12-02 14:07:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:07:02,249 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 227 transitions. [2023-12-02 14:07:02,250 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 14:07:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 227 transitions. [2023-12-02 14:07:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 14:07:02,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:02,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:07:02,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 14:07:02,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:02,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1204949238, now seen corresponding path program 1 times [2023-12-02 14:07:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459070179] [2023-12-02 14:07:02,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:07:02,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459070179] [2023-12-02 14:07:02,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459070179] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:07:02,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:07:02,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:07:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726731965] [2023-12-02 14:07:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:07:02,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:07:02,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:07:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:07:02,398 INFO L87 Difference]: Start difference. First operand 181 states and 227 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 14:07:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:07:02,598 INFO L93 Difference]: Finished difference Result 180 states and 225 transitions. [2023-12-02 14:07:02,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:07:02,600 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 14:07:02,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:07:02,602 INFO L225 Difference]: With dead ends: 180 [2023-12-02 14:07:02,602 INFO L226 Difference]: Without dead ends: 180 [2023-12-02 14:07:02,602 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 14:07:02,603 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 3 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:07:02,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 305 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:07:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-02 14:07:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-12-02 14:07:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 125 states have (on average 1.752) internal successors, (219), 178 states have internal predecessors, (219), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2023-12-02 14:07:02,612 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 9 [2023-12-02 14:07:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:07:02,612 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2023-12-02 14:07:02,613 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 14:07:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2023-12-02 14:07:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 14:07:02,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:02,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:07:02,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 14:07:02,614 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:02,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2039868593, now seen corresponding path program 1 times [2023-12-02 14:07:02,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:02,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758490340] [2023-12-02 14:07:02,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:02,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:07:02,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:02,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758490340] [2023-12-02 14:07:02,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758490340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:07:02,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:07:02,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:07:02,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945338766] [2023-12-02 14:07:02,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:07:02,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:07:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:07:02,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:07:02,642 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:07:02,697 INFO L93 Difference]: Finished difference Result 213 states and 261 transitions. [2023-12-02 14:07:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:07:02,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2023-12-02 14:07:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:07:02,699 INFO L225 Difference]: With dead ends: 213 [2023-12-02 14:07:02,699 INFO L226 Difference]: Without dead ends: 213 [2023-12-02 14:07:02,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:07:02,701 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 95 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:07:02,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 167 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:07:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-02 14:07:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 182. [2023-12-02 14:07:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 127 states have (on average 1.7322834645669292) internal successors, (220), 180 states have internal predecessors, (220), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2023-12-02 14:07:02,708 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 226 transitions. Word has length 11 [2023-12-02 14:07:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:07:02,709 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 226 transitions. [2023-12-02 14:07:02,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 226 transitions. [2023-12-02 14:07:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 14:07:02,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:02,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:07:02,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 14:07:02,710 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:02,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1684616548, now seen corresponding path program 1 times [2023-12-02 14:07:02,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:02,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352857948] [2023-12-02 14:07:02,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:02,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:07:02,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:02,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352857948] [2023-12-02 14:07:02,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352857948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:07:02,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:07:02,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 14:07:02,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464423815] [2023-12-02 14:07:02,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:07:02,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:07:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:02,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:07:02,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:07:02,903 INFO L87 Difference]: Start difference. First operand 182 states and 226 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 14:07:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:07:03,262 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2023-12-02 14:07:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:07:03,262 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 14:07:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:07:03,264 INFO L225 Difference]: With dead ends: 187 [2023-12-02 14:07:03,264 INFO L226 Difference]: Without dead ends: 187 [2023-12-02 14:07:03,264 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 14:07:03,265 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 232 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:07:03,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 199 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 14:07:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-02 14:07:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2023-12-02 14:07:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 127 states have (on average 1.7244094488188977) internal successors, (219), 179 states have internal predecessors, (219), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2023-12-02 14:07:03,271 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 11 [2023-12-02 14:07:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:07:03,272 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 225 transitions. [2023-12-02 14:07:03,272 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 14:07:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2023-12-02 14:07:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 14:07:03,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:03,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:07:03,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 14:07:03,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:03,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:03,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1684616547, now seen corresponding path program 1 times [2023-12-02 14:07:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:03,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588154290] [2023-12-02 14:07:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:03,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:07:03,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588154290] [2023-12-02 14:07:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588154290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:07:03,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:07:03,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 14:07:03,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852315367] [2023-12-02 14:07:03,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:07:03,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 14:07:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:03,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 14:07:03,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:07:03,573 INFO L87 Difference]: Start difference. First operand 181 states and 225 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 14:07:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:07:04,145 INFO L93 Difference]: Finished difference Result 181 states and 220 transitions. [2023-12-02 14:07:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 14:07:04,148 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 14:07:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:07:04,149 INFO L225 Difference]: With dead ends: 181 [2023-12-02 14:07:04,149 INFO L226 Difference]: Without dead ends: 181 [2023-12-02 14:07:04,150 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 14:07:04,151 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 226 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:07:04,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 292 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 14:07:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-02 14:07:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2023-12-02 14:07:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 121 states have (on average 1.7107438016528926) internal successors, (207), 167 states have internal predecessors, (207), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 213 transitions. [2023-12-02 14:07:04,162 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 213 transitions. Word has length 11 [2023-12-02 14:07:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:07:04,162 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 213 transitions. [2023-12-02 14:07:04,162 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 14:07:04,163 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 213 transitions. [2023-12-02 14:07:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 14:07:04,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:04,164 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:07:04,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 14:07:04,164 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:04,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1395079164, now seen corresponding path program 1 times [2023-12-02 14:07:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:04,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906403133] [2023-12-02 14:07:04,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:07:04,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:04,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906403133] [2023-12-02 14:07:04,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906403133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:07:04,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:07:04,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:07:04,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147656866] [2023-12-02 14:07:04,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:07:04,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:07:04,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:04,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:07:04,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:07:04,220 INFO L87 Difference]: Start difference. First operand 169 states and 213 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:07:04,365 INFO L93 Difference]: Finished difference Result 196 states and 223 transitions. [2023-12-02 14:07:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:07:04,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2023-12-02 14:07:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:07:04,367 INFO L225 Difference]: With dead ends: 196 [2023-12-02 14:07:04,367 INFO L226 Difference]: Without dead ends: 196 [2023-12-02 14:07:04,367 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 14:07:04,368 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 235 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:07:04,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 158 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:07:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-02 14:07:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 168. [2023-12-02 14:07:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 121 states have (on average 1.6859504132231404) internal successors, (204), 166 states have internal predecessors, (204), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 209 transitions. [2023-12-02 14:07:04,374 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 209 transitions. Word has length 20 [2023-12-02 14:07:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:07:04,375 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 209 transitions. [2023-12-02 14:07:04,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 209 transitions. [2023-12-02 14:07:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 14:07:04,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:07:04,376 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:07:04,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 14:07:04,376 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:07:04,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:07:04,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1544306206, now seen corresponding path program 1 times [2023-12-02 14:07:04,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:07:04,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949777638] [2023-12-02 14:07:04,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:04,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:07:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:04,841 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 14:07:04,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:07:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949777638] [2023-12-02 14:07:04,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949777638] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:07:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744006031] [2023-12-02 14:07:04,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:07:04,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:07:04,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:07:04,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:07:04,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 14:07:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:07:04,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 14:07:04,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:07:05,023 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 14:07:05,139 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 14:07:05,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 14:07:05,210 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 14:07:05,320 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:07:05,320 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 14:07:05,398 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 14:07:05,399 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 14:07:05,450 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:07:05,450 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 14:07:05,641 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 14:07:05,690 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 14:07:05,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:07:12,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:07:12,312 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 14:07:12,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:07:12,328 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 14:07:12,346 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 14:07:12,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:07:12,362 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 14:07:14,571 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 14:07:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744006031] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:07:14,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [438541081] [2023-12-02 14:07:14,589 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 14:07:14,589 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:07:14,593 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:07:14,597 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:07:14,597 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:07:20,628 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:08:26,129 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3879#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~short10#1| (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.offset|) (= |ULTIMATE.start_main_~marked~0#1| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_~marked~0#1_37| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_ULTIMATE.start_main_~marked~0#1_36| Int)) (and (or (and (not (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (= |v_ULTIMATE.start_main_~marked~0#1_37| 1)) (and (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0) (= |v_ULTIMATE.start_main_~marked~0#1_37| |v_ULTIMATE.start_main_~marked~0#1_36|))) (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (not (= |v_ULTIMATE.start_main_~marked~0#1_37| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)))) (or (not (= |ULTIMATE.start_main_#t~mem7#1.offset| 0)) (not (= |ULTIMATE.start_main_#t~mem7#1.base| 0))) (= |ULTIMATE.start_main_#t~mem7#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))) (exists ((|v_#memory_int_96| (Array Int (Array Int Int))) (|v_#memory_int_97| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_109| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_159| Int) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_133| Int)) (and (<= (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 12) (select |#length| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|))) (<= 0 (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (= |#memory_int| (store |v_#memory_int_98| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_int_98| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 8) 1))) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_133|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_159|)) (= |v_#memory_int_97| (store |v_#memory_int_96| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_int_96| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) (select (select |v_#memory_int_97| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4))))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (store (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 8) (select (select |#memory_$Pointer$.base| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 8))))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_159|) 1) (= |v_#memory_int_98| (store |v_#memory_int_97| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_int_97| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (select (select |v_#memory_int_98| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|))))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) 1) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_133|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (store (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.base_113| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.base_159|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select (store |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) (store (select |v_#memory_$Pointer$.offset_109| (select (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) (+ (select (select |v_#memory_$Pointer$.offset_109| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_133|)) |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_133|) 8))))))))' at error location [2023-12-02 14:08:26,129 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:08:26,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:08:26,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2023-12-02 14:08:26,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118380380] [2023-12-02 14:08:26,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:08:26,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 14:08:26,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 14:08:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2196, Unknown=39, NotChecked=0, Total=2450 [2023-12-02 14:08:26,132 INFO L87 Difference]: Start difference. First operand 168 states and 209 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 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 14:08:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:28,620 INFO L93 Difference]: Finished difference Result 328 states and 385 transitions. [2023-12-02 14:08:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 14:08:28,621 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 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 23 [2023-12-02 14:08:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:28,623 INFO L225 Difference]: With dead ends: 328 [2023-12-02 14:08:28,623 INFO L226 Difference]: Without dead ends: 328 [2023-12-02 14:08:28,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 73.7s TimeCoverageRelationStatistics Valid=395, Invalid=3348, Unknown=39, NotChecked=0, Total=3782 [2023-12-02 14:08:28,625 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1325 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:28,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 788 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 14:08:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-12-02 14:08:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 194. [2023-12-02 14:08:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 147 states have (on average 1.6122448979591837) internal successors, (237), 192 states have internal predecessors, (237), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:08:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 242 transitions. [2023-12-02 14:08:28,631 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 242 transitions. Word has length 23 [2023-12-02 14:08:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:28,631 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 242 transitions. [2023-12-02 14:08:28,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 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 14:08:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 242 transitions. [2023-12-02 14:08:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 14:08:28,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:28,632 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:28,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-02 14:08:28,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 14:08:28,837 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:08:28,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1544306207, now seen corresponding path program 1 times [2023-12-02 14:08:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322194806] [2023-12-02 14:08:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:29,371 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 14:08:29,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:29,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322194806] [2023-12-02 14:08:29,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322194806] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:29,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742625455] [2023-12-02 14:08:29,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:29,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:29,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:29,373 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:29,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 14:08:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:29,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 14:08:29,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:29,480 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 14:08:29,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 14:08:29,582 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 14:08:29,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 14:08:29,627 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 14:08:29,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:08:29,749 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:08:29,749 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 14:08:29,757 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 14:08:29,830 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 14:08:29,830 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 14:08:29,852 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 14:08:29,852 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 14:08:29,913 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:08:29,914 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 14:08:29,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 24 treesize of output 11 [2023-12-02 14:08:30,134 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 14:08:30,140 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 14:08:30,167 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 14:08:30,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:08:30,656 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_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_136| Int)) (or (< (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_136|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_136|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_136|) (< |v_ULTIMATE.start_main_~x~0#1.offset_136| 0))) (forall ((v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_136| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_136|) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_136|) 9)) (< |v_ULTIMATE.start_main_~x~0#1.offset_136| 0))))) is different from false [2023-12-02 14:08:30,691 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_136| Int)) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_136|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_136|) (< |v_ULTIMATE.start_main_~x~0#1.offset_136| 0))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_136| Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_436))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435) .cse0 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_136|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_136|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_136|) (< |v_ULTIMATE.start_main_~x~0#1.offset_136| 0)))) is different from false [2023-12-02 14:08:30,725 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_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_136| Int)) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_435) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_436) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_136|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_136|) (< |v_ULTIMATE.start_main_~x~0#1.offset_136| 0))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_136| Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_436))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_435) .cse1 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_136|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_136|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_136|) (< |v_ULTIMATE.start_main_~x~0#1.offset_136| 0))))) is different from false [2023-12-02 14:08:30,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:08:30,745 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 14:08:30,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:08:30,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 65 treesize of output 50 [2023-12-02 14:08:30,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:08:30,772 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 14:08:30,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:08:30,804 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 14:08:30,819 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 14:08:30,826 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 172 treesize of output 164 [2023-12-02 14:08:30,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:08:30,846 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 164 treesize of output 154 [2023-12-02 14:08:30,857 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 14:08:31,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:08:31,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2023-12-02 14:08:31,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:08:31,058 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 14:08:31,061 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:08:31,064 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 14:08:31,068 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:08:31,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:08:31,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:08:31,072 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 14:08:31,335 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 14:08:31,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742625455] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:08:31,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1129263338] [2023-12-02 14:08:31,338 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 14:08:31,338 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:08:31,338 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:08:31,338 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:08:31,339 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:08:36,960 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:09:52,225 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4609#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.offset|) (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem8#1.base|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~short10#1| (exists ((|v_ULTIMATE.start_main_~marked~0#1_44| Int) (|v_ULTIMATE.start_main_~marked~0#1_43| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int)) (and (or (and (= |v_ULTIMATE.start_main_~marked~0#1_44| |v_ULTIMATE.start_main_~marked~0#1_43|) (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (and (not (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (= |v_ULTIMATE.start_main_~marked~0#1_44| 1))) (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)) (not (= |v_ULTIMATE.start_main_~marked~0#1_44| 0)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.offset|) (= |ULTIMATE.start_main_~marked~0#1| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (or (< (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) (+ |ULTIMATE.start_main_#t~mem8#1.offset| 12)) (< (+ |ULTIMATE.start_main_#t~mem8#1.offset| 8) 0)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_int_119| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_167| Int) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (and (= (select |#valid| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (store (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 8))))) (<= 0 (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (store (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 0) (+ (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 8) (select (select |#memory_$Pointer$.base| (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 8))))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_140|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_140|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_167|)) (<= (+ (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 12) (select |#length| (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (= |#memory_int| (store |v_#memory_int_120| (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_int_120| (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 8) 1))) (= (store |v_#memory_int_119| (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_int_119| (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (select (select |v_#memory_int_120| (select (select (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.base_167|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (select (select (store |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)))) |v_#memory_int_120|) (= |v_#memory_int_119| (store |v_#memory_int_118| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) (store (select |v_#memory_int_118| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4) (select (select |v_#memory_int_119| (select (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) (+ (select (select |v_#memory_$Pointer$.offset_135| |v_ULTIMATE.start_main_~x~0#1.base_167|) |v_ULTIMATE.start_main_~x~0#1.offset_140|) 4))))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_167|) 1))) (or (not (= |ULTIMATE.start_main_#t~mem7#1.offset| 0)) (not (= |ULTIMATE.start_main_#t~mem7#1.base| 0))) (= |ULTIMATE.start_main_#t~mem7#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2023-12-02 14:09:52,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:09:52,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:09:52,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 32 [2023-12-02 14:09:52,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252612526] [2023-12-02 14:09:52,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:09:52,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 14:09:52,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:09:52,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 14:09:52,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2148, Unknown=28, NotChecked=288, Total=2652 [2023-12-02 14:09:52,229 INFO L87 Difference]: Start difference. First operand 194 states and 242 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 33 states have internal predecessors, (69), 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 14:09:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:09:55,868 INFO L93 Difference]: Finished difference Result 325 states and 382 transitions. [2023-12-02 14:09:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 14:09:55,869 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 33 states have internal predecessors, (69), 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 23 [2023-12-02 14:09:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:09:55,871 INFO L225 Difference]: With dead ends: 325 [2023-12-02 14:09:55,871 INFO L226 Difference]: Without dead ends: 325 [2023-12-02 14:09:55,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 77.6s TimeCoverageRelationStatistics Valid=412, Invalid=3603, Unknown=29, NotChecked=378, Total=4422 [2023-12-02 14:09:55,874 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1332 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1053 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:09:55,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 787 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1643 Invalid, 0 Unknown, 1053 Unchecked, 2.1s Time] [2023-12-02 14:09:55,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-02 14:09:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 194. [2023-12-02 14:09:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 147 states have (on average 1.6054421768707483) internal successors, (236), 192 states have internal predecessors, (236), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:09:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 241 transitions. [2023-12-02 14:09:55,882 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 241 transitions. Word has length 23 [2023-12-02 14:09:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:09:55,883 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 241 transitions. [2023-12-02 14:09:55,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 33 states have internal predecessors, (69), 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 14:09:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 241 transitions. [2023-12-02 14:09:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 14:09:55,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:09:55,884 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:09:55,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 14:09:56,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 14:09:56,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:09:56,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:09:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash 629142450, now seen corresponding path program 1 times [2023-12-02 14:09:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:09:56,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307836486] [2023-12-02 14:09:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:56,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:09:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:09:56,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:09:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307836486] [2023-12-02 14:09:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307836486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:09:56,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:09:56,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:09:56,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264025901] [2023-12-02 14:09:56,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:09:56,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:09:56,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:09:56,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:09:56,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:09:56,133 INFO L87 Difference]: Start difference. First operand 194 states and 241 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:09:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:09:56,207 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2023-12-02 14:09:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:09:56,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:09:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:09:56,209 INFO L225 Difference]: With dead ends: 197 [2023-12-02 14:09:56,209 INFO L226 Difference]: Without dead ends: 197 [2023-12-02 14:09:56,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:09:56,210 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:09:56,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:09:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-02 14:09:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2023-12-02 14:09:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 150 states have (on average 1.5933333333333333) internal successors, (239), 195 states have internal predecessors, (239), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:09:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2023-12-02 14:09:56,217 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 24 [2023-12-02 14:09:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:09:56,217 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2023-12-02 14:09:56,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:09:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2023-12-02 14:09:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 14:09:56,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:09:56,219 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:09:56,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 14:09:56,219 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:09:56,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:09:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1255115198, now seen corresponding path program 1 times [2023-12-02 14:09:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:09:56,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396731990] [2023-12-02 14:09:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:09:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:56,870 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 14:09:56,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:09:56,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396731990] [2023-12-02 14:09:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396731990] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:09:56,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967834081] [2023-12-02 14:09:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:09:56,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:09:56,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:09:56,874 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:09:56,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 14:09:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:09:57,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 14:09:57,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:09:57,015 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 14:09:57,145 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 14:09:57,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 14:09:57,201 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 14:09:57,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:09:57,378 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:09:57,378 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 14:09:57,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 14:09:57,401 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 16 treesize of output 8 [2023-12-02 14:09:57,449 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 14:09:57,467 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 14:09:57,737 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 23 treesize of output 15 [2023-12-02 14:09:57,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-02 14:09:57,745 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 14:09:57,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:09:57,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:09:57,846 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 31 treesize of output 35 [2023-12-02 14:10:00,250 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_145| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_145| 0) (< 0 (+ 1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_586) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_145|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_145|))) is different from false [2023-12-02 14:10:00,396 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_145| Int)) (or (< 0 (+ (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_583) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_584) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_586)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_145|) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_145| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_145|))) is different from false [2023-12-02 14:10:00,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:10:00,407 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 14:10:00,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:10:00,414 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 14:10:00,418 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 54 treesize of output 46 [2023-12-02 14:10:00,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:10:00,433 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 100 treesize of output 99 [2023-12-02 14:10:00,440 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 60 treesize of output 52 [2023-12-02 14:10:00,445 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 76 treesize of output 70 [2023-12-02 14:10:00,453 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 48 treesize of output 46 [2023-12-02 14:10:00,904 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 14:10:00,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967834081] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:10:00,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1626949912] [2023-12-02 14:10:00,906 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 14:10:00,907 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:10:00,907 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:10:00,907 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:10:00,907 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:10:06,542 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:11:12,795 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5764#(and (= |ULTIMATE.start_main_~marked~0#1| 0) (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 14:11:12,795 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:11:12,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:11:12,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 37 [2023-12-02 14:11:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447117514] [2023-12-02 14:11:12,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:11:12,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 14:11:12,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:11:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 14:11:12,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=2914, Unknown=28, NotChecked=222, Total=3422 [2023-12-02 14:11:12,797 INFO L87 Difference]: Start difference. First operand 197 states and 244 transitions. Second operand has 38 states, 37 states have (on average 2.081081081081081) internal successors, (77), 38 states have internal predecessors, (77), 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 14:11:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:11:18,318 INFO L93 Difference]: Finished difference Result 431 states and 504 transitions. [2023-12-02 14:11:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-02 14:11:18,318 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.081081081081081) internal successors, (77), 38 states have internal predecessors, (77), 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 26 [2023-12-02 14:11:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:11:18,321 INFO L225 Difference]: With dead ends: 431 [2023-12-02 14:11:18,321 INFO L226 Difference]: Without dead ends: 431 [2023-12-02 14:11:18,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3801 ImplicationChecksByTransitivity, 72.9s TimeCoverageRelationStatistics Valid=1663, Invalid=10970, Unknown=31, NotChecked=446, Total=13110 [2023-12-02 14:11:18,326 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1529 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 932 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:11:18,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 1075 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 2176 Invalid, 0 Unknown, 932 Unchecked, 2.2s Time] [2023-12-02 14:11:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-12-02 14:11:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 215. [2023-12-02 14:11:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 175 states have (on average 1.497142857142857) internal successors, (262), 213 states have internal predecessors, (262), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:11:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 267 transitions. [2023-12-02 14:11:18,333 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 267 transitions. Word has length 26 [2023-12-02 14:11:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:11:18,334 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 267 transitions. [2023-12-02 14:11:18,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.081081081081081) internal successors, (77), 38 states have internal predecessors, (77), 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 14:11:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 267 transitions. [2023-12-02 14:11:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 14:11:18,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:11:18,335 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:11:18,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 14:11:18,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 14:11:18,536 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:11:18,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:11:18,536 INFO L85 PathProgramCache]: Analyzing trace with hash -985878418, now seen corresponding path program 1 times [2023-12-02 14:11:18,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:11:18,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075501781] [2023-12-02 14:11:18,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:11:18,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:11:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:11:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:11:18,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:11:18,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075501781] [2023-12-02 14:11:18,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075501781] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:11:18,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:11:18,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:11:18,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219322789] [2023-12-02 14:11:18,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:11:18,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:11:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:11:18,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:11:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:11:18,601 INFO L87 Difference]: Start difference. First operand 215 states and 267 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 14:11:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:11:18,732 INFO L93 Difference]: Finished difference Result 212 states and 260 transitions. [2023-12-02 14:11:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:11:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 26 [2023-12-02 14:11:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:11:18,734 INFO L225 Difference]: With dead ends: 212 [2023-12-02 14:11:18,734 INFO L226 Difference]: Without dead ends: 212 [2023-12-02 14:11:18,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:11:18,735 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 61 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:11:18,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 109 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:11:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-02 14:11:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2023-12-02 14:11:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 175 states have (on average 1.457142857142857) internal successors, (255), 209 states have internal predecessors, (255), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:11:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 260 transitions. [2023-12-02 14:11:18,741 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 260 transitions. Word has length 26 [2023-12-02 14:11:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:11:18,742 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 260 transitions. [2023-12-02 14:11:18,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 14:11:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 260 transitions. [2023-12-02 14:11:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 14:11:18,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:11:18,743 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:11:18,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 14:11:18,744 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:11:18,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:11:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash -985878417, now seen corresponding path program 1 times [2023-12-02 14:11:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:11:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156223254] [2023-12-02 14:11:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:11:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:11:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:11:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:11:18,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:11:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156223254] [2023-12-02 14:11:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156223254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:11:18,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:11:18,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:11:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984361289] [2023-12-02 14:11:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:11:18,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:11:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:11:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:11:18,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:11:18,838 INFO L87 Difference]: Start difference. First operand 211 states and 260 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 14:11:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:11:18,968 INFO L93 Difference]: Finished difference Result 207 states and 253 transitions. [2023-12-02 14:11:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:11:18,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 26 [2023-12-02 14:11:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:11:18,970 INFO L225 Difference]: With dead ends: 207 [2023-12-02 14:11:18,970 INFO L226 Difference]: Without dead ends: 207 [2023-12-02 14:11:18,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:11:18,971 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 64 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:11:18,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 97 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:11:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-02 14:11:18,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2023-12-02 14:11:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.417142857142857) internal successors, (248), 205 states have internal predecessors, (248), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:11:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 253 transitions. [2023-12-02 14:11:18,977 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 253 transitions. Word has length 26 [2023-12-02 14:11:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:11:18,977 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 253 transitions. [2023-12-02 14:11:18,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 14:11:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 253 transitions. [2023-12-02 14:11:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 14:11:18,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:11:18,978 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:11:18,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 14:11:18,978 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:11:18,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:11:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash -985869635, now seen corresponding path program 1 times [2023-12-02 14:11:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:11:18,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220806787] [2023-12-02 14:11:18,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:11:18,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:11:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:11:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:11:19,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:11:19,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220806787] [2023-12-02 14:11:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220806787] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:11:19,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:11:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:11:19,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582503938] [2023-12-02 14:11:19,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:11:19,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:11:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:11:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:11:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:11:19,154 INFO L87 Difference]: Start difference. First operand 207 states and 253 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 14:11:19,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:11:19,337 INFO L93 Difference]: Finished difference Result 213 states and 257 transitions. [2023-12-02 14:11:19,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:11:19,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 26 [2023-12-02 14:11:19,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:11:19,339 INFO L225 Difference]: With dead ends: 213 [2023-12-02 14:11:19,339 INFO L226 Difference]: Without dead ends: 213 [2023-12-02 14:11:19,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:11:19,339 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:11:19,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 223 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:11:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-02 14:11:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2023-12-02 14:11:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 174 states have (on average 1.4080459770114941) internal successors, (245), 204 states have internal predecessors, (245), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:11:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 250 transitions. [2023-12-02 14:11:19,344 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 250 transitions. Word has length 26 [2023-12-02 14:11:19,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:11:19,344 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 250 transitions. [2023-12-02 14:11:19,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 14:11:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 250 transitions. [2023-12-02 14:11:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 14:11:19,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:11:19,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:11:19,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 14:11:19,345 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:11:19,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:11:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash 857007115, now seen corresponding path program 1 times [2023-12-02 14:11:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:11:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069660438] [2023-12-02 14:11:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:11:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:11:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:11:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:11:19,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:11:19,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069660438] [2023-12-02 14:11:19,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069660438] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:11:19,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783652229] [2023-12-02 14:11:19,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:11:19,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:11:19,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:11:19,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:11:20,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 14:11:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:11:20,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-02 14:11:20,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:11:20,142 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 14:11:20,258 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 14:11:20,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 14:11:20,317 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 14:11:20,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:11:20,443 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:11:20,443 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 14:11:20,449 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 14:11:20,548 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 14:11:20,548 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 14:11:20,563 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 26 treesize of output 21 [2023-12-02 14:11:20,680 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 14:11:20,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2023-12-02 14:11:20,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2023-12-02 14:11:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:11:21,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:11:28,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:11:28,677 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 319 treesize of output 239 [2023-12-02 14:11:28,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:11:28,688 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 220 treesize of output 165 [2023-12-02 14:11:28,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:11:28,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1878 treesize of output 1824 [2023-12-02 14:11:28,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:11:29,812 INFO L349 Elim1Store]: treesize reduction 228, result has 59.4 percent of original size [2023-12-02 14:11:29,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 79807 treesize of output 66619 [2023-12-02 14:11:30,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:11:30,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10429 treesize of output 8471 [2023-12-02 14:11:30,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:11:30,929 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 5398 treesize of output 5068 [2023-12-02 14:11:40,410 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 272 treesize of output 248 [2023-12-02 14:11:48,487 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 272 treesize of output 248 [2023-12-02 14:13:06,461 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-12-02 14:13:06,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 282 [2023-12-02 14:13:11,016 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-12-02 14:13:11,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 282 [2023-12-02 14:13:26,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:13:26,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 205 [2023-12-02 14:13:31,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:13:31,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 205 [2023-12-02 14:13:34,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:13:34,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 216 [2023-12-02 14:13:40,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:13:40,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 216 [2023-12-02 14:13:52,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:13:52,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 208 [2023-12-02 14:13:55,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:13:55,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 208 [2023-12-02 14:14:02,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:14:02,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 223 [2023-12-02 14:14:07,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:14:07,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 223 [2023-12-02 14:15:13,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:15:13,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1548 treesize of output 1560 [2023-12-02 14:16:07,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:16:07,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1548 treesize of output 1560 [2023-12-02 14:16:46,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:16:46,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1548 treesize of output 1560 [2023-12-02 14:16:54,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:16:54,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1548 treesize of output 1560 [2023-12-02 14:16:55,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 14:16:55,163 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:16:55,163 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:16:55,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [886466914] [2023-12-02 14:16:55,165 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 14:16:55,165 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:16:55,165 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:16:55,166 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:16:55,166 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:16:55,174 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:16:55,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:16:55,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-12-02 14:16:55,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440790650] [2023-12-02 14:16:55,176 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-02 14:16:55,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 14:16:55,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:16:55,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 14:16:55,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=877, Unknown=12, NotChecked=0, Total=992 [2023-12-02 14:16:55,178 INFO L87 Difference]: Start difference. First operand 206 states and 250 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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 14:16:55,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=103, Invalid=877, Unknown=12, NotChecked=0, Total=992 [2023-12-02 14:16:55,180 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 14:16:55,180 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 14:16:55,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 14:16:55,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 14:16:55,381 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_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:16:55,384 INFO L158 Benchmark]: Toolchain (without parser) took 596594.58ms. Allocated memory was 155.2MB in the beginning and 524.3MB in the end (delta: 369.1MB). Free memory was 121.8MB in the beginning and 446.1MB in the end (delta: -324.3MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2023-12-02 14:16:55,384 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:16:55,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.14ms. Allocated memory is still 155.2MB. Free memory was 121.8MB in the beginning and 103.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 14:16:55,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.25ms. Allocated memory is still 155.2MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:16:55,385 INFO L158 Benchmark]: Boogie Preprocessor took 36.20ms. Allocated memory is still 155.2MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:16:55,385 INFO L158 Benchmark]: RCFGBuilder took 702.75ms. Allocated memory is still 155.2MB. Free memory was 98.7MB in the beginning and 108.9MB in the end (delta: -10.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-12-02 14:16:55,385 INFO L158 Benchmark]: TraceAbstraction took 595379.81ms. Allocated memory was 155.2MB in the beginning and 524.3MB in the end (delta: 369.1MB). Free memory was 107.8MB in the beginning and 446.1MB in the end (delta: -338.3MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2023-12-02 14:16:55,387 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.14ms. Allocated memory is still 109.1MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.14ms. Allocated memory is still 155.2MB. Free memory was 121.8MB in the beginning and 103.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.25ms. Allocated memory is still 155.2MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.20ms. Allocated memory is still 155.2MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 702.75ms. Allocated memory is still 155.2MB. Free memory was 98.7MB in the beginning and 108.9MB in the end (delta: -10.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 595379.81ms. Allocated memory was 155.2MB in the beginning and 524.3MB in the end (delta: 369.1MB). Free memory was 107.8MB in the beginning and 446.1MB in the end (delta: -338.3MB). Peak memory consumption was 33.1MB. 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_e30e14c3-7a60-494f-b946-5b0f62e505eb/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_e30e14c3-7a60-494f-b946-5b0f62e505eb/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_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:16:57,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:16:57,146 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 14:16:57,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:16:57,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:16:57,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:16:57,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:16:57,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:16:57,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:16:57,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:16:57,184 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:16:57,185 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:16:57,186 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:16:57,186 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:16:57,187 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:16:57,187 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:16:57,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:16:57,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:16:57,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:16:57,190 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:16:57,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:16:57,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:16:57,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:16:57,192 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:16:57,193 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:16:57,193 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:16:57,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:16:57,194 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:16:57,195 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 14:16:57,195 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 14:16:57,196 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:16:57,196 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:16:57,196 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:16:57,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:16:57,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 14:16:57,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:16:57,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:16:57,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:16:57,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:16:57,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:16:57,199 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 14:16:57,199 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 14:16:57,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:16:57,200 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:16:57,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:16:57,200 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_e30e14c3-7a60-494f-b946-5b0f62e505eb/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_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2023-12-02 14:16:57,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:16:57,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:16:57,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:16:57,537 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:16:57,538 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:16:57,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-12-02 14:17:00,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:17:00,594 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:17:00,595 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-12-02 14:17:00,609 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/data/758b6fb1d/c8bdbb7e6eb8472c8c42640d72c8b227/FLAG53154cad9 [2023-12-02 14:17:00,624 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/data/758b6fb1d/c8bdbb7e6eb8472c8c42640d72c8b227 [2023-12-02 14:17:00,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:17:00,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:17:00,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:17:00,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:17:00,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:17:00,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:17:00" (1/1) ... [2023-12-02 14:17:00,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe95982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:00, skipping insertion in model container [2023-12-02 14:17:00,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:17:00" (1/1) ... [2023-12-02 14:17:00,685 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:17:00,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:17:00,968 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:17:01,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:17:01,046 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:17:01,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01 WrapperNode [2023-12-02 14:17:01,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:17:01,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:17:01,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:17:01,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:17:01,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,099 INFO L138 Inliner]: procedures = 122, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2023-12-02 14:17:01,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:17:01,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:17:01,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:17:01,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:17:01,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:17:01,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:17:01,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:17:01,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:17:01,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (1/1) ... [2023-12-02 14:17:01,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:17:01,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:17:01,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:17:01,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:17:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 14:17:01,233 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 14:17:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 14:17:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 14:17:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:17:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 14:17:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 14:17:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:17:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 14:17:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 14:17:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:17:01,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:17:01,369 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:17:01,371 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:17:02,068 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:17:02,125 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:17:02,125 INFO L309 CfgBuilder]: Removed 18 assume(true) statements. [2023-12-02 14:17:02,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:17:02 BoogieIcfgContainer [2023-12-02 14:17:02,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:17:02,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:17:02,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:17:02,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:17:02,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:17:00" (1/3) ... [2023-12-02 14:17:02,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183b0c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:17:02, skipping insertion in model container [2023-12-02 14:17:02,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:17:01" (2/3) ... [2023-12-02 14:17:02,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183b0c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:17:02, skipping insertion in model container [2023-12-02 14:17:02,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:17:02" (3/3) ... [2023-12-02 14:17:02,135 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2023-12-02 14:17:02,152 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:17:02,152 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2023-12-02 14:17:02,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:17:02,201 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;@2d131b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:17:02,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-12-02 14:17:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 81 states have (on average 2.382716049382716) internal successors, (193), 156 states have internal predecessors, (193), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 14:17:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:17:02,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:02,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:17:02,213 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:02,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash 13219, now seen corresponding path program 1 times [2023-12-02 14:17:02,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:02,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964311261] [2023-12-02 14:17:02,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:02,244 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 14:17:02,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:02,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:02,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:02,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:17:02,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:02,372 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 14:17:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:17:02,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:17:02,384 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:02,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964311261] [2023-12-02 14:17:02,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964311261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:17:02,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:17:02,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:17:02,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090391994] [2023-12-02 14:17:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:17:02,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:17:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:02,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:17:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:17:02,416 INFO L87 Difference]: Start difference. First operand has 164 states, 81 states have (on average 2.382716049382716) internal successors, (193), 156 states have internal predecessors, (193), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:17:02,741 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2023-12-02 14:17:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:17:02,744 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 14:17:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:17:02,752 INFO L225 Difference]: With dead ends: 157 [2023-12-02 14:17:02,753 INFO L226 Difference]: Without dead ends: 156 [2023-12-02 14:17:02,754 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 14:17:02,758 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:17:02,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 99 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 14:17:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-02 14:17:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2023-12-02 14:17:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 74 states have (on average 2.189189189189189) internal successors, (162), 150 states have internal predecessors, (162), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2023-12-02 14:17:02,801 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 2 [2023-12-02 14:17:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:17:02,802 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2023-12-02 14:17:02,802 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 14:17:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2023-12-02 14:17:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:17:02,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:02,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:17:02,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:03,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:03,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:03,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:03,006 INFO L85 PathProgramCache]: Analyzing trace with hash 13220, now seen corresponding path program 1 times [2023-12-02 14:17:03,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:03,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503040802] [2023-12-02 14:17:03,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:03,007 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 14:17:03,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:03,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:03,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:03,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:17:03,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:03,063 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 14:17:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:17:03,073 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:17:03,073 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:03,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503040802] [2023-12-02 14:17:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503040802] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:17:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:17:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:17:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646165891] [2023-12-02 14:17:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:17:03,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:17:03,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:03,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:17:03,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:17:03,077 INFO L87 Difference]: Start difference. First operand 152 states and 168 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 14:17:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:17:03,471 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2023-12-02 14:17:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:17:03,472 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 14:17:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:17:03,473 INFO L225 Difference]: With dead ends: 153 [2023-12-02 14:17:03,473 INFO L226 Difference]: Without dead ends: 153 [2023-12-02 14:17:03,474 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 14:17:03,475 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 144 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:17:03,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 99 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 14:17:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-12-02 14:17:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2023-12-02 14:17:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 74 states have (on average 2.1486486486486487) internal successors, (159), 147 states have internal predecessors, (159), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2023-12-02 14:17:03,485 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 2 [2023-12-02 14:17:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:17:03,486 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2023-12-02 14:17:03,486 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 14:17:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2023-12-02 14:17:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 14:17:03,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:03,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:17:03,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:03,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:03,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:03,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash 488403782, now seen corresponding path program 1 times [2023-12-02 14:17:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:03,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125410716] [2023-12-02 14:17:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:03,689 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 14:17:03,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:03,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:03,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:03,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:17:03,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:03,791 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 14:17:03,842 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 14:17:03,842 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 14:17:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:17:03,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:17:03,859 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:03,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125410716] [2023-12-02 14:17:03,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125410716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:17:03,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:17:03,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:17:03,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283384883] [2023-12-02 14:17:03,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:17:03,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:17:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:03,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:17:03,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:17:03,861 INFO L87 Difference]: Start difference. First operand 149 states and 165 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 14:17:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:17:04,380 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2023-12-02 14:17:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:17:04,381 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 14:17:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:17:04,383 INFO L225 Difference]: With dead ends: 155 [2023-12-02 14:17:04,383 INFO L226 Difference]: Without dead ends: 155 [2023-12-02 14:17:04,383 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 14:17:04,384 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 252 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:17:04,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 75 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 14:17:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-12-02 14:17:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2023-12-02 14:17:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 87 states have (on average 1.896551724137931) internal successors, (165), 142 states have internal predecessors, (165), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 171 transitions. [2023-12-02 14:17:04,397 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 171 transitions. Word has length 7 [2023-12-02 14:17:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:17:04,397 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 171 transitions. [2023-12-02 14:17:04,397 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 14:17:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 171 transitions. [2023-12-02 14:17:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 14:17:04,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:04,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:17:04,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:04,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:04,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:04,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 488403783, now seen corresponding path program 1 times [2023-12-02 14:17:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:04,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813889945] [2023-12-02 14:17:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:04,602 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 14:17:04,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:04,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:04,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:04,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 14:17:04,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:04,698 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 14:17:04,774 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 14:17:04,775 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 14:17:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:17:04,792 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:17:04,792 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:04,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813889945] [2023-12-02 14:17:04,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813889945] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:17:04,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:17:04,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:17:04,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362824335] [2023-12-02 14:17:04,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:17:04,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:17:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:17:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:17:04,795 INFO L87 Difference]: Start difference. First operand 144 states and 171 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 14:17:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:17:05,497 INFO L93 Difference]: Finished difference Result 216 states and 249 transitions. [2023-12-02 14:17:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:17:05,498 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 14:17:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:17:05,499 INFO L225 Difference]: With dead ends: 216 [2023-12-02 14:17:05,500 INFO L226 Difference]: Without dead ends: 216 [2023-12-02 14:17:05,500 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 14:17:05,501 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 281 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:17:05,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 118 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 14:17:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-02 14:17:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 187. [2023-12-02 14:17:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 130 states have (on average 1.7692307692307692) internal successors, (230), 185 states have internal predecessors, (230), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 236 transitions. [2023-12-02 14:17:05,515 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 236 transitions. Word has length 7 [2023-12-02 14:17:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:17:05,516 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 236 transitions. [2023-12-02 14:17:05,516 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 14:17:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 236 transitions. [2023-12-02 14:17:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 14:17:05,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:05,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:17:05,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:05,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:05,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:05,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:05,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1204949237, now seen corresponding path program 1 times [2023-12-02 14:17:05,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:05,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210533270] [2023-12-02 14:17:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:05,719 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 14:17:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:05,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:05,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:05,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:17:05,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:05,793 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 14:17:05,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:17:05,824 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 14:17:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:17:05,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:17:05,834 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:05,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210533270] [2023-12-02 14:17:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210533270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:17:05,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:17:05,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:17:05,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840121640] [2023-12-02 14:17:05,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:17:05,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:17:05,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:05,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:17:05,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:17:05,837 INFO L87 Difference]: Start difference. First operand 187 states and 236 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 14:17:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:17:06,411 INFO L93 Difference]: Finished difference Result 186 states and 234 transitions. [2023-12-02 14:17:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:17:06,412 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 14:17:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:17:06,414 INFO L225 Difference]: With dead ends: 186 [2023-12-02 14:17:06,414 INFO L226 Difference]: Without dead ends: 186 [2023-12-02 14:17:06,414 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 14:17:06,415 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 6 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:17:06,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 356 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 14:17:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-02 14:17:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2023-12-02 14:17:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 130 states have (on average 1.7538461538461538) internal successors, (228), 184 states have internal predecessors, (228), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 234 transitions. [2023-12-02 14:17:06,426 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 234 transitions. Word has length 9 [2023-12-02 14:17:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:17:06,426 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 234 transitions. [2023-12-02 14:17:06,426 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 14:17:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 234 transitions. [2023-12-02 14:17:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 14:17:06,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:06,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:17:06,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:06,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:06,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:06,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1204949238, now seen corresponding path program 1 times [2023-12-02 14:17:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:06,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507500561] [2023-12-02 14:17:06,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:06,629 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 14:17:06,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:06,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:06,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:06,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 14:17:06,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:06,710 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 14:17:06,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:17:06,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:17:06,767 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 14:17:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:17:06,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:17:06,783 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:06,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507500561] [2023-12-02 14:17:06,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507500561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:17:06,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:17:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:17:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106751837] [2023-12-02 14:17:06,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:17:06,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:17:06,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:06,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:17:06,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:17:06,785 INFO L87 Difference]: Start difference. First operand 186 states and 234 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 14:17:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:17:07,433 INFO L93 Difference]: Finished difference Result 185 states and 232 transitions. [2023-12-02 14:17:07,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:17:07,434 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 14:17:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:17:07,435 INFO L225 Difference]: With dead ends: 185 [2023-12-02 14:17:07,435 INFO L226 Difference]: Without dead ends: 185 [2023-12-02 14:17:07,435 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 14:17:07,436 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:17:07,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 334 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 14:17:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-02 14:17:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2023-12-02 14:17:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.7384615384615385) internal successors, (226), 183 states have internal predecessors, (226), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 232 transitions. [2023-12-02 14:17:07,443 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 232 transitions. Word has length 9 [2023-12-02 14:17:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:17:07,443 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 232 transitions. [2023-12-02 14:17:07,443 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 14:17:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 232 transitions. [2023-12-02 14:17:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 14:17:07,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:07,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:17:07,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:07,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:07,644 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:07,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2039868593, now seen corresponding path program 1 times [2023-12-02 14:17:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:07,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290970930] [2023-12-02 14:17:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:07,645 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 14:17:07,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:07,646 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:07,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:07,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:17:07,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:17:07,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:17:07,706 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:07,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290970930] [2023-12-02 14:17:07,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290970930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:17:07,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:17:07,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:17:07,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427626745] [2023-12-02 14:17:07,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:17:07,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:17:07,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:07,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:17:07,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:17:07,708 INFO L87 Difference]: Start difference. First operand 185 states and 232 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:17:07,825 INFO L93 Difference]: Finished difference Result 222 states and 272 transitions. [2023-12-02 14:17:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:17:07,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2023-12-02 14:17:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:17:07,827 INFO L225 Difference]: With dead ends: 222 [2023-12-02 14:17:07,827 INFO L226 Difference]: Without dead ends: 222 [2023-12-02 14:17:07,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:17:07,828 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 101 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:17:07,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 180 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:17:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-12-02 14:17:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2023-12-02 14:17:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 192 states have internal predecessors, (240), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2023-12-02 14:17:07,834 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 11 [2023-12-02 14:17:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:17:07,834 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2023-12-02 14:17:07,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2023-12-02 14:17:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 14:17:07,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:07,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:17:07,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:08,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:08,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:08,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1684616548, now seen corresponding path program 1 times [2023-12-02 14:17:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687242446] [2023-12-02 14:17:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:08,037 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 14:17:08,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:08,038 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:08,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:08,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 14:17:08,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:08,140 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 14:17:08,182 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:17:08,182 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 14:17:08,224 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 14:17:08,317 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:17:08,318 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 14:17:08,341 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 14:17:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:17:08,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:17:08,376 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:08,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687242446] [2023-12-02 14:17:08,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687242446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:17:08,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:17:08,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 14:17:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154648133] [2023-12-02 14:17:08,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:17:08,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:17:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:08,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:17:08,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:17:08,379 INFO L87 Difference]: Start difference. First operand 194 states and 246 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 14:17:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:17:09,347 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2023-12-02 14:17:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 14:17:09,348 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 14:17:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:17:09,349 INFO L225 Difference]: With dead ends: 212 [2023-12-02 14:17:09,349 INFO L226 Difference]: Without dead ends: 212 [2023-12-02 14:17:09,349 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 14:17:09,350 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 310 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:17:09,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 206 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 14:17:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-02 14:17:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 193. [2023-12-02 14:17:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 139 states have (on average 1.7122302158273381) internal successors, (238), 191 states have internal predecessors, (238), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 244 transitions. [2023-12-02 14:17:09,356 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 244 transitions. Word has length 11 [2023-12-02 14:17:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:17:09,356 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 244 transitions. [2023-12-02 14:17:09,356 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 14:17:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 244 transitions. [2023-12-02 14:17:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 14:17:09,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:09,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:17:09,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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)] Forceful destruction successful, exit code 0 [2023-12-02 14:17:09,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:09,558 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:09,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1684616547, now seen corresponding path program 1 times [2023-12-02 14:17:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827158416] [2023-12-02 14:17:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:09,559 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 14:17:09,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:09,560 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:09,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:09,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 14:17:09,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:09,697 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 14:17:09,735 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:17:09,735 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 14:17:09,743 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 14:17:09,786 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 14:17:09,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:17:09,885 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:17:09,885 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 14:17:09,892 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 14:17:09,916 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 14:17:09,924 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 14:17:09,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 14:17:09,943 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:17:09,943 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827158416] [2023-12-02 14:17:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827158416] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:17:09,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:17:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 14:17:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739687134] [2023-12-02 14:17:09,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:17:09,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:17:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:09,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:17:09,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:17:09,945 INFO L87 Difference]: Start difference. First operand 193 states and 244 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 14:17:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:17:11,063 INFO L93 Difference]: Finished difference Result 194 states and 237 transitions. [2023-12-02 14:17:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 14:17:11,063 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 14:17:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:17:11,064 INFO L225 Difference]: With dead ends: 194 [2023-12-02 14:17:11,065 INFO L226 Difference]: Without dead ends: 194 [2023-12-02 14:17:11,065 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 14:17:11,065 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 239 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:17:11,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 223 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 14:17:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-02 14:17:11,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2023-12-02 14:17:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 133 states have (on average 1.669172932330827) internal successors, (222), 179 states have internal predecessors, (222), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 228 transitions. [2023-12-02 14:17:11,078 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 228 transitions. Word has length 11 [2023-12-02 14:17:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:17:11,079 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 228 transitions. [2023-12-02 14:17:11,079 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 14:17:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 228 transitions. [2023-12-02 14:17:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 14:17:11,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:11,080 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 14:17:11,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:11,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:11,280 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:11,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1214320935, now seen corresponding path program 1 times [2023-12-02 14:17:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23509577] [2023-12-02 14:17:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:11,281 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 14:17:11,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:11,282 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:11,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:11,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:17:11,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:17:11,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:17:11,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:11,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23509577] [2023-12-02 14:17:11,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23509577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:17:11,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:17:11,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:17:11,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075531534] [2023-12-02 14:17:11,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:17:11,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:17:11,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:11,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:17:11,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:17:11,414 INFO L87 Difference]: Start difference. First operand 181 states and 228 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:17:11,846 INFO L93 Difference]: Finished difference Result 208 states and 239 transitions. [2023-12-02 14:17:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:17:11,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2023-12-02 14:17:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:17:11,848 INFO L225 Difference]: With dead ends: 208 [2023-12-02 14:17:11,848 INFO L226 Difference]: Without dead ends: 208 [2023-12-02 14:17:11,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 14:17:11,849 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 243 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:17:11,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 172 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 14:17:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-12-02 14:17:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2023-12-02 14:17:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 178 states have internal predecessors, (219), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2023-12-02 14:17:11,854 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 21 [2023-12-02 14:17:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:17:11,854 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2023-12-02 14:17:11,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:17:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2023-12-02 14:17:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 14:17:11,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:17:11,855 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:17:11,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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)] Ended with exit code 0 [2023-12-02 14:17:12,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:12,056 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:17:12,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:17:12,056 INFO L85 PathProgramCache]: Analyzing trace with hash 623717161, now seen corresponding path program 1 times [2023-12-02 14:17:12,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:17:12,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406425039] [2023-12-02 14:17:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:12,057 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 14:17:12,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:17:12,058 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:12,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:17:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:12,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 14:17:12,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:12,194 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 14:17:12,262 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:17:12,262 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 14:17:12,318 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 14:17:12,439 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:17:12,440 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 14:17:12,529 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 14:17:12,530 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 14:17:12,593 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:17:12,594 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 14:17:12,723 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 14:17:12,756 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 14:17:12,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:17:12,845 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:17:14,917 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_309))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_311)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-12-02 14:17:14,932 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_309 (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_309))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_311)) |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 14:17:14,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:14,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 40 treesize of output 33 [2023-12-02 14:17:14,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:14,966 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 268 treesize of output 243 [2023-12-02 14:17:14,983 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 187 treesize of output 179 [2023-12-02 14:17:15,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:15,003 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 179 treesize of output 175 [2023-12-02 14:17:30,288 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 14:17:30,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:17:30,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406425039] [2023-12-02 14:17:30,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406425039] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:17:30,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [512492545] [2023-12-02 14:17:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:30,289 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:17:30,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:17:30,290 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:17:30,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-02 14:17:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:30,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 14:17:30,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:30,518 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 14:17:30,667 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:17:30,668 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 14:17:30,743 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 14:17:30,913 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:17:30,913 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 14:17:31,031 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 14:17:31,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 35 treesize of output 26 [2023-12-02 14:17:31,095 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:17:31,096 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 14:17:31,301 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 14:17:31,310 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 14:17:31,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:17:31,345 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:17:33,409 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_362))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_311)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv0 1))) is different from false [2023-12-02 14:17:33,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:33,527 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 14:17:33,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:33,544 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 14:17:33,553 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 14:17:33,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:33,572 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 14:17:44,449 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 14:17:44,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [512492545] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:17:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556920131] [2023-12-02 14:17:44,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:17:44,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:17:44,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:17:44,451 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:17:44,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 14:17:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:17:44,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 14:17:44,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:17:44,603 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:17:44,603 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 14:17:44,650 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 14:17:44,698 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:17:44,699 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 14:17:44,754 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 14:17:44,754 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 14:17:44,811 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:17:44,811 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 14:17:44,896 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 14:17:44,904 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 14:17:44,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:17:44,933 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv0 1))) is different from false [2023-12-02 14:17:44,955 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (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_415) |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 14:17:44,969 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_413))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_415)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:17:44,983 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_413))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_415)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:17:44,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:44,994 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 14:17:45,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:45,012 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 268 treesize of output 243 [2023-12-02 14:17:45,023 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 187 treesize of output 179 [2023-12-02 14:17:45,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:17:45,043 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 179 treesize of output 175 [2023-12-02 14:17:56,496 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 14:17:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556920131] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:17:56,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 14:17:56,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 10, 10, 11] total 35 [2023-12-02 14:17:56,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222634782] [2023-12-02 14:17:56,497 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 14:17:56,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 14:17:56,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:17:56,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 14:17:56,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=546, Unknown=22, NotChecked=522, Total=1260 [2023-12-02 14:17:56,499 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 36 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 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 14:18:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:18:00,243 INFO L93 Difference]: Finished difference Result 302 states and 355 transitions. [2023-12-02 14:18:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 14:18:00,244 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 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 14:18:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:18:00,245 INFO L225 Difference]: With dead ends: 302 [2023-12-02 14:18:00,245 INFO L226 Difference]: Without dead ends: 302 [2023-12-02 14:18:00,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=234, Invalid=772, Unknown=22, NotChecked=612, Total=1640 [2023-12-02 14:18:00,246 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 711 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 4085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2916 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:18:00,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 795 Invalid, 4085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1111 Invalid, 0 Unknown, 2916 Unchecked, 3.3s Time] [2023-12-02 14:18:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-12-02 14:18:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 208. [2023-12-02 14:18:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.5962732919254659) internal successors, (257), 206 states have internal predecessors, (257), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:18:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 262 transitions. [2023-12-02 14:18:00,251 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 262 transitions. Word has length 24 [2023-12-02 14:18:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:18:00,252 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 262 transitions. [2023-12-02 14:18:00,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 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 14:18:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 262 transitions. [2023-12-02 14:18:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 14:18:00,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:18:00,253 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:18:00,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2023-12-02 14:18:00,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 14:18:00,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:18:00,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:18:00,854 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:18:00,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:18:00,854 INFO L85 PathProgramCache]: Analyzing trace with hash 623717162, now seen corresponding path program 1 times [2023-12-02 14:18:00,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:18:00,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35655510] [2023-12-02 14:18:00,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:00,855 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 14:18:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:18:00,855 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:18:00,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:18:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:00,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 14:18:00,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:00,997 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 14:18:01,043 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 14:18:01,067 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:18:01,067 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 14:18:01,107 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 14:18:01,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:18:01,213 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:18:01,213 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 14:18:01,223 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 14:18:01,285 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 14:18:01,285 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 14:18:01,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:18:01,303 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 14:18:01,348 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:18:01,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 14:18:01,358 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 14:18:01,476 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 14:18:01,480 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 14:18:01,501 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 14:18:01,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:18:01,795 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_470) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-12-02 14:18:01,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (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_471 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_470) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-12-02 14:18:01,984 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_467))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_466) .cse0 v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_470) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_466) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))) is different from false [2023-12-02 14:18:02,105 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (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_466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_466) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_467) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_467))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_466) .cse2 v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_470) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2023-12-02 14:18:02,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:02,128 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 14:18:02,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:02,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 14:18:02,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:02,167 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 14:18:02,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:02,218 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 14:18:02,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 180 treesize of output 172 [2023-12-02 14:18:02,238 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 172 treesize of output 164 [2023-12-02 14:18:02,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:02,264 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 164 treesize of output 154 [2023-12-02 14:18:02,280 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 14:18:12,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:12,914 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 66 [2023-12-02 14:18:12,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:12,928 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 57 treesize of output 50 [2023-12-02 14:18:12,938 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 84 treesize of output 72 [2023-12-02 14:18:12,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:12,981 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 232 treesize of output 215 [2023-12-02 14:18:12,999 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 14:18:13,006 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 96 [2023-12-02 14:18:13,025 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 66 treesize of output 62 [2023-12-02 14:18:13,522 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 14:18:13,522 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:18:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35655510] [2023-12-02 14:18:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35655510] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:18:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [228128660] [2023-12-02 14:18:13,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:18:13,522 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:18:13,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:18:13,523 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:18:13,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-12-02 14:18:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:18:13,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 14:18:13,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:18:13,769 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 14:18:13,893 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:18:13,893 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 14:18:13,908 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 14:18:13,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:18:13,984 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 14:18:14,163 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:18:14,164 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 14:18:14,171 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 14:18:14,276 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 14:18:14,276 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 14:18:14,301 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 14:18:14,301 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 14:18:14,398 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:18:14,399 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 14:18:14,408 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 14:18:14,612 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 14:18:14,617 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 14:18:14,621 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 14:18:14,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:18:14,763 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_527) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_526) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_527) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32)))))) is different from false [2023-12-02 14:18:14,838 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_527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_527) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_526) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_527) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 14:18:14,966 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_523))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_522) .cse0 v_ArrVal_527) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_526) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_522) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_523) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_527) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))) is different from false [2023-12-02 14:18:15,094 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_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_523))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_522) .cse1 v_ArrVal_527) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_526) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_522) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_523) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_527) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 14:18:15,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:15,120 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 14:18:15,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:15,131 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 14:18:15,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:15,157 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 632 treesize of output 567 [2023-12-02 14:18:15,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:15,214 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 1831 treesize of output 1742 [2023-12-02 14:18:15,258 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 547 treesize of output 523 [2023-12-02 14:18:15,268 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 523 treesize of output 499 [2023-12-02 14:18:15,280 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 499 treesize of output 491 [2023-12-02 14:18:15,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:18:15,317 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 491 treesize of output 447 [2023-12-02 14:19:20,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:20,052 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 66 [2023-12-02 14:19:20,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:20,066 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 57 treesize of output 50 [2023-12-02 14:19:20,076 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 84 treesize of output 72 [2023-12-02 14:19:20,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:20,117 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 140 treesize of output 131 [2023-12-02 14:19:20,138 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 82 treesize of output 74 [2023-12-02 14:19:20,147 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 96 [2023-12-02 14:19:20,167 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 66 treesize of output 62 [2023-12-02 14:19:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:19:20,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [228128660] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:19:20,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714640137] [2023-12-02 14:19:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:20,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:19:20,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:19:20,892 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:19:20,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 14:19:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:21,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 14:19:21,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:21,006 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 14:19:21,041 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:19:21,041 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 14:19:21,053 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 14:19:21,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:19:21,081 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 14:19:21,144 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:19:21,145 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 14:19:21,157 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 14:19:21,198 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 14:19:21,198 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 14:19:21,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:19:21,214 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 14:19:21,260 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:19:21,261 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 14:19:21,267 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 14:19:21,352 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 14:19:21,357 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 14:19:21,361 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 14:19:21,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:19:21,478 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32)))))) is different from false [2023-12-02 14:19:21,540 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_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_582) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_583) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_582) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 14:19:21,576 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_579) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_578) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_582) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_578))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_579) .cse1 v_ArrVal_582) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_583) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2023-12-02 14:19:21,620 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_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_578))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_579) .cse1 v_ArrVal_582) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_583) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_579) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_578) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_582) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 14:19:21,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:21,637 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 66 [2023-12-02 14:19:21,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:21,647 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 57 treesize of output 50 [2023-12-02 14:19:21,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 72 [2023-12-02 14:19:21,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:21,695 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 232 treesize of output 215 [2023-12-02 14:19:21,719 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 14:19:21,725 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 96 [2023-12-02 14:19:21,738 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 66 treesize of output 62 [2023-12-02 14:19:21,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:21,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2023-12-02 14:19:21,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:21,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2023-12-02 14:19:21,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:19:21,890 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:19:21,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-12-02 14:19:21,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:19:21,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-12-02 14:19:22,012 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 14:19:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714640137] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:19:22,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 14:19:22,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 10, 9, 10] total 34 [2023-12-02 14:19:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580000556] [2023-12-02 14:19:22,012 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 14:19:22,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 14:19:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:22,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 14:19:22,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=470, Unknown=12, NotChecked=660, Total=1260 [2023-12-02 14:19:22,014 INFO L87 Difference]: Start difference. First operand 208 states and 262 transitions. Second operand has 36 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 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 14:19:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:19:26,392 INFO L93 Difference]: Finished difference Result 297 states and 350 transitions. [2023-12-02 14:19:26,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 14:19:26,392 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 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 14:19:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:19:26,394 INFO L225 Difference]: With dead ends: 297 [2023-12-02 14:19:26,394 INFO L226 Difference]: Without dead ends: 297 [2023-12-02 14:19:26,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 99 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=240, Invalid=918, Unknown=12, NotChecked=900, Total=2070 [2023-12-02 14:19:26,395 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 618 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 4897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3735 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:19:26,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 767 Invalid, 4897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1124 Invalid, 0 Unknown, 3735 Unchecked, 3.5s Time] [2023-12-02 14:19:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-02 14:19:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 208. [2023-12-02 14:19:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.5900621118012421) internal successors, (256), 206 states have internal predecessors, (256), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:19:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 261 transitions. [2023-12-02 14:19:26,400 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 261 transitions. Word has length 24 [2023-12-02 14:19:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:19:26,400 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 261 transitions. [2023-12-02 14:19:26,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 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 14:19:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 261 transitions. [2023-12-02 14:19:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 14:19:26,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:19:26,401 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:19:26,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:19:26,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 14:19:26,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2023-12-02 14:19:27,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:19:27,002 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:19:27,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:19:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2139314169, now seen corresponding path program 1 times [2023-12-02 14:19:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:19:27,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723225044] [2023-12-02 14:19:27,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:27,003 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 14:19:27,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:19:27,004 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:19:27,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 (18)] Waiting until timeout for monitored process [2023-12-02 14:19:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:27,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:19:27,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:19:27,125 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:19:27,125 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:19:27,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723225044] [2023-12-02 14:19:27,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723225044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:19:27,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:19:27,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:19:27,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335267657] [2023-12-02 14:19:27,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:19:27,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:19:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:19:27,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:19:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:19:27,127 INFO L87 Difference]: Start difference. First operand 208 states and 261 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:19:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:19:27,285 INFO L93 Difference]: Finished difference Result 211 states and 264 transitions. [2023-12-02 14:19:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:19:27,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 25 [2023-12-02 14:19:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:19:27,287 INFO L225 Difference]: With dead ends: 211 [2023-12-02 14:19:27,287 INFO L226 Difference]: Without dead ends: 211 [2023-12-02 14:19:27,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:19:27,288 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:19:27,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:19:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-02 14:19:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2023-12-02 14:19:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 164 states have (on average 1.579268292682927) internal successors, (259), 209 states have internal predecessors, (259), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:19:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 264 transitions. [2023-12-02 14:19:27,292 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 264 transitions. Word has length 25 [2023-12-02 14:19:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:19:27,292 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 264 transitions. [2023-12-02 14:19:27,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:19:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 264 transitions. [2023-12-02 14:19:27,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 14:19:27,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:19:27,293 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:19:27,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 (18)] Ended with exit code 0 [2023-12-02 14:19:27,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:19:27,494 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-02 14:19:27,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:19:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1137797463, now seen corresponding path program 1 times [2023-12-02 14:19:27,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:19:27,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663248157] [2023-12-02 14:19:27,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:27,495 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 14:19:27,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:19:27,496 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 14:19:27,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/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 (19)] Waiting until timeout for monitored process [2023-12-02 14:19:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:27,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 14:19:27,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:27,662 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 14:19:27,738 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:19:27,738 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 14:19:27,767 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 14:19:27,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:19:27,875 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:19:27,876 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 14:19:27,883 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 14:19:27,957 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 14:19:27,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 14:19:27,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:19:27,970 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 14:19:28,028 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:19:28,028 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 60 treesize of output 53 [2023-12-02 14:19:28,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 19 treesize of output 11 [2023-12-02 14:19:28,041 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 14:19:28,222 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 14:19:28,227 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 14:19:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:19:28,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:19:28,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2023-12-02 14:19:28,722 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_684 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_679))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_684) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_680))) (= (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_679) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_683) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2023-12-02 14:19:28,754 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (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_684 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_679))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_684) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_680))) (= (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_679) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_683) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-12-02 14:19:28,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:28,771 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 14:19:28,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:28,791 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 408 treesize of output 343 [2023-12-02 14:19:28,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:28,823 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 287 treesize of output 263 [2023-12-02 14:19:28,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 239 [2023-12-02 14:19:29,042 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 14:19:29,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-12-02 14:19:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:19:31,207 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:19:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663248157] [2023-12-02 14:19:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663248157] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:19:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [184708520] [2023-12-02 14:19:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:19:31,208 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:19:31,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:19:31,209 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:19:31,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-02 14:19:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:19:31,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 14:19:31,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:19:31,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2023-12-02 14:19:31,666 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2023-12-02 14:19:31,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 30 [2023-12-02 14:19:31,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:19:31,784 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 14:19:31,991 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:19:31,991 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 49 treesize of output 44 [2023-12-02 14:19:32,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 14:19:32,143 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 14:19:32,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 14:19:32,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:19:32,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 14:19:32,341 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 14:19:32,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 55 [2023-12-02 14:19:32,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:19:32,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 14:19:32,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 14:19:32,728 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 14:19:32,728 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2023-12-02 14:19:32,736 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 14:19:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:19:32,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:19:33,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 33 [2023-12-02 14:19:39,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:39,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 201 [2023-12-02 14:19:39,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:39,781 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 193 treesize of output 129 [2023-12-02 14:19:39,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:39,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1176 treesize of output 1122 [2023-12-02 14:19:40,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1062 treesize of output 962 [2023-12-02 14:19:40,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:40,073 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 1724 treesize of output 1598 [2023-12-02 14:19:40,131 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 780 treesize of output 732 [2023-12-02 14:19:44,508 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 201 treesize of output 193 [2023-12-02 14:19:44,906 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 68 treesize of output 64 [2023-12-02 14:19:44,992 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 1054 treesize of output 1024 [2023-12-02 14:19:46,001 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 322 treesize of output 310 [2023-12-02 14:19:46,393 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 260 treesize of output 252 [2023-12-02 14:19:47,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:47,738 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 2305 treesize of output 2197 [2023-12-02 14:19:59,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:59,862 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 159 treesize of output 135 [2023-12-02 14:19:59,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:19:59,890 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 127 treesize of output 95 [2023-12-02 14:20:00,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:00,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 906 treesize of output 902 [2023-12-02 14:20:00,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:00,105 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 864 treesize of output 775 [2023-12-02 14:20:00,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:00,204 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 991 treesize of output 951 [2023-12-02 14:20:00,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:00,273 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 546 treesize of output 518 [2023-12-02 14:20:00,299 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 110 treesize of output 102 [2023-12-02 14:20:02,151 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 72 treesize of output 70 [2023-12-02 14:20:02,246 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 10 treesize of output 8 [2023-12-02 14:20:02,290 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 10 treesize of output 8 [2023-12-02 14:20:02,694 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 10 treesize of output 8 [2023-12-02 14:20:02,734 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 10 treesize of output 8 [2023-12-02 14:20:03,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:03,047 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 609 treesize of output 603 [2023-12-02 14:20:18,044 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification. DAG size of input: 664 DAG size of output: 631 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:20:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:20:27,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [184708520] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:20:27,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715434294] [2023-12-02 14:20:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:20:27,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:20:27,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:20:27,526 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:20:27,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30e14c3-7a60-494f-b946-5b0f62e505eb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 14:20:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:20:27,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 14:20:27,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:20:27,655 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 14:20:27,958 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 14:20:27,981 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:20:27,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2023-12-02 14:20:28,302 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 14:20:28,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:20:28,689 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:20:28,690 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 14:20:28,701 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 14:20:28,940 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 14:20:28,940 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 14:20:28,944 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 5 treesize of output 3 [2023-12-02 14:20:28,973 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 14:20:28,973 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 14:20:29,228 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:20:29,228 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 14:20:29,237 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 14:20:29,794 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 14:20:29,801 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 14:20:30,085 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 14:20:30,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:20:31,392 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2023-12-02 14:20:31,462 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_799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_800) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2023-12-02 14:20:31,532 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_796))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_795) .cse0 v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_800) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_795) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_796) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2023-12-02 14:20:31,768 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_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_796))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_795) .cse1 v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_800) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_795) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_796) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))))) is different from false [2023-12-02 14:20:31,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:31,790 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 14:20:31,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:31,805 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 14:20:31,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:31,837 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 14:20:31,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:31,895 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 14:20:31,907 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 14:20:31,915 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 172 treesize of output 164 [2023-12-02 14:20:31,929 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 84 treesize of output 80 [2023-12-02 14:20:31,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:31,958 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 160 treesize of output 150 [2023-12-02 14:20:35,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:35,617 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 71 treesize of output 64 [2023-12-02 14:20:35,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:35,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2023-12-02 14:20:35,641 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 80 treesize of output 68 [2023-12-02 14:20:35,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:20:35,679 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 212 treesize of output 195 [2023-12-02 14:20:35,707 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 70 treesize of output 66 [2023-12-02 14:20:35,716 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 96 treesize of output 84 [2023-12-02 14:20:35,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-12-02 14:20:38,514 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 14:20:38,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715434294] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:20:38,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 14:20:38,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 13, 9, 10] total 58 [2023-12-02 14:20:38,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873665244] [2023-12-02 14:20:38,515 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 14:20:38,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-12-02 14:20:38,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:20:38,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-12-02 14:20:38,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2460, Unknown=50, NotChecked=642, Total=3422 [2023-12-02 14:20:38,518 INFO L87 Difference]: Start difference. First operand 211 states and 264 transitions. Second operand has 59 states, 59 states have (on average 2.457627118644068) internal successors, (145), 58 states have internal predecessors, (145), 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 14:20:40,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:20:55,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []