./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.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_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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_9839da00-de55-4c73-87ef-e60b7e8c791e/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 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:47:34,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:47:34,176 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 17:47:34,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:47:34,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:47:34,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:47:34,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:47:34,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:47:34,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:47:34,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:47:34,206 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:47:34,207 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:47:34,207 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:47:34,208 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:47:34,208 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:47:34,208 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:47:34,209 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:47:34,209 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:47:34,210 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:47:34,210 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:47:34,211 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:47:34,212 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:47:34,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 17:47:34,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 17:47:34,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:47:34,214 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:47:34,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:47:34,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:47:34,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:47:34,215 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 17:47:34,216 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 17:47:34,216 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 17:47:34,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:47:34,217 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:47:34,217 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 17:47:34,217 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:47:34,217 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:47:34,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:47:34,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:47:34,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:47:34,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:47:34,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:47:34,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:47:34,219 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:47:34,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:47:34,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:47:34,220 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:47:34,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:47:34,220 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_9839da00-de55-4c73-87ef-e60b7e8c791e/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_9839da00-de55-4c73-87ef-e60b7e8c791e/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 -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2023-12-02 17:47:34,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:47:34,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:47:34,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:47:34,488 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:47:34,488 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:47:34,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2023-12-02 17:47:37,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:47:37,469 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:47:37,470 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2023-12-02 17:47:37,484 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/data/21add92f1/c995fe1b9ecb4e62a1cf65fc42c09730/FLAGeee1931bf [2023-12-02 17:47:37,499 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/data/21add92f1/c995fe1b9ecb4e62a1cf65fc42c09730 [2023-12-02 17:47:37,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:47:37,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:47:37,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:47:37,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:47:37,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:47:37,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d89ed78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37, skipping insertion in model container [2023-12-02 17:47:37,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,559 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:47:37,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:47:37,819 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:47:37,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:47:37,884 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:47:37,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37 WrapperNode [2023-12-02 17:47:37,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:47:37,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:47:37,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:47:37,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:47:37,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,930 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2023-12-02 17:47:37,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:47:37,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:47:37,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:47:37,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:47:37,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:47:37,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:47:37,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:47:37,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:47:37,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (1/1) ... [2023-12-02 17:47:37,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:47:37,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:47:37,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:47:38,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:47:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:47:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:47:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 17:47:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 17:47:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:47:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:47:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:47:38,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:47:38,153 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:47:38,155 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:47:38,560 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:47:38,618 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:47:38,618 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 17:47:38,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:47:38 BoogieIcfgContainer [2023-12-02 17:47:38,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:47:38,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:47:38,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:47:38,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:47:38,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:47:37" (1/3) ... [2023-12-02 17:47:38,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554c0c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:47:38, skipping insertion in model container [2023-12-02 17:47:38,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:47:37" (2/3) ... [2023-12-02 17:47:38,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554c0c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:47:38, skipping insertion in model container [2023-12-02 17:47:38,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:47:38" (3/3) ... [2023-12-02 17:47:38,630 INFO L112 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2023-12-02 17:47:38,649 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:47:38,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2023-12-02 17:47:38,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:47:38,703 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;@bef31a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:47:38,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2023-12-02 17:47:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 47 states have (on average 2.574468085106383) internal successors, (121), 112 states have internal predecessors, (121), 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 17:47:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 17:47:38,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:38,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 17:47:38,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:38,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:38,718 INFO L85 PathProgramCache]: Analyzing trace with hash 7413, now seen corresponding path program 1 times [2023-12-02 17:47:38,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:38,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321197117] [2023-12-02 17:47:38,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:38,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:38,976 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 17:47:38,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:38,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321197117] [2023-12-02 17:47:38,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321197117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:38,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:38,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 17:47:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115142253] [2023-12-02 17:47:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:38,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:47:38,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:39,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:47:39,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:47:39,020 INFO L87 Difference]: Start difference. First operand has 113 states, 47 states have (on average 2.574468085106383) internal successors, (121), 112 states have internal predecessors, (121), 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) 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 17:47:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:39,171 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2023-12-02 17:47:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:47:39,173 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 17:47:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:39,181 INFO L225 Difference]: With dead ends: 106 [2023-12-02 17:47:39,182 INFO L226 Difference]: Without dead ends: 105 [2023-12-02 17:47:39,183 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 17:47:39,187 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 24 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:39,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 115 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-02 17:47:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-02 17:47:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 104 states have internal predecessors, (109), 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 17:47:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2023-12-02 17:47:39,228 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 2 [2023-12-02 17:47:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:39,229 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2023-12-02 17:47:39,229 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 17:47:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2023-12-02 17:47:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 17:47:39,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:39,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 17:47:39,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:47:39,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:39,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash 7414, now seen corresponding path program 1 times [2023-12-02 17:47:39,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:39,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877743478] [2023-12-02 17:47:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:39,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:39,329 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 17:47:39,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877743478] [2023-12-02 17:47:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877743478] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 17:47:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668329535] [2023-12-02 17:47:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:39,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:47:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:39,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:47:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:47:39,333 INFO L87 Difference]: Start difference. First operand 105 states and 109 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 17:47:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:39,449 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2023-12-02 17:47:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:47:39,451 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 17:47:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:39,452 INFO L225 Difference]: With dead ends: 98 [2023-12-02 17:47:39,452 INFO L226 Difference]: Without dead ends: 98 [2023-12-02 17:47:39,453 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 17:47:39,454 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 17 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:39,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 119 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-02 17:47:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-02 17:47:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 97 states have internal predecessors, (102), 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 17:47:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2023-12-02 17:47:39,465 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 2 [2023-12-02 17:47:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:39,465 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2023-12-02 17:47:39,465 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 17:47:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2023-12-02 17:47:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 17:47:39,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:39,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:39,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 17:47:39,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:39,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash -708773178, now seen corresponding path program 1 times [2023-12-02 17:47:39,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:39,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309057421] [2023-12-02 17:47:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:39,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:39,692 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 17:47:39,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309057421] [2023-12-02 17:47:39,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309057421] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:39,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:39,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:47:39,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836979345] [2023-12-02 17:47:39,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:39,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:47:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:39,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:47:39,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:47:39,695 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 5 states, 4 states have (on average 1.75) 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 17:47:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:39,868 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2023-12-02 17:47:39,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:47:39,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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 17:47:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:39,871 INFO L225 Difference]: With dead ends: 97 [2023-12-02 17:47:39,871 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 17:47:39,872 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 17:47:39,873 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:39,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 207 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:47:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 17:47:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-02 17:47:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.148936170212766) internal successors, (101), 96 states have internal predecessors, (101), 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 17:47:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2023-12-02 17:47:39,884 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 7 [2023-12-02 17:47:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:39,884 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2023-12-02 17:47:39,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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 17:47:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2023-12-02 17:47:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 17:47:39,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:39,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:39,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 17:47:39,886 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:39,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash -708773177, now seen corresponding path program 1 times [2023-12-02 17:47:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893410757] [2023-12-02 17:47:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:40,100 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 17:47:40,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:40,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893410757] [2023-12-02 17:47:40,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893410757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:40,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:40,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:47:40,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254764394] [2023-12-02 17:47:40,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:40,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:47:40,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:40,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:47:40,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:47:40,104 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 5 states, 4 states have (on average 1.75) 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 17:47:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:40,285 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2023-12-02 17:47:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:47:40,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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 17:47:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:40,287 INFO L225 Difference]: With dead ends: 96 [2023-12-02 17:47:40,287 INFO L226 Difference]: Without dead ends: 96 [2023-12-02 17:47:40,288 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 17:47:40,289 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:40,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 219 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:47:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-02 17:47:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-02 17:47:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 47 states have (on average 2.127659574468085) internal successors, (100), 95 states have internal predecessors, (100), 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 17:47:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2023-12-02 17:47:40,298 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 7 [2023-12-02 17:47:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:40,299 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2023-12-02 17:47:40,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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 17:47:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2023-12-02 17:47:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 17:47:40,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:40,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:40,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 17:47:40,301 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:40,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash -497132045, now seen corresponding path program 1 times [2023-12-02 17:47:40,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:40,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961598996] [2023-12-02 17:47:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:40,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:40,364 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 17:47:40,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:40,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961598996] [2023-12-02 17:47:40,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961598996] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:40,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:40,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:47:40,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27844184] [2023-12-02 17:47:40,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:40,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:47:40,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:40,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:47:40,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:47:40,367 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 17:47:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:40,495 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2023-12-02 17:47:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:47:40,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2023-12-02 17:47:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:40,497 INFO L225 Difference]: With dead ends: 95 [2023-12-02 17:47:40,497 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 17:47:40,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:47:40,499 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:40,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 266 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 17:47:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-02 17:47:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 47 states have (on average 2.106382978723404) internal successors, (99), 94 states have internal predecessors, (99), 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 17:47:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2023-12-02 17:47:40,506 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 8 [2023-12-02 17:47:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:40,507 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2023-12-02 17:47:40,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 17:47:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2023-12-02 17:47:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 17:47:40,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:40,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:40,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 17:47:40,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:40,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash -497132044, now seen corresponding path program 1 times [2023-12-02 17:47:40,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:40,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954662229] [2023-12-02 17:47:40,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:40,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:40,804 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 17:47:40,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:40,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954662229] [2023-12-02 17:47:40,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954662229] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:40,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:40,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:47:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952883071] [2023-12-02 17:47:40,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:40,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 17:47:40,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:40,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 17:47:40,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:47:40,807 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 17:47:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:40,985 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2023-12-02 17:47:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:47:40,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2023-12-02 17:47:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:40,986 INFO L225 Difference]: With dead ends: 94 [2023-12-02 17:47:40,986 INFO L226 Difference]: Without dead ends: 94 [2023-12-02 17:47:40,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:47:40,987 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:40,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 216 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-02 17:47:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-02 17:47:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 93 states have internal predecessors, (98), 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 17:47:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2023-12-02 17:47:40,994 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 8 [2023-12-02 17:47:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:40,995 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2023-12-02 17:47:40,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 17:47:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2023-12-02 17:47:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 17:47:40,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:40,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:40,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 17:47:40,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:40,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1008275651, now seen corresponding path program 1 times [2023-12-02 17:47:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:40,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114732951] [2023-12-02 17:47:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:41,258 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 17:47:41,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114732951] [2023-12-02 17:47:41,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114732951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:41,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:41,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 17:47:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894103735] [2023-12-02 17:47:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:41,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 17:47:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:41,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 17:47:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-02 17:47:41,260 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) 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 17:47:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:41,527 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2023-12-02 17:47:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 17:47:41,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) 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 17:47:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:41,528 INFO L225 Difference]: With dead ends: 93 [2023-12-02 17:47:41,528 INFO L226 Difference]: Without dead ends: 93 [2023-12-02 17:47:41,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:47:41,529 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 9 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:41,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 389 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:47:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-02 17:47:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-02 17:47:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 92 states have internal predecessors, (97), 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 17:47:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2023-12-02 17:47:41,536 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 11 [2023-12-02 17:47:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:41,536 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2023-12-02 17:47:41,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) 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 17:47:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2023-12-02 17:47:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 17:47:41,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:41,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:41,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 17:47:41,538 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:41,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1008275650, now seen corresponding path program 1 times [2023-12-02 17:47:41,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:41,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654331261] [2023-12-02 17:47:41,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:41,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:41,889 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 17:47:41,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654331261] [2023-12-02 17:47:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654331261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:41,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:41,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 17:47:41,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503185491] [2023-12-02 17:47:41,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:41,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 17:47:41,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:41,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 17:47:41,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-02 17:47:41,891 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) 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 17:47:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:42,111 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2023-12-02 17:47:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 17:47:42,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) 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 17:47:42,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:42,112 INFO L225 Difference]: With dead ends: 92 [2023-12-02 17:47:42,112 INFO L226 Difference]: Without dead ends: 92 [2023-12-02 17:47:42,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:47:42,113 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:42,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 323 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:47:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-02 17:47:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-02 17:47:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 91 states have internal predecessors, (96), 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 17:47:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2023-12-02 17:47:42,117 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 11 [2023-12-02 17:47:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:42,117 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2023-12-02 17:47:42,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) 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 17:47:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2023-12-02 17:47:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 17:47:42,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:42,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:42,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 17:47:42,118 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:42,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:42,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1191774103, now seen corresponding path program 1 times [2023-12-02 17:47:42,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:42,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540092228] [2023-12-02 17:47:42,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:42,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:42,181 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 17:47:42,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:42,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540092228] [2023-12-02 17:47:42,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540092228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:42,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:42,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:47:42,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768743277] [2023-12-02 17:47:42,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:42,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:47:42,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:42,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:47:42,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:47:42,184 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 17:47:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:42,303 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2023-12-02 17:47:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:47:42,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-12-02 17:47:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:42,304 INFO L225 Difference]: With dead ends: 91 [2023-12-02 17:47:42,304 INFO L226 Difference]: Without dead ends: 91 [2023-12-02 17:47:42,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:47:42,305 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:42,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-02 17:47:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-12-02 17:47:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 2.021276595744681) internal successors, (95), 90 states have internal predecessors, (95), 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 17:47:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2023-12-02 17:47:42,310 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 12 [2023-12-02 17:47:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:42,311 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2023-12-02 17:47:42,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 17:47:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2023-12-02 17:47:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 17:47:42,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:42,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:42,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 17:47:42,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:42,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1191774102, now seen corresponding path program 1 times [2023-12-02 17:47:42,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:42,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867387096] [2023-12-02 17:47:42,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:42,765 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 17:47:42,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:42,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867387096] [2023-12-02 17:47:42,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867387096] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:42,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:42,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 17:47:42,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92565946] [2023-12-02 17:47:42,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:42,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 17:47:42,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:42,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 17:47:42,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:47:42,767 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 17:47:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:43,045 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2023-12-02 17:47:43,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 17:47:43,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 12 [2023-12-02 17:47:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:43,046 INFO L225 Difference]: With dead ends: 90 [2023-12-02 17:47:43,046 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 17:47:43,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-12-02 17:47:43,047 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 10 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:43,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 362 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:47:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 17:47:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-02 17:47:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 47 states have (on average 2.0) internal successors, (94), 89 states have internal predecessors, (94), 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 17:47:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-12-02 17:47:43,051 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 12 [2023-12-02 17:47:43,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:43,052 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-12-02 17:47:43,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 17:47:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-12-02 17:47:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 17:47:43,053 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:43,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:43,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 17:47:43,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:43,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:43,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1937523427, now seen corresponding path program 1 times [2023-12-02 17:47:43,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:43,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916911627] [2023-12-02 17:47:43,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:43,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:43,131 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 17:47:43,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:43,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916911627] [2023-12-02 17:47:43,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916911627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:43,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:43,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:47:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450655369] [2023-12-02 17:47:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:43,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:47:43,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:43,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:47:43,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:47:43,134 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 17:47:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:43,265 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2023-12-02 17:47:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:47:43,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2023-12-02 17:47:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:43,267 INFO L225 Difference]: With dead ends: 116 [2023-12-02 17:47:43,267 INFO L226 Difference]: Without dead ends: 116 [2023-12-02 17:47:43,267 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 17:47:43,268 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 119 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:43,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 105 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-02 17:47:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 88. [2023-12-02 17:47:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 87 states have internal predecessors, (92), 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 17:47:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2023-12-02 17:47:43,273 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 15 [2023-12-02 17:47:43,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:43,274 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2023-12-02 17:47:43,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 17:47:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2023-12-02 17:47:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 17:47:43,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:43,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:43,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 17:47:43,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:43,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1937523426, now seen corresponding path program 1 times [2023-12-02 17:47:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362472712] [2023-12-02 17:47:43,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:43,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:43,425 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 17:47:43,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:43,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362472712] [2023-12-02 17:47:43,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362472712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:43,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:43,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:47:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908890812] [2023-12-02 17:47:43,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:43,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:47:43,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:43,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:47:43,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:47:43,428 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17:47:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:43,578 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2023-12-02 17:47:43,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:47:43,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2023-12-02 17:47:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:43,580 INFO L225 Difference]: With dead ends: 86 [2023-12-02 17:47:43,580 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 17:47:43,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:47:43,581 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 118 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:43,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 141 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:43,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 17:47:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-02 17:47:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 85 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 17:47:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2023-12-02 17:47:43,584 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 15 [2023-12-02 17:47:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:43,585 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2023-12-02 17:47:43,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17:47:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2023-12-02 17:47:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:47:43,585 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:43,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:43,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 17:47:43,586 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:43,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:43,586 INFO L85 PathProgramCache]: Analyzing trace with hash 66317052, now seen corresponding path program 1 times [2023-12-02 17:47:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:43,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832585742] [2023-12-02 17:47:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:43,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:43,662 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 17:47:43,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:43,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832585742] [2023-12-02 17:47:43,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832585742] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:47:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962367359] [2023-12-02 17:47:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:43,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:47:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:47:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:47:43,664 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:43,816 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2023-12-02 17:47:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:47:43,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:47:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:43,818 INFO L225 Difference]: With dead ends: 105 [2023-12-02 17:47:43,818 INFO L226 Difference]: Without dead ends: 105 [2023-12-02 17:47:43,818 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 17:47:43,819 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 109 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:43,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 93 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-02 17:47:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2023-12-02 17:47:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 82 states have internal predecessors, (88), 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 17:47:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-12-02 17:47:43,823 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 16 [2023-12-02 17:47:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:43,823 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-12-02 17:47:43,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-12-02 17:47:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:47:43,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:43,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:43,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 17:47:43,824 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:43,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash 66317053, now seen corresponding path program 1 times [2023-12-02 17:47:43,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:43,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803273572] [2023-12-02 17:47:43,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:43,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:43,965 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 17:47:43,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:43,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803273572] [2023-12-02 17:47:43,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803273572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:43,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:43,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:47:43,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288741948] [2023-12-02 17:47:43,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:43,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:47:43,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:43,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:47:43,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:47:43,968 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:44,110 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2023-12-02 17:47:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:47:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:47:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:44,111 INFO L225 Difference]: With dead ends: 78 [2023-12-02 17:47:44,112 INFO L226 Difference]: Without dead ends: 78 [2023-12-02 17:47:44,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:47:44,113 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 85 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:44,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 115 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-02 17:47:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-02 17:47:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 77 states have internal predecessors, (82), 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 17:47:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2023-12-02 17:47:44,116 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 16 [2023-12-02 17:47:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:44,116 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2023-12-02 17:47:44,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 17:47:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2023-12-02 17:47:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:47:44,117 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:44,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:44,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 17:47:44,117 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:44,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash 66320432, now seen corresponding path program 1 times [2023-12-02 17:47:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:44,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315211331] [2023-12-02 17:47:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:44,506 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 17:47:44,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315211331] [2023-12-02 17:47:44,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315211331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:44,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:44,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 17:47:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776347049] [2023-12-02 17:47:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:44,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:47:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:44,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:47:44,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:47:44,509 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:44,952 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2023-12-02 17:47:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 17:47:44,952 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:47:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:44,953 INFO L225 Difference]: With dead ends: 116 [2023-12-02 17:47:44,953 INFO L226 Difference]: Without dead ends: 116 [2023-12-02 17:47:44,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-12-02 17:47:44,954 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 128 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:44,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 283 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:47:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-02 17:47:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 78. [2023-12-02 17:47:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 77 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 17:47:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2023-12-02 17:47:44,958 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 16 [2023-12-02 17:47:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:44,958 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2023-12-02 17:47:44,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2023-12-02 17:47:44,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:47:44,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:44,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:44,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 17:47:44,959 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:44,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:44,960 INFO L85 PathProgramCache]: Analyzing trace with hash 66320433, now seen corresponding path program 1 times [2023-12-02 17:47:44,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:44,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950879821] [2023-12-02 17:47:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:45,554 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 17:47:45,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:45,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950879821] [2023-12-02 17:47:45,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950879821] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:45,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:45,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-02 17:47:45,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752409513] [2023-12-02 17:47:45,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:45,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 17:47:45,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:45,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 17:47:45,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-02 17:47:45,557 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:46,124 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2023-12-02 17:47:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 17:47:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:47:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:46,125 INFO L225 Difference]: With dead ends: 146 [2023-12-02 17:47:46,125 INFO L226 Difference]: Without dead ends: 146 [2023-12-02 17:47:46,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-12-02 17:47:46,126 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 139 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:46,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 337 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:47:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-02 17:47:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2023-12-02 17:47:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 93 states have internal predecessors, (114), 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 17:47:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2023-12-02 17:47:46,131 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 16 [2023-12-02 17:47:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:46,131 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2023-12-02 17:47:46,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2023-12-02 17:47:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 17:47:46,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:46,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:46,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 17:47:46,132 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:46,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash -33533053, now seen corresponding path program 1 times [2023-12-02 17:47:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:46,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227127491] [2023-12-02 17:47:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:46,202 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 17:47:46,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227127491] [2023-12-02 17:47:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227127491] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:46,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:46,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:47:46,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774816546] [2023-12-02 17:47:46,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:46,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:47:46,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:46,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:47:46,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:47:46,204 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:46,282 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2023-12-02 17:47:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:47:46,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 17:47:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:46,284 INFO L225 Difference]: With dead ends: 93 [2023-12-02 17:47:46,285 INFO L226 Difference]: Without dead ends: 93 [2023-12-02 17:47:46,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 17:47:46,286 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 77 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:46,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 128 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-02 17:47:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-02 17:47:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.661764705882353) internal successors, (113), 92 states have internal predecessors, (113), 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 17:47:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2023-12-02 17:47:46,290 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 19 [2023-12-02 17:47:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:46,290 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2023-12-02 17:47:46,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2023-12-02 17:47:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 17:47:46,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:46,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:46,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 17:47:46,292 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:46,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1039448246, now seen corresponding path program 1 times [2023-12-02 17:47:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:46,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817212914] [2023-12-02 17:47:46,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:46,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:46,680 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 17:47:46,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817212914] [2023-12-02 17:47:46,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817212914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:46,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 17:47:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144271110] [2023-12-02 17:47:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:46,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:47:46,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:47:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:47:46,682 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:47,061 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2023-12-02 17:47:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 17:47:47,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 17:47:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:47,062 INFO L225 Difference]: With dead ends: 128 [2023-12-02 17:47:47,062 INFO L226 Difference]: Without dead ends: 128 [2023-12-02 17:47:47,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-12-02 17:47:47,063 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 48 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:47,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 306 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:47:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-02 17:47:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2023-12-02 17:47:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.635135135135135) internal successors, (121), 98 states have internal predecessors, (121), 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 17:47:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2023-12-02 17:47:47,067 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 20 [2023-12-02 17:47:47,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:47,068 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2023-12-02 17:47:47,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2023-12-02 17:47:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 17:47:47,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:47,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:47,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 17:47:47,070 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:47,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1039448245, now seen corresponding path program 1 times [2023-12-02 17:47:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:47,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488995502] [2023-12-02 17:47:47,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:47,789 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 17:47:47,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:47,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488995502] [2023-12-02 17:47:47,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488995502] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:47,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:47,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-02 17:47:47,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235064551] [2023-12-02 17:47:47,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:47,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 17:47:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:47,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 17:47:47,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-02 17:47:47,791 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:48,202 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2023-12-02 17:47:48,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 17:47:48,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 17:47:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:48,203 INFO L225 Difference]: With dead ends: 129 [2023-12-02 17:47:48,203 INFO L226 Difference]: Without dead ends: 129 [2023-12-02 17:47:48,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-12-02 17:47:48,204 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:48,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 276 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:47:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-02 17:47:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2023-12-02 17:47:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 98 states have internal predecessors, (120), 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 17:47:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-12-02 17:47:48,209 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 20 [2023-12-02 17:47:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:48,209 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-12-02 17:47:48,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-12-02 17:47:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 17:47:48,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:48,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:48,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 17:47:48,211 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:48,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:48,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2083626248, now seen corresponding path program 1 times [2023-12-02 17:47:48,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:48,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510750539] [2023-12-02 17:47:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:48,265 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 17:47:48,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:48,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510750539] [2023-12-02 17:47:48,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510750539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:48,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:48,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:47:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119991801] [2023-12-02 17:47:48,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:48,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:47:48,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:48,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:47:48,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:47:48,267 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:48,360 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2023-12-02 17:47:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:47:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 17:47:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:48,361 INFO L225 Difference]: With dead ends: 99 [2023-12-02 17:47:48,361 INFO L226 Difference]: Without dead ends: 99 [2023-12-02 17:47:48,361 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 17:47:48,362 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 53 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:48,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 67 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:47:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-02 17:47:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2023-12-02 17:47:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 97 states have internal predecessors, (118), 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 17:47:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-12-02 17:47:48,366 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 20 [2023-12-02 17:47:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:48,366 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-12-02 17:47:48,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-12-02 17:47:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 17:47:48,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:48,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:48,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 17:47:48,368 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:48,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:48,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2083626249, now seen corresponding path program 1 times [2023-12-02 17:47:48,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:48,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795599624] [2023-12-02 17:47:48,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:48,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:48,989 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 17:47:48,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:48,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795599624] [2023-12-02 17:47:48,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795599624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:47:48,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:47:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-02 17:47:48,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784449341] [2023-12-02 17:47:48,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:47:48,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 17:47:48,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:47:48,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 17:47:48,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:47:48,991 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:47:49,405 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2023-12-02 17:47:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 17:47:49,406 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 17:47:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:47:49,407 INFO L225 Difference]: With dead ends: 141 [2023-12-02 17:47:49,407 INFO L226 Difference]: Without dead ends: 141 [2023-12-02 17:47:49,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-12-02 17:47:49,408 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 181 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:47:49,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 324 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:47:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-02 17:47:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2023-12-02 17:47:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 100 states have internal predecessors, (121), 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 17:47:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2023-12-02 17:47:49,413 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 20 [2023-12-02 17:47:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:47:49,413 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2023-12-02 17:47:49,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:47:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2023-12-02 17:47:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 17:47:49,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:47:49,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:47:49,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-02 17:47:49,415 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:47:49,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:47:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2083631829, now seen corresponding path program 1 times [2023-12-02 17:47:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:47:49,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340858845] [2023-12-02 17:47:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:47:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:47:50,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:47:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340858845] [2023-12-02 17:47:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340858845] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:47:50,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908518343] [2023-12-02 17:47:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:47:50,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:47:50,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:47:50,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:47:50,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:47:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:47:50,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 17:47:50,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:47:50,582 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 17:47:50,583 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 19 treesize of output 18 [2023-12-02 17:47:50,662 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-12-02 17:47:50,663 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 4 case distinctions, treesize of input 26 treesize of output 41 [2023-12-02 17:47:50,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 17:47:50,737 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 45 treesize of output 25 [2023-12-02 17:47:51,084 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:47:51,085 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 93 treesize of output 76 [2023-12-02 17:47:51,096 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 17:47:51,193 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-12-02 17:47:51,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 61 [2023-12-02 17:47:51,204 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 38 treesize of output 25 [2023-12-02 17:47:51,469 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 17:47:51,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 94 [2023-12-02 17:47:51,483 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 38 treesize of output 25 [2023-12-02 17:47:51,535 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 17:47:51,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 89 [2023-12-02 17:47:51,546 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 38 treesize of output 25 [2023-12-02 17:47:51,732 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 29 treesize of output 21 [2023-12-02 17:47:51,945 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-12-02 17:47:51,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 32 [2023-12-02 17:47:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:47:52,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:47:52,264 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_781 (Array Int Int)) (v_ArrVal_784 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_782) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_784))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_781) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_783) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))) 1)) is different from false [2023-12-02 17:47:52,427 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_784 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_784))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_783) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) 1)) is different from false [2023-12-02 17:47:52,441 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_784 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_784))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_779) .cse2 v_ArrVal_783) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))))) 1)) is different from false [2023-12-02 17:47:52,460 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_776 (Array Int Int)) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_784 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_776))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_784))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_777) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_779) .cse2 v_ArrVal_783) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))))) 1)) is different from false [2023-12-02 17:47:52,479 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_776 (Array Int Int)) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_784 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_776))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_784))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_777) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_779) .cse2 v_ArrVal_783) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4)))))) 1)) is different from false [2023-12-02 17:47:52,498 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (v_ArrVal_776 (Array Int Int)) (v_ArrVal_779 (Array Int Int)) (v_ArrVal_784 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_776))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_784))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_777) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_779) .cse2 v_ArrVal_783) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))))))) 1)) is different from false [2023-12-02 17:47:52,507 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 1258 treesize of output 1098 [2023-12-02 17:47:52,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:47:52,517 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 520 treesize of output 336 [2023-12-02 17:47:52,527 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 160 treesize of output 158 [2023-12-02 17:47:52,536 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 161 treesize of output 157 [2023-12-02 17:47:52,794 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse5 (select .cse31 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse7 (= .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse19 (not .cse7)) (.cse6 (select .cse31 .cse4))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse1 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_784)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse0 (+ 4 v_arrayElimCell_23))) 1) (= (select |c_#valid| (select .cse0 .cse1)) 1) (= (select |c_#valid| (select .cse0 (+ 4 v_arrayElimCell_22))) 1)))) (not (= (select v_arrayElimArr_1 .cse1) .cse6))))) (or .cse7 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_784)))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (.cse9 (+ 4 v_arrayElimCell_21))) (or (= (select |c_#valid| (select .cse8 (+ 4 v_arrayElimCell_23))) 1) (= (select |c_#valid| (select .cse8 .cse9)) 1) (not (= (select v_arrayElimArr_1 .cse9) .cse6)))))) (or .cse7 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_784 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse15 (+ 4 v_arrayElimCell_21)) (.cse14 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (= (select |c_#valid| (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_784))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) .cse15)) 1) (not (= (select v_arrayElimArr_1 .cse15) .cse6)) (= .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse6)) (= (select |c_#valid| (select (let ((.cse16 (store .cse17 .cse18 v_ArrVal_784))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 v_arrayElimCell_22))) 1) (= .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) .cse19) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (forall ((v_arrayElimCell_21 Int)) (let ((.cse21 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse20 (let ((.cse22 (store .cse23 .cse24 v_ArrVal_784))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse20 .cse21)) 1) (= (select |c_#valid| (select .cse20 (+ 4 v_arrayElimCell_22))) 1)))) (not (= (select v_arrayElimArr_1 .cse21) .cse6))))) (= .cse24 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse25 (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_784)))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse25 (+ 4 v_arrayElimCell_23))) 1) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse6)) (= (select |c_#valid| (select .cse25 (+ 4 v_arrayElimCell_22))) 1)))) .cse19) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse30 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse28 (select (select .cse30 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (not (= .cse28 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse6)) (forall ((v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select |c_#valid| (select (let ((.cse29 (store .cse30 .cse28 v_ArrVal_784))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 v_arrayElimCell_23))) 1))))))))))) is different from false [2023-12-02 17:47:52,978 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse5 (select .cse31 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse3 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse11 (= .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse6 (not .cse11)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse31 .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (and (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store .cse4 .cse5 v_arrayElimArr_1))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3) v_ArrVal_784)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse0 (+ 4 v_arrayElimCell_23))) 1) (= (select |c_#valid| (select .cse0 (+ 4 v_arrayElimCell_22))) 1) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) .cse6) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store .cse4 .cse5 v_arrayElimArr_1))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3) v_ArrVal_784)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (.cse8 (+ 4 v_arrayElimCell_21))) (or (= (select |c_#valid| (select .cse7 .cse8)) 1) (= (select |c_#valid| (select .cse7 (+ 4 v_arrayElimCell_23))) 1) (not (= (select v_arrayElimArr_1 .cse8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) .cse11) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse14 (store .cse4 .cse5 v_arrayElimArr_1))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (or (= .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (= (select |c_#valid| (select (let ((.cse13 (store .cse14 .cse12 v_ArrVal_784))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 v_arrayElimCell_22))) 1) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) .cse6) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse17 (store .cse4 .cse5 v_arrayElimArr_1))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (or (not (= .cse15 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select |c_#valid| (select (let ((.cse16 (store .cse17 .cse15 v_ArrVal_784))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 v_arrayElimCell_23))) 1)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_784 (Array Int Int))) (let ((.cse20 (store .cse4 .cse5 v_arrayElimArr_1))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3)) (.cse21 (+ 4 v_arrayElimCell_21))) (or (= .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (= (select |c_#valid| (select (let ((.cse19 (store .cse20 .cse18 v_ArrVal_784))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) .cse21)) 1) (not (= (select v_arrayElimArr_1 .cse21) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) .cse11) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse23 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse22 (let ((.cse24 (let ((.cse25 (store .cse4 .cse5 v_arrayElimArr_1))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3) v_ArrVal_784)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse22 .cse23)) 1) (= (select |c_#valid| (select .cse22 (+ 4 v_arrayElimCell_23))) 1) (= (select |c_#valid| (select .cse22 (+ 4 v_arrayElimCell_22))) 1)))) (not (= (select v_arrayElimArr_1 .cse23) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse30 (store .cse4 .cse5 v_arrayElimArr_1))) (let ((.cse26 (select (select .cse30 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (or (= .cse26 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_arrayElimCell_21 Int)) (let ((.cse28 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_784 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse27 (let ((.cse29 (store .cse30 .cse26 v_ArrVal_784))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse27 .cse28)) 1) (= (select |c_#valid| (select .cse27 (+ 4 v_arrayElimCell_22))) 1)))) (not (= (select v_arrayElimArr_1 .cse28) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))))))))))) is different from false [2023-12-02 17:47:53,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:47:53,118 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 2 case distinctions, treesize of input 1379 treesize of output 722 [2023-12-02 17:49:05,554 WARN L293 SmtUtils]: Spent 1.20m on a formula simplification. DAG size of input: 2411 DAG size of output: 1583 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 17:49:05,555 INFO L349 Elim1Store]: treesize reduction 3612, result has 60.7 percent of original size [2023-12-02 17:49:05,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 38 select indices, 38 select index equivalence classes, 0 disjoint index pairs (out of 703 index pairs), introduced 39 new quantified variables, introduced 703 case distinctions, treesize of input 44838 treesize of output 40102 [2023-12-02 17:49:13,384 WARN L293 SmtUtils]: Spent 7.82s on a formula simplification. DAG size of input: 2728 DAG size of output: 2119 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 17:49:16,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:16,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 10415 treesize of output 9349 [2023-12-02 17:49:19,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:19,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9397 treesize of output 9019 [2023-12-02 17:49:22,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:22,491 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 8511 treesize of output 8461 [2023-12-02 17:49:25,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:25,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 8501 treesize of output 8453 [2023-12-02 17:49:28,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:28,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 8763 treesize of output 8495 [2023-12-02 17:49:31,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:31,523 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 8543 treesize of output 8411 [2023-12-02 17:49:34,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:34,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 8171 treesize of output 8051 [2023-12-02 17:49:37,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:37,848 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 8057 treesize of output 8007 [2023-12-02 17:49:40,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:40,657 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 8047 treesize of output 8001 [2023-12-02 17:49:43,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:43,442 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 8041 treesize of output 7967 [2023-12-02 17:49:46,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:46,424 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 8295 treesize of output 8147 [2023-12-02 17:49:49,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:49,480 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 8211 treesize of output 8123 [2023-12-02 17:49:52,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:52,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 8179 treesize of output 7949 [2023-12-02 17:49:56,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:49:56,177 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 7963 treesize of output 7855 [2023-12-02 17:57:17,953 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:17,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-12-02 17:57:17,955 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:17,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [935424067] [2023-12-02 17:57:17,974 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 17:57:17,974 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:57:17,978 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:57:17,983 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:57:17,983 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:57:18,016 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:18,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:57:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2023-12-02 17:57:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757188195] [2023-12-02 17:57:18,019 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-02 17:57:18,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 17:57:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:57:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 17:57:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1116, Unknown=52, NotChecked=600, Total=1892 [2023-12-02 17:57:18,021 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:18,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=124, Invalid=1116, Unknown=52, NotChecked=600, Total=1892 [2023-12-02 17:57:18,024 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 17:57:18,024 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 17:57:18,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-02 17:57:18,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:57:18,225 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_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:18,227 INFO L158 Benchmark]: Toolchain (without parser) took 580724.02ms. Allocated memory was 132.1MB in the beginning and 362.8MB in the end (delta: 230.7MB). Free memory was 85.0MB in the beginning and 129.1MB in the end (delta: -44.1MB). Peak memory consumption was 188.7MB. Max. memory is 16.1GB. [2023-12-02 17:57:18,228 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 132.1MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:57:18,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.81ms. Allocated memory is still 132.1MB. Free memory was 84.6MB in the beginning and 67.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 17:57:18,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.45ms. Allocated memory is still 132.1MB. Free memory was 67.2MB in the beginning and 64.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:57:18,229 INFO L158 Benchmark]: Boogie Preprocessor took 34.19ms. Allocated memory is still 132.1MB. Free memory was 64.7MB in the beginning and 63.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:57:18,229 INFO L158 Benchmark]: RCFGBuilder took 654.17ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 63.1MB in the beginning and 128.3MB in the end (delta: -65.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2023-12-02 17:57:18,230 INFO L158 Benchmark]: TraceAbstraction took 579603.43ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 127.3MB in the beginning and 129.1MB in the end (delta: -1.8MB). Peak memory consumption was 186.9MB. Max. memory is 16.1GB. [2023-12-02 17:57:18,231 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.23ms. Allocated memory is still 132.1MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.81ms. Allocated memory is still 132.1MB. Free memory was 84.6MB in the beginning and 67.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.45ms. Allocated memory is still 132.1MB. Free memory was 67.2MB in the beginning and 64.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.19ms. Allocated memory is still 132.1MB. Free memory was 64.7MB in the beginning and 63.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 654.17ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 63.1MB in the beginning and 128.3MB in the end (delta: -65.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * TraceAbstraction took 579603.43ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 127.3MB in the beginning and 129.1MB in the end (delta: -1.8MB). Peak memory consumption was 186.9MB. 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_9839da00-de55-4c73-87ef-e60b7e8c791e/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_9839da00-de55-4c73-87ef-e60b7e8c791e/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_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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_9839da00-de55-4c73-87ef-e60b7e8c791e/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 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:57:20,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:57:20,286 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 17:57:20,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:57:20,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:57:20,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:57:20,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:57:20,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:57:20,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:57:20,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:57:20,330 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:57:20,330 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:57:20,331 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:57:20,332 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:57:20,332 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:57:20,333 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:57:20,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 17:57:20,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 17:57:20,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:57:20,336 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:57:20,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:57:20,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:57:20,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:57:20,339 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 17:57:20,339 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 17:57:20,340 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 17:57:20,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:57:20,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:57:20,341 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 17:57:20,341 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 17:57:20,342 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 17:57:20,342 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:57:20,343 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:57:20,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:57:20,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 17:57:20,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:57:20,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:57:20,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:57:20,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:57:20,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:57:20,345 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 17:57:20,345 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 17:57:20,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:57:20,346 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:57:20,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:57:20,346 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_9839da00-de55-4c73-87ef-e60b7e8c791e/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_9839da00-de55-4c73-87ef-e60b7e8c791e/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 -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2023-12-02 17:57:20,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:57:20,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:57:20,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:57:20,699 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:57:20,700 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:57:20,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2023-12-02 17:57:24,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:57:24,347 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:57:24,348 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2023-12-02 17:57:24,366 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/data/e8e842dc9/7187ddf3ab02418f822b827cd238384f/FLAG47ef9fbe8 [2023-12-02 17:57:24,384 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/data/e8e842dc9/7187ddf3ab02418f822b827cd238384f [2023-12-02 17:57:24,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:57:24,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:57:24,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:57:24,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:57:24,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:57:24,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:24,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13498af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24, skipping insertion in model container [2023-12-02 17:57:24,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:24,455 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:57:24,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:57:24,812 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:57:24,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:57:24,904 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:57:24,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24 WrapperNode [2023-12-02 17:57:24,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:57:24,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:57:24,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:57:24,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:57:24,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:24,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:24,968 INFO L138 Inliner]: procedures = 128, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2023-12-02 17:57:24,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:57:24,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:57:24,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:57:24,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:57:24,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:24,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:24,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:24,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:25,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:25,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:25,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:25,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:25,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:57:25,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:57:25,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:57:25,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:57:25,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (1/1) ... [2023-12-02 17:57:25,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:57:25,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:57:25,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:57:25,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:57:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:57:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:57:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 17:57:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 17:57:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:57:25,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 17:57:25,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:57:25,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:57:25,261 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:57:25,264 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:57:25,987 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:57:26,062 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:57:26,063 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 17:57:26,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:57:26 BoogieIcfgContainer [2023-12-02 17:57:26,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:57:26,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:57:26,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:57:26,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:57:26,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:57:24" (1/3) ... [2023-12-02 17:57:26,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33662ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:57:26, skipping insertion in model container [2023-12-02 17:57:26,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:24" (2/3) ... [2023-12-02 17:57:26,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33662ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:57:26, skipping insertion in model container [2023-12-02 17:57:26,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:57:26" (3/3) ... [2023-12-02 17:57:26,076 INFO L112 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2023-12-02 17:57:26,099 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:57:26,099 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2023-12-02 17:57:26,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:57:26,168 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;@607b1a4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:57:26,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2023-12-02 17:57:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 114 states have internal predecessors, (125), 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 17:57:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 17:57:26,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:26,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 17:57:26,182 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:26,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash 7413, now seen corresponding path program 1 times [2023-12-02 17:57:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:26,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862980729] [2023-12-02 17:57:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:26,206 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 17:57:26,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:26,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:26,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:26,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:57:26,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:26,438 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 17:57:26,439 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-12-02 17:57:26,469 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 17:57:26,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:26,470 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:26,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862980729] [2023-12-02 17:57:26,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862980729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:26,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:26,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 17:57:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647655912] [2023-12-02 17:57:26,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:26,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:57:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:26,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:57:26,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:57:26,517 INFO L87 Difference]: Start difference. First operand has 115 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 114 states have internal predecessors, (125), 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) 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 17:57:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:26,952 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2023-12-02 17:57:26,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:57:26,955 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 17:57:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:26,963 INFO L225 Difference]: With dead ends: 108 [2023-12-02 17:57:26,963 INFO L226 Difference]: Without dead ends: 107 [2023-12-02 17:57:26,965 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 17:57:26,969 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:26,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 123 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:57:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-02 17:57:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-02 17:57:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 49 states have (on average 2.306122448979592) internal successors, (113), 106 states have internal predecessors, (113), 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 17:57:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2023-12-02 17:57:27,016 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 2 [2023-12-02 17:57:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:27,016 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2023-12-02 17:57:27,016 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 17:57:27,017 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2023-12-02 17:57:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 17:57:27,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:27,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 17:57:27,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:27,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:27,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:27,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:27,221 INFO L85 PathProgramCache]: Analyzing trace with hash 7414, now seen corresponding path program 1 times [2023-12-02 17:57:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:27,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524341992] [2023-12-02 17:57:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:27,223 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 17:57:27,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:27,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:27,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:27,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 17:57:27,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:27,316 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 17:57:27,317 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 1 case distinctions, treesize of input 9 treesize of output 11 [2023-12-02 17:57:27,340 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 17:57:27,341 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:27,341 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:27,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524341992] [2023-12-02 17:57:27,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524341992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:27,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:27,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 17:57:27,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434088491] [2023-12-02 17:57:27,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:27,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:57:27,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:57:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:57:27,345 INFO L87 Difference]: Start difference. First operand 107 states and 113 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 17:57:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:27,804 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-12-02 17:57:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:57:27,805 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 17:57:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:27,807 INFO L225 Difference]: With dead ends: 100 [2023-12-02 17:57:27,808 INFO L226 Difference]: Without dead ends: 100 [2023-12-02 17:57:27,808 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 17:57:27,810 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:27,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 127 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:57:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-02 17:57:27,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-12-02 17:57:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 49 states have (on average 2.163265306122449) internal successors, (106), 99 states have internal predecessors, (106), 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 17:57:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2023-12-02 17:57:27,823 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 2 [2023-12-02 17:57:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:27,823 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2023-12-02 17:57:27,823 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 17:57:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2023-12-02 17:57:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 17:57:27,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:27,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:27,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:28,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:28,028 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:28,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash -708773178, now seen corresponding path program 1 times [2023-12-02 17:57:28,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:28,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316541374] [2023-12-02 17:57:28,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:28,030 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 17:57:28,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:28,031 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:28,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:28,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 17:57:28,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:28,200 INFO L349 Elim1Store]: treesize reduction 30, result has 31.8 percent of original size [2023-12-02 17:57:28,201 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 1 case distinctions, treesize of input 17 treesize of output 25 [2023-12-02 17:57:28,255 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-02 17:57:28,256 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 22 [2023-12-02 17:57:28,331 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 17:57:28,388 INFO L349 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2023-12-02 17:57:28,388 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 3 case distinctions, treesize of input 34 treesize of output 63 [2023-12-02 17:57:28,525 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 56 treesize of output 36 [2023-12-02 17:57:28,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:57:28,681 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 57 treesize of output 33 [2023-12-02 17:57:28,733 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 17:57:28,734 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:28,734 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316541374] [2023-12-02 17:57:28,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316541374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:28,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:28,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:57:28,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816255843] [2023-12-02 17:57:28,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:28,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:57:28,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:28,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:57:28,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:57:28,738 INFO L87 Difference]: Start difference. First operand 100 states and 106 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 17:57:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:29,694 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2023-12-02 17:57:29,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:57:29,695 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 17:57:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:29,696 INFO L225 Difference]: With dead ends: 99 [2023-12-02 17:57:29,697 INFO L226 Difference]: Without dead ends: 99 [2023-12-02 17:57:29,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:57:29,699 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:29,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 17:57:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-02 17:57:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-02 17:57:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 49 states have (on average 2.142857142857143) internal successors, (105), 98 states have internal predecessors, (105), 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 17:57:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2023-12-02 17:57:29,710 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 7 [2023-12-02 17:57:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:29,710 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2023-12-02 17:57:29,711 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 17:57:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2023-12-02 17:57:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 17:57:29,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:29,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:29,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:29,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:29,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:29,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash -708773177, now seen corresponding path program 1 times [2023-12-02 17:57:29,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:29,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238447618] [2023-12-02 17:57:29,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:29,914 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 17:57:29,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:29,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:29,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:30,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 17:57:30,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:30,028 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 11 treesize of output 5 [2023-12-02 17:57:30,041 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 17:57:30,074 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 17:57:30,097 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-02 17:57:30,098 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 16 treesize of output 18 [2023-12-02 17:57:30,116 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 17:57:30,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 17:57:30,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 17:57:30,269 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2023-12-02 17:57:30,319 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 17:57:30,319 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:30,319 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238447618] [2023-12-02 17:57:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238447618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:57:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11862399] [2023-12-02 17:57:30,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:30,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:57:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:30,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:57:30,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:57:30,322 INFO L87 Difference]: Start difference. First operand 99 states and 105 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 17:57:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:31,276 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-12-02 17:57:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:57:31,277 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 17:57:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:31,278 INFO L225 Difference]: With dead ends: 98 [2023-12-02 17:57:31,279 INFO L226 Difference]: Without dead ends: 98 [2023-12-02 17:57:31,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:57:31,280 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 5 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:31,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 286 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 17:57:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-02 17:57:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-02 17:57:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 49 states have (on average 2.122448979591837) internal successors, (104), 97 states have internal predecessors, (104), 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 17:57:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2023-12-02 17:57:31,289 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 7 [2023-12-02 17:57:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:31,290 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2023-12-02 17:57:31,290 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 17:57:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2023-12-02 17:57:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 17:57:31,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:31,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:31,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:31,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:31,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:31,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash -497132045, now seen corresponding path program 1 times [2023-12-02 17:57:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:31,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828558624] [2023-12-02 17:57:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:31,493 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 17:57:31,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:31,511 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:31,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:31,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:57:31,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:31,610 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 15 treesize of output 7 [2023-12-02 17:57:31,632 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 17:57:31,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:31,633 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:31,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828558624] [2023-12-02 17:57:31,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828558624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:31,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:31,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:57:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829570990] [2023-12-02 17:57:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:31,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:57:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:31,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:57:31,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:57:31,635 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 17:57:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:32,114 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2023-12-02 17:57:32,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:57:32,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2023-12-02 17:57:32,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:32,115 INFO L225 Difference]: With dead ends: 97 [2023-12-02 17:57:32,115 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 17:57:32,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:57:32,117 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 5 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:32,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 282 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:57:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 17:57:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-02 17:57:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 96 states have internal predecessors, (103), 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 17:57:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2023-12-02 17:57:32,125 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 8 [2023-12-02 17:57:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:32,125 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2023-12-02 17:57:32,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 17:57:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2023-12-02 17:57:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 17:57:32,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:32,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:32,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:32,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:32,327 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:32,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash -497132044, now seen corresponding path program 1 times [2023-12-02 17:57:32,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:32,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130816315] [2023-12-02 17:57:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:32,328 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 17:57:32,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:32,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:32,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:32,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 17:57:32,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:32,455 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 17:57:32,469 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 11 treesize of output 5 [2023-12-02 17:57:32,503 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 17:57:32,521 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-02 17:57:32,521 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 16 treesize of output 18 [2023-12-02 17:57:32,533 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 17:57:32,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 17:57:32,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-02 17:57:32,634 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 7 treesize of output 3 [2023-12-02 17:57:32,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:57:32,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 28 treesize of output 14 [2023-12-02 17:57:32,753 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 17:57:32,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:32,754 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:32,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130816315] [2023-12-02 17:57:32,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130816315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:32,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:32,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:57:32,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432207117] [2023-12-02 17:57:32,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:32,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 17:57:32,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:32,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 17:57:32,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:57:32,756 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 17:57:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:33,783 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2023-12-02 17:57:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:57:33,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2023-12-02 17:57:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:33,785 INFO L225 Difference]: With dead ends: 96 [2023-12-02 17:57:33,785 INFO L226 Difference]: Without dead ends: 96 [2023-12-02 17:57:33,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:57:33,787 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:33,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 282 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 17:57:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-02 17:57:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-02 17:57:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 95 states have internal predecessors, (102), 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 17:57:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2023-12-02 17:57:33,793 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 8 [2023-12-02 17:57:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:33,793 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2023-12-02 17:57:33,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 17:57:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2023-12-02 17:57:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 17:57:33,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:33,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:33,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:33,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:33,995 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:33,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1008275651, now seen corresponding path program 1 times [2023-12-02 17:57:33,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:33,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044791694] [2023-12-02 17:57:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:33,996 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 17:57:33,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:33,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:33,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:34,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 17:57:34,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:34,120 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 17:57:34,139 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 17:57:34,149 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 17:57:34,180 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 28 treesize of output 12 [2023-12-02 17:57:34,356 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:34,356 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 45 treesize of output 42 [2023-12-02 17:57:34,390 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:34,390 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 38 treesize of output 37 [2023-12-02 17:57:34,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:57:34,416 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 31 treesize of output 15 [2023-12-02 17:57:34,435 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 17:57:34,435 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:34,435 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:34,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044791694] [2023-12-02 17:57:34,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044791694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:34,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:34,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 17:57:34,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336964671] [2023-12-02 17:57:34,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:34,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 17:57:34,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:34,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 17:57:34,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:57:34,437 INFO L87 Difference]: Start difference. First operand 96 states and 102 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 17:57:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:35,211 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2023-12-02 17:57:35,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 17:57:35,212 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 17:57:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:35,213 INFO L225 Difference]: With dead ends: 95 [2023-12-02 17:57:35,213 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 17:57:35,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:57:35,214 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:35,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 331 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 17:57:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 17:57:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-02 17:57:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 49 states have (on average 2.061224489795918) internal successors, (101), 94 states have internal predecessors, (101), 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 17:57:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2023-12-02 17:57:35,222 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 11 [2023-12-02 17:57:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:35,222 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2023-12-02 17:57:35,222 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 17:57:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2023-12-02 17:57:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 17:57:35,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:35,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:35,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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)] Forceful destruction successful, exit code 0 [2023-12-02 17:57:35,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:35,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:35,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1008275650, now seen corresponding path program 1 times [2023-12-02 17:57:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:35,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806405693] [2023-12-02 17:57:35,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:35,425 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 17:57:35,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:35,426 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:35,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:35,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 17:57:35,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:35,564 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 17:57:35,590 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 17:57:35,597 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 17:57:35,635 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 12 [2023-12-02 17:57:35,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 17:57:35,848 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:35,848 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 57 treesize of output 50 [2023-12-02 17:57:35,864 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 17:57:35,908 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:35,908 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 17:57:35,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 17:57:35,960 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 17:57:35,988 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 17:57:35,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:35,988 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806405693] [2023-12-02 17:57:35,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806405693] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:35,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:35,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 17:57:35,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778604270] [2023-12-02 17:57:35,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:35,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 17:57:35,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:35,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 17:57:35,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:57:35,990 INFO L87 Difference]: Start difference. First operand 95 states and 101 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 17:57:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:36,927 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2023-12-02 17:57:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 17:57:36,927 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 17:57:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:36,928 INFO L225 Difference]: With dead ends: 94 [2023-12-02 17:57:36,928 INFO L226 Difference]: Without dead ends: 94 [2023-12-02 17:57:36,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:57:36,930 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:36,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 347 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 17:57:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-02 17:57:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-02 17:57:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 93 states have internal predecessors, (100), 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 17:57:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2023-12-02 17:57:36,937 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 11 [2023-12-02 17:57:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:36,937 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2023-12-02 17:57:36,937 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 17:57:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2023-12-02 17:57:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 17:57:36,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:36,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:36,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-02 17:57:37,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:37,139 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:37,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:37,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1191774103, now seen corresponding path program 1 times [2023-12-02 17:57:37,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:37,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646165891] [2023-12-02 17:57:37,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:37,140 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 17:57:37,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:37,141 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:37,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:37,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:57:37,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:37,254 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 7 [2023-12-02 17:57:37,274 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 17:57:37,274 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:37,275 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:37,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646165891] [2023-12-02 17:57:37,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646165891] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:37,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:37,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:57:37,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072264350] [2023-12-02 17:57:37,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:37,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:57:37,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:37,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:57:37,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:57:37,276 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 17:57:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:37,745 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2023-12-02 17:57:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:57:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-12-02 17:57:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:37,747 INFO L225 Difference]: With dead ends: 93 [2023-12-02 17:57:37,747 INFO L226 Difference]: Without dead ends: 93 [2023-12-02 17:57:37,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:57:37,748 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:37,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 270 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:57:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-02 17:57:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-02 17:57:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 49 states have (on average 2.020408163265306) internal successors, (99), 92 states have internal predecessors, (99), 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 17:57:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2023-12-02 17:57:37,753 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 12 [2023-12-02 17:57:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:37,753 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2023-12-02 17:57:37,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 17:57:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2023-12-02 17:57:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 17:57:37,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:37,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:37,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:37,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:37,955 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:37,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:37,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1191774102, now seen corresponding path program 1 times [2023-12-02 17:57:37,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:37,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987859924] [2023-12-02 17:57:37,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:37,956 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 17:57:37,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:37,957 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:37,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:38,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 17:57:38,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:38,121 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 17:57:38,153 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 17:57:38,162 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 17:57:38,196 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 12 [2023-12-02 17:57:38,205 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 17:57:38,396 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:38,397 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 57 treesize of output 50 [2023-12-02 17:57:38,407 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 17:57:38,453 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:38,454 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 17:57:38,464 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 17:57:38,483 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 17:57:38,517 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 17:57:38,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:38,518 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:38,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987859924] [2023-12-02 17:57:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987859924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:38,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:38,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 17:57:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641487992] [2023-12-02 17:57:38,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:38,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 17:57:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 17:57:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:57:38,519 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 17:57:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:39,313 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2023-12-02 17:57:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 17:57:39,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2023-12-02 17:57:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:39,315 INFO L225 Difference]: With dead ends: 92 [2023-12-02 17:57:39,315 INFO L226 Difference]: Without dead ends: 92 [2023-12-02 17:57:39,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:57:39,316 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 2 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:39,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 294 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 17:57:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-02 17:57:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-02 17:57:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 2.0) internal successors, (98), 91 states have internal predecessors, (98), 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 17:57:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2023-12-02 17:57:39,321 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 12 [2023-12-02 17:57:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:39,322 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2023-12-02 17:57:39,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 17:57:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2023-12-02 17:57:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 17:57:39,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:39,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:39,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:39,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:39,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:39,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1937523427, now seen corresponding path program 1 times [2023-12-02 17:57:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:39,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032710754] [2023-12-02 17:57:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:39,525 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 17:57:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:39,526 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:39,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:39,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 17:57:39,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:39,691 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 17:57:39,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:39,691 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:39,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032710754] [2023-12-02 17:57:39,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032710754] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:39,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:39,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:57:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901619453] [2023-12-02 17:57:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:39,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:57:39,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:39,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:57:39,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:57:39,693 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 17:57:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:40,117 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2023-12-02 17:57:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:57:40,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2023-12-02 17:57:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:40,119 INFO L225 Difference]: With dead ends: 118 [2023-12-02 17:57:40,119 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 17:57:40,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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 17:57:40,120 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 127 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:40,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 113 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:57:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 17:57:40,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2023-12-02 17:57:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 89 states have internal predecessors, (96), 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 17:57:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-12-02 17:57:40,123 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 15 [2023-12-02 17:57:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:40,123 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-12-02 17:57:40,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 17:57:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-12-02 17:57:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 17:57:40,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:40,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:40,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:40,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:40,332 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:40,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1937523426, now seen corresponding path program 1 times [2023-12-02 17:57:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93623181] [2023-12-02 17:57:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:40,333 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 17:57:40,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:40,335 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:40,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 17:57:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:40,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 17:57:40,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:40,552 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 17:57:40,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:40,553 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:40,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93623181] [2023-12-02 17:57:40,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93623181] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:40,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:40,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:57:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978042209] [2023-12-02 17:57:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:40,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:57:40,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:57:40,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:57:40,555 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17:57:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:41,018 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2023-12-02 17:57:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:57:41,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2023-12-02 17:57:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:41,020 INFO L225 Difference]: With dead ends: 88 [2023-12-02 17:57:41,020 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 17:57:41,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:57:41,021 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 126 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:41,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 109 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:57:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 17:57:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-02 17:57:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 87 states have internal predecessors, (94), 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 17:57:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-12-02 17:57:41,023 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2023-12-02 17:57:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:41,024 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-12-02 17:57:41,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17:57:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-12-02 17:57:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:57:41,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:41,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:41,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 17:57:41,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:41,225 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:41,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:41,226 INFO L85 PathProgramCache]: Analyzing trace with hash 66317052, now seen corresponding path program 1 times [2023-12-02 17:57:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:41,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839000891] [2023-12-02 17:57:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:41,226 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 17:57:41,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:41,228 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:41,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 17:57:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:41,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 17:57:41,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:41,382 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 17:57:41,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:41,383 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:41,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839000891] [2023-12-02 17:57:41,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839000891] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:41,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:41,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:57:41,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561203491] [2023-12-02 17:57:41,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:41,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:57:41,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:41,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:57:41,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:57:41,385 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:41,905 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2023-12-02 17:57:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:57:41,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:57:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:41,907 INFO L225 Difference]: With dead ends: 107 [2023-12-02 17:57:41,907 INFO L226 Difference]: Without dead ends: 107 [2023-12-02 17:57:41,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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 17:57:41,908 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 113 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:41,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 105 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 17:57:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-02 17:57:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2023-12-02 17:57:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.84) internal successors, (92), 84 states have internal predecessors, (92), 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 17:57:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-12-02 17:57:41,912 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2023-12-02 17:57:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:41,912 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-12-02 17:57:41,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-12-02 17:57:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:57:41,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:41,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:41,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-02 17:57:42,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:42,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:42,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash 66317053, now seen corresponding path program 1 times [2023-12-02 17:57:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515054744] [2023-12-02 17:57:42,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:42,115 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 17:57:42,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:42,116 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:42,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:42,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 17:57:42,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:42,350 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 17:57:42,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:42,350 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515054744] [2023-12-02 17:57:42,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515054744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:42,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:42,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:57:42,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44528353] [2023-12-02 17:57:42,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:42,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:57:42,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:42,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:57:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:57:42,352 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:42,879 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2023-12-02 17:57:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:57:42,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:57:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:42,881 INFO L225 Difference]: With dead ends: 80 [2023-12-02 17:57:42,881 INFO L226 Difference]: Without dead ends: 80 [2023-12-02 17:57:42,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:57:42,882 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 89 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:42,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 96 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 17:57:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-02 17:57:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-12-02 17:57:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.72) internal successors, (86), 79 states have internal predecessors, (86), 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 17:57:42,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-12-02 17:57:42,886 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 16 [2023-12-02 17:57:42,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:42,887 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-12-02 17:57:42,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 17:57:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-12-02 17:57:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:57:42,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:42,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:42,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:43,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:43,088 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:43,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:43,089 INFO L85 PathProgramCache]: Analyzing trace with hash 66320432, now seen corresponding path program 1 times [2023-12-02 17:57:43,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:43,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687242446] [2023-12-02 17:57:43,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:43,089 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 17:57:43,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:43,090 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:43,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 17:57:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:43,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 17:57:43,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:43,291 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 17:57:43,313 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:57:43,313 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 17:57:43,324 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 17:57:43,348 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 28 treesize of output 12 [2023-12-02 17:57:43,506 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:43,508 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 53 treesize of output 48 [2023-12-02 17:57:43,586 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:43,587 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 46 treesize of output 43 [2023-12-02 17:57:43,799 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:57:43,800 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 59 treesize of output 54 [2023-12-02 17:57:43,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:57:43,840 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 47 [2023-12-02 17:57:43,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:57:43,977 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 37 treesize of output 19 [2023-12-02 17:57:44,010 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 17:57:44,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:44,011 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687242446] [2023-12-02 17:57:44,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687242446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:44,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:44,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 17:57:44,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099786973] [2023-12-02 17:57:44,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:44,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:57:44,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:44,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:57:44,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:57:44,013 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:45,397 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2023-12-02 17:57:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 17:57:45,398 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:57:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:45,399 INFO L225 Difference]: With dead ends: 120 [2023-12-02 17:57:45,399 INFO L226 Difference]: Without dead ends: 120 [2023-12-02 17:57:45,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:57:45,400 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 140 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:45,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 232 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 17:57:45,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-02 17:57:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 80. [2023-12-02 17:57:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 79 states have internal predecessors, (88), 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 17:57:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-12-02 17:57:45,402 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 16 [2023-12-02 17:57:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:45,402 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-12-02 17:57:45,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-12-02 17:57:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:57:45,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:45,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:45,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-02 17:57:45,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:45,604 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:45,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash 66320433, now seen corresponding path program 1 times [2023-12-02 17:57:45,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:45,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283896518] [2023-12-02 17:57:45,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:45,605 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 17:57:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:45,606 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:45,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-02 17:57:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:45,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 17:57:45,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:45,828 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 17:57:45,842 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 17:57:45,852 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:57:45,852 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 17:57:45,880 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 28 treesize of output 12 [2023-12-02 17:57:45,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:57:46,119 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:46,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2023-12-02 17:57:46,133 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 52 treesize of output 33 [2023-12-02 17:57:46,283 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:46,284 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 81 treesize of output 72 [2023-12-02 17:57:46,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 52 [2023-12-02 17:57:46,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:57:46,815 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 83 treesize of output 74 [2023-12-02 17:57:46,834 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 64 treesize of output 39 [2023-12-02 17:57:46,894 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:57:46,894 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 74 treesize of output 67 [2023-12-02 17:57:46,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2023-12-02 17:57:47,336 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2023-12-02 17:57:47,349 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 47 treesize of output 23 [2023-12-02 17:57:47,499 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 17:57:47,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:47,499 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:47,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283896518] [2023-12-02 17:57:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283896518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:47,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:47,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 17:57:47,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112336697] [2023-12-02 17:57:47,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:47,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:57:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:47,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:57:47,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:57:47,501 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:50,900 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2023-12-02 17:57:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 17:57:50,901 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 17:57:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:50,902 INFO L225 Difference]: With dead ends: 130 [2023-12-02 17:57:50,902 INFO L226 Difference]: Without dead ends: 130 [2023-12-02 17:57:50,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:57:50,903 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 120 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:50,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 301 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 17:57:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-02 17:57:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 90. [2023-12-02 17:57:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.640625) internal successors, (105), 89 states have internal predecessors, (105), 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 17:57:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2023-12-02 17:57:50,906 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 16 [2023-12-02 17:57:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:50,907 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2023-12-02 17:57:50,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2023-12-02 17:57:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 17:57:50,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:50,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:50,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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)] Ended with exit code 0 [2023-12-02 17:57:51,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:51,108 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:51,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:51,109 INFO L85 PathProgramCache]: Analyzing trace with hash -33533053, now seen corresponding path program 1 times [2023-12-02 17:57:51,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:51,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611949380] [2023-12-02 17:57:51,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:51,109 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 17:57:51,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:51,110 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:51,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:51,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 17:57:51,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:57:51,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:51,306 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:51,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611949380] [2023-12-02 17:57:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611949380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:51,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:51,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:57:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564167482] [2023-12-02 17:57:51,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:51,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:57:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:57:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:57:51,308 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:51,613 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2023-12-02 17:57:51,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:57:51,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 17:57:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:51,616 INFO L225 Difference]: With dead ends: 89 [2023-12-02 17:57:51,616 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 17:57:51,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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 17:57:51,617 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 81 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:51,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 140 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:57:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 17:57:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-02 17:57:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.625) internal successors, (104), 88 states have internal predecessors, (104), 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 17:57:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2023-12-02 17:57:51,620 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 19 [2023-12-02 17:57:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:51,620 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2023-12-02 17:57:51,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2023-12-02 17:57:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 17:57:51,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:51,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:51,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:51,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:51,821 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:51,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:51,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1039448246, now seen corresponding path program 1 times [2023-12-02 17:57:51,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:51,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047389596] [2023-12-02 17:57:51,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:51,823 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 17:57:51,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:51,824 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:51,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:52,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 17:57:52,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:52,018 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 17:57:52,044 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 17:57:52,060 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:57:52,060 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 17:57:52,086 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 28 treesize of output 12 [2023-12-02 17:57:52,222 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:52,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2023-12-02 17:57:52,292 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:52,292 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 46 treesize of output 43 [2023-12-02 17:57:52,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:57:52,472 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 59 treesize of output 54 [2023-12-02 17:57:52,530 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:57:52,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2023-12-02 17:57:52,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:57:52,711 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 37 treesize of output 19 [2023-12-02 17:57:52,743 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 17:57:52,744 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:52,744 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:52,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047389596] [2023-12-02 17:57:52,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047389596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:52,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:52,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 17:57:52,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396340149] [2023-12-02 17:57:52,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:52,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:57:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:52,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:57:52,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:57:52,746 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:54,000 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2023-12-02 17:57:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 17:57:54,000 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 17:57:54,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:54,002 INFO L225 Difference]: With dead ends: 126 [2023-12-02 17:57:54,002 INFO L226 Difference]: Without dead ends: 126 [2023-12-02 17:57:54,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:57:54,003 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 48 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:54,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 253 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 17:57:54,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-02 17:57:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2023-12-02 17:57:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.6) internal successors, (112), 94 states have internal predecessors, (112), 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 17:57:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2023-12-02 17:57:54,006 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 20 [2023-12-02 17:57:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:54,006 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2023-12-02 17:57:54,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2023-12-02 17:57:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 17:57:54,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:54,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:54,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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)] Ended with exit code 0 [2023-12-02 17:57:54,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:54,207 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:54,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1039448245, now seen corresponding path program 1 times [2023-12-02 17:57:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:54,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736294360] [2023-12-02 17:57:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:54,208 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 17:57:54,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:54,209 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:54,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (20)] Waiting until timeout for monitored process [2023-12-02 17:57:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:54,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 17:57:54,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:54,438 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 17:57:54,454 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 17:57:54,468 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:57:54,468 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 17:57:54,497 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 28 treesize of output 12 [2023-12-02 17:57:54,695 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:54,696 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 73 treesize of output 64 [2023-12-02 17:57:54,712 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 52 treesize of output 33 [2023-12-02 17:57:54,880 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:57:54,880 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 81 treesize of output 72 [2023-12-02 17:57:54,891 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 75 treesize of output 52 [2023-12-02 17:57:55,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:57:55,404 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 83 treesize of output 74 [2023-12-02 17:57:55,419 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 64 treesize of output 39 [2023-12-02 17:57:55,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:57:55,484 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 74 treesize of output 67 [2023-12-02 17:57:55,493 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 64 treesize of output 39 [2023-12-02 17:57:56,052 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2023-12-02 17:57:56,059 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 47 treesize of output 23 [2023-12-02 17:57:56,205 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 17:57:56,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:57:56,205 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:57:56,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736294360] [2023-12-02 17:57:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736294360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:57:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:57:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 17:57:56,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042249365] [2023-12-02 17:57:56,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:57:56,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:57:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:57:56,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:57:56,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:57:56,207 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:57:59,413 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2023-12-02 17:57:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 17:57:59,414 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 17:57:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:57:59,415 INFO L225 Difference]: With dead ends: 121 [2023-12-02 17:57:59,415 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 17:57:59,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:57:59,417 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:57:59,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 329 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 17:57:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 17:57:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 95. [2023-12-02 17:57:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 94 states have internal predecessors, (111), 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 17:57:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2023-12-02 17:57:59,421 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 20 [2023-12-02 17:57:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:57:59,421 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2023-12-02 17:57:59,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:57:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2023-12-02 17:57:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:57:59,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:57:59,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:57:59,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (20)] Forceful destruction successful, exit code 0 [2023-12-02 17:57:59,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:59,623 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:57:59,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:57:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2134482098, now seen corresponding path program 1 times [2023-12-02 17:57:59,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:57:59,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362244671] [2023-12-02 17:57:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:57:59,624 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 17:57:59,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:57:59,625 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:57:59,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (21)] Waiting until timeout for monitored process [2023-12-02 17:57:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:57:59,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 17:57:59,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:57:59,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-12-02 17:57:59,847 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:57:59,847 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 17:57:59,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 17:57:59,886 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 36 treesize of output 16 [2023-12-02 17:58:00,061 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:00,062 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 17:58:00,097 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:00,098 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 43 treesize of output 40 [2023-12-02 17:58:00,242 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:58:00,243 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 56 treesize of output 51 [2023-12-02 17:58:00,279 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:58:00,280 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 47 treesize of output 44 [2023-12-02 17:58:00,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:00,414 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 34 treesize of output 16 [2023-12-02 17:58:00,443 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 17:58:00,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:58:00,443 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:58:00,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362244671] [2023-12-02 17:58:00,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362244671] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:58:00,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:58:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 17:58:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054695840] [2023-12-02 17:58:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:58:00,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 17:58:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:58:00,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 17:58:00,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:58:00,445 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 17:58:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:58:01,668 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2023-12-02 17:58:01,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 17:58:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:58:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:58:01,670 INFO L225 Difference]: With dead ends: 122 [2023-12-02 17:58:01,670 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 17:58:01,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:58:01,671 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:58:01,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 372 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 17:58:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 17:58:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2023-12-02 17:58:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 94 states have internal predecessors, (110), 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 17:58:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2023-12-02 17:58:01,676 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 21 [2023-12-02 17:58:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:58:01,676 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2023-12-02 17:58:01,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 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 17:58:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2023-12-02 17:58:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:58:01,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:58:01,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:58:01,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (21)] Ended with exit code 0 [2023-12-02 17:58:01,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:01,878 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:58:01,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:58:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash 152939461, now seen corresponding path program 1 times [2023-12-02 17:58:01,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:58:01,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395041084] [2023-12-02 17:58:01,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:01,879 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 17:58:01,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:58:01,880 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:01,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (22)] Waiting until timeout for monitored process [2023-12-02 17:58:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:02,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 17:58:02,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:02,034 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 17:58:02,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:58:02,034 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:58:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395041084] [2023-12-02 17:58:02,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395041084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:58:02,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:58:02,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:58:02,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284933778] [2023-12-02 17:58:02,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:58:02,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:58:02,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:58:02,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:58:02,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:58:02,036 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 17:58:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:58:02,438 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2023-12-02 17:58:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:58:02,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:58:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:58:02,440 INFO L225 Difference]: With dead ends: 95 [2023-12-02 17:58:02,440 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 17:58:02,440 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 17:58:02,441 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 58 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:58:02,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 73 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:58:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 17:58:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2023-12-02 17:58:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 93 states have internal predecessors, (110), 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 17:58:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2023-12-02 17:58:02,445 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 21 [2023-12-02 17:58:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:58:02,445 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2023-12-02 17:58:02,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 17:58:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2023-12-02 17:58:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:58:02,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:58:02,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:58:02,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (22)] Ended with exit code 0 [2023-12-02 17:58:02,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:02,647 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:58:02,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:58:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash 152939462, now seen corresponding path program 1 times [2023-12-02 17:58:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:58:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782110378] [2023-12-02 17:58:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:02,648 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 17:58:02,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:58:02,649 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:02,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (23)] Waiting until timeout for monitored process [2023-12-02 17:58:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:02,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 17:58:02,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:02,920 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 17:58:02,943 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:58:02,944 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 17:58:02,950 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 17:58:02,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:58:02,979 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 28 treesize of output 12 [2023-12-02 17:58:03,148 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:03,149 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 58 treesize of output 51 [2023-12-02 17:58:03,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 15 [2023-12-02 17:58:03,248 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:03,248 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 51 treesize of output 46 [2023-12-02 17:58:03,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 15 [2023-12-02 17:58:03,515 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:58:03,515 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 68 treesize of output 61 [2023-12-02 17:58:03,523 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 34 treesize of output 15 [2023-12-02 17:58:03,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:58:03,569 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 59 treesize of output 54 [2023-12-02 17:58:03,578 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 34 treesize of output 15 [2023-12-02 17:58:03,805 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2023-12-02 17:58:03,810 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 21 treesize of output 9 [2023-12-02 17:58:04,245 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 17:58:04,245 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:58:04,245 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:58:04,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782110378] [2023-12-02 17:58:04,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782110378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:58:04,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:58:04,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-02 17:58:04,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965388] [2023-12-02 17:58:04,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:58:04,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 17:58:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:58:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 17:58:04,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-02 17:58:04,247 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 17:58:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:58:07,996 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2023-12-02 17:58:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 17:58:07,997 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:58:07,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:58:07,998 INFO L225 Difference]: With dead ends: 145 [2023-12-02 17:58:07,998 INFO L226 Difference]: Without dead ends: 145 [2023-12-02 17:58:07,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2023-12-02 17:58:07,999 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 168 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:58:08,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 411 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-02 17:58:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-02 17:58:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 106. [2023-12-02 17:58:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 105 states have internal predecessors, (131), 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 17:58:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2023-12-02 17:58:08,004 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 21 [2023-12-02 17:58:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:58:08,004 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2023-12-02 17:58:08,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 17:58:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2023-12-02 17:58:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:58:08,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:58:08,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:58:08,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (23)] Ended with exit code 0 [2023-12-02 17:58:08,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:08,206 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:58:08,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:58:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 152945042, now seen corresponding path program 1 times [2023-12-02 17:58:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:58:08,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633509471] [2023-12-02 17:58:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:08,207 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 17:58:08,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:58:08,208 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:08,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (24)] Waiting until timeout for monitored process [2023-12-02 17:58:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:08,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-02 17:58:08,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:08,515 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 17:58:08,516 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 19 treesize of output 22 [2023-12-02 17:58:08,546 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 17:58:08,570 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 17:58:08,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 17:58:08,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 17:58:08,631 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 42 treesize of output 22 [2023-12-02 17:58:09,109 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:09,110 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 81 treesize of output 68 [2023-12-02 17:58:09,144 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 33 treesize of output 18 [2023-12-02 17:58:09,304 INFO L349 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2023-12-02 17:58:09,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 62 [2023-12-02 17:58:09,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2023-12-02 17:58:09,771 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-12-02 17:58:09,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 111 [2023-12-02 17:58:09,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2023-12-02 17:58:09,887 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-12-02 17:58:09,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 104 [2023-12-02 17:58:09,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2023-12-02 17:58:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:58:10,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:58:10,642 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:58:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633509471] [2023-12-02 17:58:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633509471] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:58:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:58:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-02 17:58:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573781972] [2023-12-02 17:58:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:58:10,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 17:58:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:58:10,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 17:58:10,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:58:10,643 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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 17:58:13,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 17:58:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:58:15,387 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2023-12-02 17:58:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 17:58:15,388 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 17:58:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:58:15,390 INFO L225 Difference]: With dead ends: 113 [2023-12-02 17:58:15,390 INFO L226 Difference]: Without dead ends: 113 [2023-12-02 17:58:15,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-12-02 17:58:15,391 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 71 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:58:15,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 417 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2023-12-02 17:58:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-02 17:58:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2023-12-02 17:58:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.5357142857142858) internal successors, (129), 105 states have internal predecessors, (129), 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 17:58:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2023-12-02 17:58:15,396 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 21 [2023-12-02 17:58:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:58:15,396 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2023-12-02 17:58:15,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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 17:58:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2023-12-02 17:58:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 17:58:15,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:58:15,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:58:15,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (24)] Ended with exit code 0 [2023-12-02 17:58:15,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:15,598 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:58:15,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:58:15,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1817621130, now seen corresponding path program 1 times [2023-12-02 17:58:15,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:58:15,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299684156] [2023-12-02 17:58:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:15,599 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 17:58:15,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:58:15,600 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:15,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (25)] Waiting until timeout for monitored process [2023-12-02 17:58:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:15,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 17:58:15,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:15,860 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 17:58:15,884 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 17:58:15,898 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:58:15,899 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 17:58:15,920 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 17:58:15,957 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 12 [2023-12-02 17:58:15,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 17:58:16,252 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:16,253 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 63 treesize of output 54 [2023-12-02 17:58:16,268 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 17:58:16,363 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 17:58:16,363 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 56 treesize of output 41 [2023-12-02 17:58:16,381 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 17:58:16,517 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:58:16,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 21 [2023-12-02 17:58:16,574 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 17:58:16,624 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 17:58:16,754 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 17:58:16,754 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:58:16,754 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:58:16,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299684156] [2023-12-02 17:58:16,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299684156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:58:16,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:58:16,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-02 17:58:16,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203346284] [2023-12-02 17:58:16,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:58:16,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 17:58:16,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:58:16,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 17:58:16,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-12-02 17:58:16,756 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 17:58:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:58:18,466 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2023-12-02 17:58:18,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 17:58:18,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 22 [2023-12-02 17:58:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:58:18,468 INFO L225 Difference]: With dead ends: 119 [2023-12-02 17:58:18,468 INFO L226 Difference]: Without dead ends: 119 [2023-12-02 17:58:18,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-12-02 17:58:18,469 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:58:18,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 570 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 17:58:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-02 17:58:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2023-12-02 17:58:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 107 states have internal predecessors, (131), 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 17:58:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2023-12-02 17:58:18,473 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 22 [2023-12-02 17:58:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:58:18,473 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2023-12-02 17:58:18,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 17:58:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2023-12-02 17:58:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 17:58:18,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:58:18,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:58:18,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (25)] Ended with exit code 0 [2023-12-02 17:58:18,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:18,675 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:58:18,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:58:18,675 INFO L85 PathProgramCache]: Analyzing trace with hash 511680389, now seen corresponding path program 1 times [2023-12-02 17:58:18,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:58:18,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975127543] [2023-12-02 17:58:18,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:18,676 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 17:58:18,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:58:18,677 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:18,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (26)] Waiting until timeout for monitored process [2023-12-02 17:58:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:18,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 17:58:18,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:18,945 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-12-02 17:58:18,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2023-12-02 17:58:19,016 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:58:19,016 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 17:58:19,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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 17:58:19,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2023-12-02 17:58:19,487 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:19,487 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2023-12-02 17:58:19,553 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:19,553 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 17:58:19,886 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:58:19,886 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 56 [2023-12-02 17:58:19,960 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:58:19,961 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 49 [2023-12-02 17:58:20,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:20,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 19 [2023-12-02 17:58:20,536 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 17:58:20,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:58:20,536 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:58:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975127543] [2023-12-02 17:58:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975127543] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:58:20,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:58:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 17:58:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104227675] [2023-12-02 17:58:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:58:20,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 17:58:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:58:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 17:58:20,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:58:20,538 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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 17:58:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:58:22,502 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2023-12-02 17:58:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 17:58:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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 23 [2023-12-02 17:58:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:58:22,504 INFO L225 Difference]: With dead ends: 124 [2023-12-02 17:58:22,504 INFO L226 Difference]: Without dead ends: 124 [2023-12-02 17:58:22,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:58:22,505 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:58:22,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 279 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 17:58:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-02 17:58:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2023-12-02 17:58:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.5172413793103448) internal successors, (132), 108 states have internal predecessors, (132), 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 17:58:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2023-12-02 17:58:22,509 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 23 [2023-12-02 17:58:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:58:22,509 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2023-12-02 17:58:22,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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 17:58:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2023-12-02 17:58:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 17:58:22,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:58:22,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:58:22,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (26)] Ended with exit code 0 [2023-12-02 17:58:22,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:22,710 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:58:22,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:58:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1317776916, now seen corresponding path program 1 times [2023-12-02 17:58:22,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:58:22,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765238870] [2023-12-02 17:58:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:22,711 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 17:58:22,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:58:22,712 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:22,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (27)] Waiting until timeout for monitored process [2023-12-02 17:58:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:22,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:58:22,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:22,870 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 15 treesize of output 7 [2023-12-02 17:58:22,891 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 17:58:22,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:58:22,892 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:58:22,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765238870] [2023-12-02 17:58:22,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765238870] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:58:22,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:58:22,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:58:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270449356] [2023-12-02 17:58:22,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:58:22,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:58:22,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:58:22,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:58:22,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:58:22,893 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 17:58:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:58:23,321 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2023-12-02 17:58:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:58:23,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 24 [2023-12-02 17:58:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:58:23,322 INFO L225 Difference]: With dead ends: 108 [2023-12-02 17:58:23,322 INFO L226 Difference]: Without dead ends: 108 [2023-12-02 17:58:23,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:58:23,323 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:58:23,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 171 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:58:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-02 17:58:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-12-02 17:58:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.5057471264367817) internal successors, (131), 107 states have internal predecessors, (131), 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 17:58:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2023-12-02 17:58:23,328 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2023-12-02 17:58:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:58:23,328 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2023-12-02 17:58:23,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 17:58:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2023-12-02 17:58:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 17:58:23,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:58:23,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:58:23,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (27)] Ended with exit code 0 [2023-12-02 17:58:23,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:23,529 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:58:23,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:58:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2098588748, now seen corresponding path program 1 times [2023-12-02 17:58:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:58:23,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329837195] [2023-12-02 17:58:23,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:23,531 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 17:58:23,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:58:23,532 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:23,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (28)] Waiting until timeout for monitored process [2023-12-02 17:58:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:23,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 17:58:23,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:23,774 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-12-02 17:58:23,774 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 21 treesize of output 15 [2023-12-02 17:58:23,820 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 17:58:23,820 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 21 treesize of output 20 [2023-12-02 17:58:23,836 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 17:58:23,866 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 28 treesize of output 12 [2023-12-02 17:58:24,079 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:24,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2023-12-02 17:58:24,117 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:24,117 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 35 treesize of output 34 [2023-12-02 17:58:24,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:58:24,296 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 48 treesize of output 45 [2023-12-02 17:58:24,337 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:58:24,337 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 39 treesize of output 38 [2023-12-02 17:58:24,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:24,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 12 [2023-12-02 17:58:24,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-12-02 17:58:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:58:24,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:58:24,795 WARN L854 $PredicateComparison]: unable to prove that (and (= (bvadd (select |c_#valid| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (_ bv1 1)) (_ bv0 1)) (forall ((v_ArrVal_1110 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1110) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) is different from false [2023-12-02 17:58:25,051 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1108))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1110)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (= (bvadd (select |c_#valid| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 17:58:25,205 WARN L854 $PredicateComparison]: unable to prove that (and (= (bvadd (select |c_#valid| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (_ bv1 1)) (_ bv0 1)) (forall ((v_ArrVal_1110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1107 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1107) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1108))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1110)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)))) is different from false [2023-12-02 17:58:25,224 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1108))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1110)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (= (bvadd (select |c_#valid| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 17:58:25,246 WARN L854 $PredicateComparison]: unable to prove that (and (= (bvadd (select |c_#valid| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (_ bv1 1)) (_ bv0 1)) (forall ((v_ArrVal_1110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse0 (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse2 .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1108)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse1) v_ArrVal_1110))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)))) is different from false [2023-12-02 17:58:25,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:25,281 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 2 case distinctions, treesize of input 60 treesize of output 53 [2023-12-02 17:58:25,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:25,293 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 297 treesize of output 237 [2023-12-02 17:58:25,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:25,313 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 116 treesize of output 98 [2023-12-02 17:58:25,320 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 98 treesize of output 92 [2023-12-02 17:58:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:58:25,415 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:58:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329837195] [2023-12-02 17:58:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329837195] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:58:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1401568817] [2023-12-02 17:58:25,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:25,415 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:58:25,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:58:25,418 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:58:25,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-02 17:58:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:25,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 17:58:25,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:25,917 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:58:25,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-12-02 17:58:25,988 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:58:25,988 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 17:58:26,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 17:58:26,081 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 32 treesize of output 16 [2023-12-02 17:58:26,420 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:26,420 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 48 treesize of output 43 [2023-12-02 17:58:26,459 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:26,460 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 17:58:26,807 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:26,808 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 48 treesize of output 43 [2023-12-02 17:58:26,860 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:26,861 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 17:58:27,246 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-12-02 17:58:27,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-12-02 17:58:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:58:27,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:58:27,491 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1167 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1167) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (= (bvadd (select |c_#valid| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 17:58:28,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-12-02 17:58:28,277 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1165 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1165))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1167)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) is different from false [2023-12-02 17:58:28,294 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1165 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse0 (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse2 .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1165)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse1) v_ArrVal_1167))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) is different from false [2023-12-02 17:58:28,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:28,320 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 2 case distinctions, treesize of input 49 treesize of output 42 [2023-12-02 17:58:28,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:28,330 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 169 treesize of output 131 [2023-12-02 17:58:28,340 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 50 treesize of output 46 [2023-12-02 17:58:28,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:28,348 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 46 treesize of output 36 [2023-12-02 17:58:28,365 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-12-02 17:58:28,365 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 15 treesize of output 14 [2023-12-02 17:58:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:58:28,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1401568817] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:58:28,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268267381] [2023-12-02 17:58:28,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:28,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:58:28,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:58:28,441 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:58:28,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 17:58:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:28,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 17:58:28,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:28,606 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 17:58:28,626 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:58:28,626 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 17:58:28,644 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 17:58:28,736 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 28 treesize of output 12 [2023-12-02 17:58:29,201 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:29,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2023-12-02 17:58:29,235 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:58:29,235 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 35 treesize of output 34 [2023-12-02 17:58:29,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:58:29,537 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 48 treesize of output 45 [2023-12-02 17:58:29,572 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:58:29,572 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 39 treesize of output 38 [2023-12-02 17:58:30,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:30,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 12 [2023-12-02 17:58:30,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-12-02 17:58:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:58:30,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:58:30,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-12-02 17:58:30,951 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1224 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1224) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) is different from false [2023-12-02 17:58:30,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1224 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1222))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1224)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2023-12-02 17:58:31,317 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1224 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1221) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1222))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1224)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) is different from false [2023-12-02 17:58:31,331 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1224 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1222))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1224)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) is different from false [2023-12-02 17:58:31,350 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1224 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse0 (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse2 .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1222)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse1) v_ArrVal_1224))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) is different from false [2023-12-02 17:58:31,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:31,377 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 2 case distinctions, treesize of input 49 treesize of output 42 [2023-12-02 17:58:31,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:31,388 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 169 treesize of output 131 [2023-12-02 17:58:31,398 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 50 treesize of output 46 [2023-12-02 17:58:31,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:31,407 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 46 treesize of output 36 [2023-12-02 17:58:31,426 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-12-02 17:58:31,426 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 15 treesize of output 14 [2023-12-02 17:58:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:58:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268267381] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:58:31,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 17:58:31,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 13, 14, 13, 15] total 65 [2023-12-02 17:58:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968986410] [2023-12-02 17:58:31,431 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 17:58:31,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-12-02 17:58:31,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:58:31,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-12-02 17:58:31,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2433, Unknown=164, NotChecked=1508, Total=4422 [2023-12-02 17:58:31,435 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 67 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 66 states have internal predecessors, (111), 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 17:58:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:58:36,712 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2023-12-02 17:58:36,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 17:58:36,713 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 66 states have internal predecessors, (111), 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 17:58:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:58:36,714 INFO L225 Difference]: With dead ends: 121 [2023-12-02 17:58:36,714 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 17:58:36,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=359, Invalid=2835, Unknown=164, NotChecked=1612, Total=4970 [2023-12-02 17:58:36,717 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 56 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1121 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:58:36,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1413 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1221 Invalid, 0 Unknown, 1121 Unchecked, 4.4s Time] [2023-12-02 17:58:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 17:58:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2023-12-02 17:58:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.5) internal successors, (132), 108 states have internal predecessors, (132), 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 17:58:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2023-12-02 17:58:36,721 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 25 [2023-12-02 17:58:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:58:36,722 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2023-12-02 17:58:36,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 66 states have internal predecessors, (111), 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 17:58:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2023-12-02 17:58:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 17:58:36,722 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:58:36,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:58:36,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-12-02 17:58:36,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (28)] Ended with exit code 0 [2023-12-02 17:58:37,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-12-02 17:58:37,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 17:58:37,324 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:58:37,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:58:37,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1882812373, now seen corresponding path program 1 times [2023-12-02 17:58:37,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:58:37,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992738988] [2023-12-02 17:58:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:37,325 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 17:58:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:58:37,326 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:37,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (31)] Waiting until timeout for monitored process [2023-12-02 17:58:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:37,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 17:58:37,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:37,632 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 17:58:37,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:58:37,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 17:58:37,945 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 17:58:37,945 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 17:58:38,011 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 17:58:38,012 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:58:38,012 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:58:38,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992738988] [2023-12-02 17:58:38,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992738988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:58:38,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:58:38,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:58:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33638229] [2023-12-02 17:58:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:58:38,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:58:38,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:58:38,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:58:38,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:58:38,014 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:58:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:58:39,413 INFO L93 Difference]: Finished difference Result 131 states and 160 transitions. [2023-12-02 17:58:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:58:39,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 17:58:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:58:39,415 INFO L225 Difference]: With dead ends: 131 [2023-12-02 17:58:39,415 INFO L226 Difference]: Without dead ends: 131 [2023-12-02 17:58:39,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:58:39,416 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:58:39,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 99 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 17:58:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-02 17:58:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2023-12-02 17:58:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 95 states have internal predecessors, (108), 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 17:58:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2023-12-02 17:58:39,418 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 26 [2023-12-02 17:58:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:58:39,419 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2023-12-02 17:58:39,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:58:39,419 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2023-12-02 17:58:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 17:58:39,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:58:39,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:58:39,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (31)] Forceful destruction successful, exit code 0 [2023-12-02 17:58:39,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:39,620 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-12-02 17:58:39,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:58:39,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1882817182, now seen corresponding path program 1 times [2023-12-02 17:58:39,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:58:39,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292501190] [2023-12-02 17:58:39,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:58:39,621 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 17:58:39,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:58:39,622 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 17:58:39,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9839da00-de55-4c73-87ef-e60b7e8c791e/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 (32)] Waiting until timeout for monitored process [2023-12-02 17:58:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:58:39,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-02 17:58:39,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:58:39,915 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 17:58:39,915 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 19 treesize of output 22 [2023-12-02 17:58:39,963 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 17:58:39,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 17:58:39,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 17:58:40,020 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 36 treesize of output 20 [2023-12-02 17:58:40,045 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 17:58:40,477 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-12-02 17:58:40,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 55 [2023-12-02 17:58:40,499 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 34 treesize of output 25 [2023-12-02 17:58:40,652 INFO L349 Elim1Store]: treesize reduction 100, result has 13.0 percent of original size [2023-12-02 17:58:40,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 65 [2023-12-02 17:58:40,672 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 72 treesize of output 53 [2023-12-02 17:58:41,146 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 17:58:41,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 104 [2023-12-02 17:58:41,174 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 72 treesize of output 53 [2023-12-02 17:58:41,339 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 17:58:41,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 99 [2023-12-02 17:58:41,362 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 72 treesize of output 53 [2023-12-02 17:58:41,757 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2023-12-02 17:58:42,648 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-12-02 17:58:42,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 32 [2023-12-02 17:58:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:58:42,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:58:43,007 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1326))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1327) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 17:58:43,033 INFO L349 Elim1Store]: treesize reduction 7, result has 82.5 percent of original size [2023-12-02 17:58:43,033 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 46 treesize of output 45 [2023-12-02 17:58:43,259 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1325) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1326))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1324) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1327) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) .cse1))) is different from false [2023-12-02 17:58:43,274 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1326))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1327) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) .cse1))) is different from false [2023-12-02 17:58:43,734 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|))))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (= .cse0 (select (let ((.cse1 (store .cse2 .cse0 v_ArrVal_1326))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1319) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1322) .cse0 v_ArrVal_1327) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))) is different from false [2023-12-02 17:58:43,782 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| .cse5)))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) .cse5)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1326))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1319) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1322) .cse2 v_ArrVal_1327) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) .cse2))))) is different from false [2023-12-02 17:58:43,851 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse2 (let ((.cse6 (select .cse7 .cse4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) .cse6)))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) .cse6)))))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (= .cse0 (select (let ((.cse1 (store .cse2 .cse0 v_ArrVal_1326))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1319) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1322) .cse0 v_ArrVal_1327) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))))) is different from false [2023-12-02 17:58:43,903 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse6 (select .cse7 .cse4))) (store (store (select |c_#memory_$Pointer$.base| .cse3) .cse5 .cse6) (bvadd .cse5 (_ bv4 32)) .cse6))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1326))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1322) .cse2 v_ArrVal_1327) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) .cse2)))))) is different from false [2023-12-02 17:58:43,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:43,961 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 2 case distinctions, treesize of input 359 treesize of output 320 [2023-12-02 17:58:43,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:58:43,983 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 1398 treesize of output 1196 [2023-12-02 17:58:44,008 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 596 treesize of output 594 [2023-12-02 17:58:44,011 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 1190 treesize of output 1186 [2023-12-02 17:58:45,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse30 .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))) (.cse7 (select .cse30 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse0 (= .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse8 (select .cse6 .cse7))) (and (or (not .cse0) (and (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (let ((.cse2 (let ((.cse3 (store .cse4 .cse1 v_ArrVal_1326))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_253 (_ BitVec 32))) (= .cse1 (select .cse2 v_arrayElimCell_253))) (= (select .cse2 v_arrayElimCell_252) .cse1)))))) (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (= (select (let ((.cse9 (store .cse10 .cse11 v_ArrVal_1326))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) v_arrayElimCell_252) .cse11) (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse11))))))) (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse12)) (forall ((v_arrayElimCell_253 (_ BitVec 32))) (= .cse12 (select (let ((.cse13 (store .cse14 .cse12 v_ArrVal_1326))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) v_arrayElimCell_253))))))) (forall ((v_arrayElimCell_250 (_ BitVec 32))) (let ((.cse18 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (let ((.cse17 (store .cse18 .cse15 v_ArrVal_1326))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= .cse15 (select .cse16 v_arrayElimCell_250)) (forall ((v_arrayElimCell_252 (_ BitVec 32))) (= (select .cse16 v_arrayElimCell_252) .cse15))))) (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse15))))) (or .cse0 (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse19 (select (select .cse21 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (= .cse19 (select (let ((.cse20 (store .cse21 .cse19 v_ArrVal_1326))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) v_arrayElimCell_250)) (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse19)))))) (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_253 (_ BitVec 32))) (let ((.cse25 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (let ((.cse23 (let ((.cse24 (store .cse25 .cse22 v_ArrVal_1326))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= .cse22 (select .cse23 v_arrayElimCell_250)) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse22)) (= .cse22 (select .cse23 v_arrayElimCell_253))))))) (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_253 (_ BitVec 32))) (let ((.cse29 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse26 (select (select .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (let ((.cse27 (let ((.cse28 (store .cse29 .cse26 v_ArrVal_1326))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= .cse26 (select .cse27 v_arrayElimCell_250)) (forall ((v_arrayElimCell_252 (_ BitVec 32))) (= (select .cse27 v_arrayElimCell_252) .cse26)) (= .cse26 (select .cse27 v_arrayElimCell_253))))))))))) is different from false [2023-12-02 17:58:47,799 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse30 .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))) (.cse7 (select .cse30 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse0 (= .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse8 (select .cse6 .cse7))) (and (or (not .cse0) (and (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (let ((.cse2 (let ((.cse3 (store .cse4 .cse1 v_ArrVal_1326))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_253 (_ BitVec 32))) (= .cse1 (select .cse2 v_arrayElimCell_253))) (= (select .cse2 v_arrayElimCell_252) .cse1)))))) (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_arrayElimCell_252 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (= (select (let ((.cse9 (store .cse10 .cse11 v_ArrVal_1326))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) v_arrayElimCell_252) .cse11) (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse11))))))) (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse12)) (forall ((v_arrayElimCell_253 (_ BitVec 32))) (= .cse12 (select (let ((.cse13 (store .cse14 .cse12 v_ArrVal_1326))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) v_arrayElimCell_253))))))) (forall ((v_arrayElimCell_250 (_ BitVec 32))) (let ((.cse18 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (let ((.cse17 (store .cse18 .cse15 v_ArrVal_1326))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= .cse15 (select .cse16 v_arrayElimCell_250)) (forall ((v_arrayElimCell_252 (_ BitVec 32))) (= (select .cse16 v_arrayElimCell_252) .cse15))))) (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse15))))) (or .cse0 (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse19 (select (select .cse21 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (= .cse19 (select (let ((.cse20 (store .cse21 .cse19 v_ArrVal_1326))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) v_arrayElimCell_250)) (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse19)))))) (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_253 (_ BitVec 32))) (let ((.cse25 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (let ((.cse23 (let ((.cse24 (store .cse25 .cse22 v_ArrVal_1326))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= .cse22 (select .cse23 v_arrayElimCell_250)) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse22)) (= .cse22 (select .cse23 v_arrayElimCell_253))))))) (forall ((v_arrayElimCell_250 (_ BitVec 32)) (v_ArrVal_1326 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_253 (_ BitVec 32))) (let ((.cse29 (store .cse6 .cse7 (store (store .cse8 v_arrayElimCell_250 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_250 (_ bv4 32)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (let ((.cse26 (select (select .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (let ((.cse27 (let ((.cse28 (store .cse29 .cse26 v_ArrVal_1326))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= .cse26 (select .cse27 v_arrayElimCell_250)) (forall ((v_arrayElimCell_252 (_ BitVec 32))) (= (select .cse27 v_arrayElimCell_252) .cse26)) (= .cse26 (select .cse27 v_arrayElimCell_253))))))))))) is different from true