./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:20:04,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:20:04,213 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:20:04,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:20:04,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:20:04,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:20:04,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:20:04,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:20:04,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:20:04,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:20:04,248 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:20:04,248 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:20:04,249 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:20:04,249 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:20:04,250 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:20:04,250 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:20:04,251 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:20:04,251 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:20:04,252 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:20:04,252 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:20:04,253 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:20:04,253 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:20:04,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:20:04,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:20:04,255 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:20:04,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:20:04,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:20:04,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:20:04,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:20:04,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:20:04,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:20:04,258 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:20:04,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:20:04,258 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:20:04,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:20:04,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:20:04,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:20:04,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:20:04,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:20:04,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:20:04,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:20:04,260 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:20:04,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:20:04,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:20:04,261 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:20:04,261 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:20:04,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:20:04,261 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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 ! call(reach_error())) ) 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-12-02 15:20:04,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:20:04,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:20:04,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:20:04,500 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:20:04,501 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:20:04,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-12-02 15:20:07,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:20:07,457 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:20:07,458 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-12-02 15:20:07,469 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/data/dca4d5708/db53240ffaae4d4a8c9165d4902c0ac8/FLAG9411e2214 [2023-12-02 15:20:07,479 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/data/dca4d5708/db53240ffaae4d4a8c9165d4902c0ac8 [2023-12-02 15:20:07,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:20:07,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:20:07,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:20:07,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:20:07,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:20:07,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa34896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07, skipping insertion in model container [2023-12-02 15:20:07,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,534 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:20:07,759 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-12-02 15:20:07,764 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-12-02 15:20:07,765 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-12-02 15:20:07,766 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-12-02 15:20:07,766 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-12-02 15:20:07,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-12-02 15:20:07,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:20:07,778 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:20:07,811 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-12-02 15:20:07,813 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-12-02 15:20:07,814 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-12-02 15:20:07,815 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-12-02 15:20:07,816 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-12-02 15:20:07,817 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-12-02 15:20:07,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:20:07,849 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:20:07,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07 WrapperNode [2023-12-02 15:20:07,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:20:07,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:20:07,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:20:07,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:20:07,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,891 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2023-12-02 15:20:07,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:20:07,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:20:07,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:20:07,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:20:07,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:20:07,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:20:07,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:20:07,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:20:07,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (1/1) ... [2023-12-02 15:20:07,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:20:07,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:20:07,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:20:07,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:20:07,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 15:20:07,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:20:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:20:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:20:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:20:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:20:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:20:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:20:07,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:20:07,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:20:08,073 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:20:08,075 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:20:08,244 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:20:08,267 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:20:08,268 INFO L309 CfgBuilder]: Removed 15 assume(true) statements. [2023-12-02 15:20:08,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:20:08 BoogieIcfgContainer [2023-12-02 15:20:08,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:20:08,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:20:08,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:20:08,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:20:08,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:20:07" (1/3) ... [2023-12-02 15:20:08,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b42ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:20:08, skipping insertion in model container [2023-12-02 15:20:08,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:07" (2/3) ... [2023-12-02 15:20:08,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b42ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:20:08, skipping insertion in model container [2023-12-02 15:20:08,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:20:08" (3/3) ... [2023-12-02 15:20:08,279 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-12-02 15:20:08,296 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:20:08,296 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-12-02 15:20:08,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:20:08,337 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5bc51843, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:20:08,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 15:20:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:20:08,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:08,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:20:08,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:20:08,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash 178303299, now seen corresponding path program 1 times [2023-12-02 15:20:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:08,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365324361] [2023-12-02 15:20:08,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:08,566 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 15:20:08,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:20:08,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365324361] [2023-12-02 15:20:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365324361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:08,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:08,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:20:08,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905962422] [2023-12-02 15:20:08,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:08,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:20:08,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:20:08,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:20:08,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:20:08,607 INFO L87 Difference]: Start difference. First operand has 41 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:08,633 INFO L93 Difference]: Finished difference Result 81 states and 127 transitions. [2023-12-02 15:20:08,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:20:08,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 15:20:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:08,642 INFO L225 Difference]: With dead ends: 81 [2023-12-02 15:20:08,642 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 15:20:08,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:20:08,648 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:08,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:20:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 15:20:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-02 15:20:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.25) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-12-02 15:20:08,677 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 5 [2023-12-02 15:20:08,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:08,677 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-12-02 15:20:08,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-12-02 15:20:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:20:08,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:08,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:20:08,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:20:08,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:20:08,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash 177536678, now seen corresponding path program 1 times [2023-12-02 15:20:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100467412] [2023-12-02 15:20:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:08,990 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 15:20:08,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:20:08,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100467412] [2023-12-02 15:20:08,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100467412] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:08,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:08,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:20:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656068918] [2023-12-02 15:20:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:08,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:20:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:20:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:20:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:20:08,994 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:09,069 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2023-12-02 15:20:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:20:09,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 15:20:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:09,071 INFO L225 Difference]: With dead ends: 38 [2023-12-02 15:20:09,071 INFO L226 Difference]: Without dead ends: 36 [2023-12-02 15:20:09,071 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 15:20:09,072 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:09,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:20:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-02 15:20:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-02 15:20:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-12-02 15:20:09,079 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 5 [2023-12-02 15:20:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:09,080 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-12-02 15:20:09,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-12-02 15:20:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:20:09,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:09,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:20:09,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:20:09,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:20:09,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1208626208, now seen corresponding path program 1 times [2023-12-02 15:20:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:09,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492450917] [2023-12-02 15:20:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:09,168 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 15:20:09,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:20:09,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492450917] [2023-12-02 15:20:09,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492450917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:09,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:09,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:20:09,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755897559] [2023-12-02 15:20:09,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:09,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:20:09,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:20:09,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:20:09,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:20:09,171 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:09,259 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2023-12-02 15:20:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:20:09,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-12-02 15:20:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:09,261 INFO L225 Difference]: With dead ends: 62 [2023-12-02 15:20:09,261 INFO L226 Difference]: Without dead ends: 60 [2023-12-02 15:20:09,262 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 15:20:09,263 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:09,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 44 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:20:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-02 15:20:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2023-12-02 15:20:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2023-12-02 15:20:09,271 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 6 [2023-12-02 15:20:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:09,271 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2023-12-02 15:20:09,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2023-12-02 15:20:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:20:09,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:09,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:09,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:20:09,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:20:09,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1556646194, now seen corresponding path program 1 times [2023-12-02 15:20:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:09,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208015644] [2023-12-02 15:20:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:09,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:09,349 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 15:20:09,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:20:09,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208015644] [2023-12-02 15:20:09,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208015644] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:09,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:20:09,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148798029] [2023-12-02 15:20:09,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:09,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:20:09,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:20:09,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:20:09,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:20:09,351 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 15:20:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:09,427 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-12-02 15:20:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:20:09,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 15:20:09,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:09,428 INFO L225 Difference]: With dead ends: 34 [2023-12-02 15:20:09,429 INFO L226 Difference]: Without dead ends: 32 [2023-12-02 15:20:09,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 15:20:09,430 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:09,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:20:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-02 15:20:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-02 15:20:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-12-02 15:20:09,437 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2023-12-02 15:20:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:09,437 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-12-02 15:20:09,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 15:20:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-12-02 15:20:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:20:09,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:09,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:09,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 15:20:09,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:20:09,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1556683930, now seen corresponding path program 1 times [2023-12-02 15:20:09,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:09,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497309956] [2023-12-02 15:20:09,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:09,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:09,726 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 15:20:09,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:20:09,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497309956] [2023-12-02 15:20:09,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497309956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:09,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:09,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:20:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482368505] [2023-12-02 15:20:09,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:09,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:20:09,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:20:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:20:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:20:09,728 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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 15:20:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:09,853 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2023-12-02 15:20:09,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:20:09,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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 15:20:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:09,855 INFO L225 Difference]: With dead ends: 67 [2023-12-02 15:20:09,855 INFO L226 Difference]: Without dead ends: 43 [2023-12-02 15:20:09,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 15:20:09,856 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:09,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:20:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-02 15:20:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2023-12-02 15:20:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2023-12-02 15:20:09,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2023-12-02 15:20:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:09,865 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2023-12-02 15:20:09,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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 15:20:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2023-12-02 15:20:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:20:09,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:09,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:09,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:20:09,867 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:20:09,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1300437210, now seen corresponding path program 1 times [2023-12-02 15:20:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206322692] [2023-12-02 15:20:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:20:10,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:20:10,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206322692] [2023-12-02 15:20:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206322692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:10,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:20:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805800062] [2023-12-02 15:20:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:10,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:20:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:20:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:20:10,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:20:10,525 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.5) 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 15:20:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:10,686 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2023-12-02 15:20:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:20:10,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) 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 15:20:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:10,687 INFO L225 Difference]: With dead ends: 49 [2023-12-02 15:20:10,687 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 15:20:10,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:20:10,688 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:10,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 104 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:20:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 15:20:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-12-02 15:20:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-12-02 15:20:10,697 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2023-12-02 15:20:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:10,697 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-12-02 15:20:10,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) 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 15:20:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-12-02 15:20:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:20:10,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:10,698 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:10,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:20:10,699 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:20:10,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash 965077955, now seen corresponding path program 1 times [2023-12-02 15:20:10,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:10,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891692680] [2023-12-02 15:20:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:10,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:20:11,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:20:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891692680] [2023-12-02 15:20:11,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891692680] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:20:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911360337] [2023-12-02 15:20:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:11,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:20:11,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:20:11,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:20:11,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:20:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:11,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 15:20:11,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:11,340 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 15:20:11,346 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 15:20:11,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-12-02 15:20:11,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 47 [2023-12-02 15:20:11,452 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 15:20:11,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-12-02 15:20:11,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:11,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 15:20:11,484 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 35 treesize of output 18 [2023-12-02 15:20:11,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:11,489 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 18 treesize of output 11 [2023-12-02 15:20:11,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-02 15:20:11,511 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-12-02 15:20:11,520 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 92 treesize of output 56 [2023-12-02 15:20:11,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:11,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:11,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-12-02 15:20:11,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:20:11,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-12-02 15:20:11,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:11,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:11,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:20:11,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:20:11,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:11,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 90 [2023-12-02 15:20:11,947 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 176 treesize of output 128 [2023-12-02 15:20:11,954 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 97 treesize of output 91 [2023-12-02 15:20:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:20:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911360337] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:20:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [69349744] [2023-12-02 15:20:12,428 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 15:20:12,429 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:20:12,432 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:20:12,437 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:20:12,437 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:20:12,808 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:20:15,297 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '881#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) 8) 0)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) 8) 1)) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_41| (Array Int (Array Int Int))) (|v_#valid_33| (Array Int Int)) (|v_#memory_int_21| (Array Int (Array Int Int))) (|v_#memory_int_22| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_5| Int) (|v_#memory_$Pointer$.base_16| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_42| Int) (|v_#length_18| (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_43| Int) (|v_#memory_$Pointer$.offset_36| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_16| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) (store (select |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) 8) 2))) (<= (+ |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_41| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_41| |v_ULTIMATE.start_main_~x~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_42|) (select (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_42|)))) |v_#memory_$Pointer$.base_16|) (= (store |v_#memory_$Pointer$.offset_36| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_36| |v_ULTIMATE.start_main_~x~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_42|) (select (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_42|)))) |v_#memory_$Pointer$.offset_16|) (= (store (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) (store (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) 8) (select (select |#memory_$Pointer$.base| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) 8)))) |#memory_$Pointer$.base|) (not (= |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 0)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 1) |#valid|) (= (store |v_#length_18| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 12) |#length|) (= |v_#memory_int_22| (store |v_#memory_int_84| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (store (select |v_#memory_int_84| |v_ULTIMATE.start_main_~x~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_42|) 1) |v_ULTIMATE.start_main_~x~0#1.offset_42| (select (select |v_#memory_int_22| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)))) (= (select |v_#valid_33| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 0) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) (store (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_43|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_42|)) |v_ULTIMATE.start_main_~x~0#1.base_43|) |v_ULTIMATE.start_main_~x~0#1.offset_42|) 8))))) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 (select (select |v_#memory_int_21| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4)))))))' at error location [2023-12-02 15:20:15,297 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:20:15,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:20:15,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-02 15:20:15,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090193381] [2023-12-02 15:20:15,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:20:15,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:20:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:20:15,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:20:15,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-12-02 15:20:15,300 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:15,580 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2023-12-02 15:20:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:20:15,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 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 15:20:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:15,581 INFO L225 Difference]: With dead ends: 57 [2023-12-02 15:20:15,581 INFO L226 Difference]: Without dead ends: 55 [2023-12-02 15:20:15,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-12-02 15:20:15,582 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:15,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 158 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:20:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-02 15:20:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-12-02 15:20:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-12-02 15:20:15,590 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 15 [2023-12-02 15:20:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:15,591 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-12-02 15:20:15,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-12-02 15:20:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 15:20:15,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:15,592 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:15,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:20:15,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 15:20:15,794 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:20:15,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash -746443901, now seen corresponding path program 1 times [2023-12-02 15:20:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:15,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742782133] [2023-12-02 15:20:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:20:16,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:20:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742782133] [2023-12-02 15:20:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742782133] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:20:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000628428] [2023-12-02 15:20:16,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:16,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:20:16,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:20:16,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:20:16,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:20:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:16,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 15:20:16,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:16,579 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 15:20:16,587 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 15:20:16,637 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 15:20:16,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:16,646 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 15:20:16,653 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 0 case distinctions, treesize of input 18 treesize of output 18 [2023-12-02 15:20:16,656 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 30 treesize of output 22 [2023-12-02 15:20:16,661 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 15:20:16,675 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:20:16,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 15:20:16,697 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:20:16,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 15:20:16,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2023-12-02 15:20:16,797 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 100 treesize of output 60 [2023-12-02 15:20:16,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2023-12-02 15:20:16,832 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 94 treesize of output 58 [2023-12-02 15:20:16,841 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2023-12-02 15:20:16,848 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 115 treesize of output 75 [2023-12-02 15:20:16,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:16,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-12-02 15:20:16,865 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:20:16,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-12-02 15:20:16,873 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 62 [2023-12-02 15:20:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:20:16,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:20:16,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:16,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-12-02 15:20:16,934 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 74 treesize of output 54 [2023-12-02 15:20:16,938 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 47 treesize of output 45 [2023-12-02 15:20:17,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:17,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 115 [2023-12-02 15:20:17,089 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 237 treesize of output 177 [2023-12-02 15:20:17,095 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 136 treesize of output 128 [2023-12-02 15:20:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:20:17,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000628428] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:20:17,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2038196852] [2023-12-02 15:20:17,313 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 15:20:17,314 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:20:17,314 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:20:17,314 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:20:17,314 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:20:17,588 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:20:21,127 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1155#(and (<= 1 |#StackHeapBarrier|) (not (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))) (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) 8) 1) (exists ((|v_#memory_int_21| (Array Int (Array Int Int))) (|v_#memory_int_22| (Array Int (Array Int Int))) (|v_#valid_42| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_5| Int) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_50| Int) (|v_#memory_$Pointer$.base_16| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_52| Int) (|v_#length_25| (Array Int Int)) (|v_#memory_$Pointer$.offset_45| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_16| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_51| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_51| |v_ULTIMATE.start_main_~x~0#1.base_52|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_50|) (select (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_50|)))) |v_#memory_$Pointer$.base_16|) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~x~0#1.base_52|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_50|) 1) |v_ULTIMATE.start_main_~x~0#1.offset_50| (select (select |v_#memory_int_22| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|))) |v_#memory_int_22|) (<= (+ |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.offset_45| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_45| |v_ULTIMATE.start_main_~x~0#1.base_52|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_50|) (select (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_50|)))) |v_#memory_$Pointer$.offset_16|) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) (store (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) 8))))) (= (select |v_#valid_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 1) |#valid|) (= |#memory_$Pointer$.base| (store (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) (store (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) 8) (select (select |#memory_$Pointer$.base| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) 8))))) (= |#memory_int| (store |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) (store (select |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.base_52|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select (store |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52| (store (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50| 0)) |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|)) |v_ULTIMATE.start_main_~x~0#1.base_52|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) 8) 2))) (= |#length| (store |v_#length_25| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| 12)) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_#t~malloc6#1.base_5| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4 (select (select |v_#memory_int_21| |v_ULTIMATE.start_main_#t~malloc6#1.base_5|) 4)))))))' at error location [2023-12-02 15:20:21,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:20:21,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:20:21,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-02 15:20:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072284701] [2023-12-02 15:20:21,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:20:21,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 15:20:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:20:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 15:20:21,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=432, Unknown=1, NotChecked=0, Total=506 [2023-12-02 15:20:21,129 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:21,357 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2023-12-02 15:20:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:20:21,357 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 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 15:20:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:21,358 INFO L225 Difference]: With dead ends: 67 [2023-12-02 15:20:21,358 INFO L226 Difference]: Without dead ends: 51 [2023-12-02 15:20:21,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=98, Invalid=551, Unknown=1, NotChecked=0, Total=650 [2023-12-02 15:20:21,360 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:21,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 164 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:20:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-02 15:20:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2023-12-02 15:20:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-12-02 15:20:21,366 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 19 [2023-12-02 15:20:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:21,367 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-12-02 15:20:21,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-12-02 15:20:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:20:21,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:21,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, 1] [2023-12-02 15:20:21,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 15:20:21,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:20:21,568 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:20:21,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669291, now seen corresponding path program 1 times [2023-12-02 15:20:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:21,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726489946] [2023-12-02 15:20:21,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:21,625 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 15:20:21,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:20:21,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726489946] [2023-12-02 15:20:21,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726489946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:21,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:21,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:20:21,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430621471] [2023-12-02 15:20:21,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:21,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:20:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:20:21,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:20:21,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:20:21,627 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 15:20:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:21,696 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2023-12-02 15:20:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:20:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 15:20:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:21,697 INFO L225 Difference]: With dead ends: 49 [2023-12-02 15:20:21,697 INFO L226 Difference]: Without dead ends: 30 [2023-12-02 15:20:21,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 15:20:21,698 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:21,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:20:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-02 15:20:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-02 15:20:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:20:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-12-02 15:20:21,703 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 21 [2023-12-02 15:20:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:21,703 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-12-02 15:20:21,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 15:20:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-12-02 15:20:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:20:21,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:21,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:21,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 15:20:21,704 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:20:21,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2067561102, now seen corresponding path program 1 times [2023-12-02 15:20:21,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:21,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977949614] [2023-12-02 15:20:21,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:21,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:20:22,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:20:22,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977949614] [2023-12-02 15:20:22,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977949614] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:20:22,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695256912] [2023-12-02 15:20:22,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:22,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:20:22,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:20:22,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:20:22,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:20:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:22,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 15:20:22,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:22,656 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 15:20:22,687 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:20:22,690 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 15:20:22,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2023-12-02 15:20:22,707 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:20:22,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 15:20:22,724 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:20:22,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 15:20:22,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 15:20:22,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:22,737 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 15:20:22,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:22,847 INFO L349 Elim1Store]: treesize reduction 163, result has 0.6 percent of original size [2023-12-02 15:20:22,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 548 treesize of output 428 [2023-12-02 15:20:22,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:22,932 INFO L349 Elim1Store]: treesize reduction 128, result has 22.0 percent of original size [2023-12-02 15:20:22,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 540 treesize of output 455 [2023-12-02 15:20:22,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:22,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2023-12-02 15:20:22,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-12-02 15:20:22,973 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 67 treesize of output 23 [2023-12-02 15:20:22,977 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 23 treesize of output 11 [2023-12-02 15:20:22,999 INFO L349 Elim1Store]: treesize reduction 96, result has 9.4 percent of original size [2023-12-02 15:20:23,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 161 treesize of output 89 [2023-12-02 15:20:23,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2023-12-02 15:20:23,016 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 23 treesize of output 23 [2023-12-02 15:20:23,028 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-12-02 15:20:23,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-12-02 15:20:23,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 15:20:23,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:23,070 INFO L349 Elim1Store]: treesize reduction 163, result has 0.6 percent of original size [2023-12-02 15:20:23,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 483 treesize of output 383 [2023-12-02 15:20:23,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:20:23,093 INFO L349 Elim1Store]: treesize reduction 163, result has 0.6 percent of original size [2023-12-02 15:20:23,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 475 treesize of output 375 [2023-12-02 15:20:23,207 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:20:23,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2023-12-02 15:20:23,214 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 15 treesize of output 7 [2023-12-02 15:20:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:20:23,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:20:23,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:23,288 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 6036 treesize of output 5881 [2023-12-02 15:20:23,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:23,308 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 1344 treesize of output 1302 [2023-12-02 15:20:23,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:23,322 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 1355 treesize of output 1109 [2023-12-02 15:20:23,360 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 1260 treesize of output 1056 [2023-12-02 15:20:23,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 421 [2023-12-02 15:20:23,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 3 [2023-12-02 15:20:23,476 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 858 treesize of output 756 [2023-12-02 15:20:23,510 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 912 treesize of output 759 [2023-12-02 15:20:23,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 15:20:23,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 15:20:24,203 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-12-02 15:20:24,203 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 1458 treesize of output 1389 [2023-12-02 15:20:24,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:24,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 1450 treesize of output 980 [2023-12-02 15:20:25,658 INFO L349 Elim1Store]: treesize reduction 96, result has 44.5 percent of original size [2023-12-02 15:20:25,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 108096 treesize of output 92775 [2023-12-02 15:20:26,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:26,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 400683 treesize of output 368539 [2023-12-02 15:20:28,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:28,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 11692 treesize of output 9752 [2023-12-02 15:20:28,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:28,820 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 7662 treesize of output 7282 [2023-12-02 15:20:29,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:29,195 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 6348 treesize of output 5817 [2023-12-02 15:20:29,455 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 5792 treesize of output 5688 [2023-12-02 15:20:29,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:29,695 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 6134 treesize of output 5868 [2023-12-02 15:20:29,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:29,993 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 5364 treesize of output 5359 [2023-12-02 15:20:30,239 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 5320 treesize of output 5268 [2023-12-02 15:20:30,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:30,509 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 5784 treesize of output 5100 [2023-12-02 15:20:30,853 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 4562 treesize of output 4458 [2023-12-02 15:29:21,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 15:29:33,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:29:33,075 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 518 treesize of output 516 [2023-12-02 15:29:33,485 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 5 treesize of output 3 [2023-12-02 15:29:33,546 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 7 treesize of output 5 [2023-12-02 15:29:33,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:29:34,526 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 7 treesize of output 5 [2023-12-02 15:29:34,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 15:29:34,611 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 6 treesize of output 4 [2023-12-02 15:29:34,698 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 15:29:34,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 15:29:34,793 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 15:29:34,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:29:34,872 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 844 treesize of output 820 [2023-12-02 15:29:35,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:29:35,621 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 825 treesize of output 833 [2023-12-02 15:29:39,969 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 2200 treesize of output 1782 [2023-12-02 15:29:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:29:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695256912] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:29:43,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [217181529] [2023-12-02 15:29:43,074 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:29:43,074 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:29:43,074 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:29:43,074 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:29:43,074 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:29:43,435 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:29:48,054 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1570#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))' at error location [2023-12-02 15:29:48,055 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:29:48,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:29:48,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2023-12-02 15:29:48,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586120224] [2023-12-02 15:29:48,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:29:48,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 15:29:48,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:29:48,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 15:29:48,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=438, Unknown=1, NotChecked=0, Total=506 [2023-12-02 15:29:48,056 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:29:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:29:49,820 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2023-12-02 15:29:49,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:29:49,821 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 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 15:29:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:29:49,821 INFO L225 Difference]: With dead ends: 65 [2023-12-02 15:29:49,821 INFO L226 Difference]: Without dead ends: 49 [2023-12-02 15:29:49,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=82, Invalid=517, Unknown=1, NotChecked=0, Total=600 [2023-12-02 15:29:49,823 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:29:49,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 124 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 15:29:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-02 15:29:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2023-12-02 15:29:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:29:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2023-12-02 15:29:49,827 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 21 [2023-12-02 15:29:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:29:49,827 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2023-12-02 15:29:49,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:29:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2023-12-02 15:29:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 15:29:49,828 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:29:49,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:29:49,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 15:29:50,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:29:50,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:29:50,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:29:50,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1376954958, now seen corresponding path program 1 times [2023-12-02 15:29:50,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:29:50,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540558160] [2023-12-02 15:29:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:29:50,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:29:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:29:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:29:50,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:29:50,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540558160] [2023-12-02 15:29:50,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540558160] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:29:50,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740291103] [2023-12-02 15:29:50,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:29:50,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:29:50,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:29:50,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:29:50,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:29:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:29:50,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-02 15:29:50,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:29:50,827 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 15:29:50,854 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 15:29:50,858 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 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 15:29:50,871 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:29:50,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2023-12-02 15:29:50,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:29:50,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 15:29:50,896 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:29:50,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 15:29:50,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 15:29:50,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:50,909 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 15:29:50,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:50,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:50,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:51,014 INFO L349 Elim1Store]: treesize reduction 208, result has 8.8 percent of original size [2023-12-02 15:29:51,014 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 4 case distinctions, treesize of input 406 treesize of output 361 [2023-12-02 15:29:51,019 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 0 case distinctions, treesize of input 268 treesize of output 207 [2023-12-02 15:29:51,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:29:51,155 INFO L349 Elim1Store]: treesize reduction 334, result has 17.9 percent of original size [2023-12-02 15:29:51,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 542 treesize of output 663 [2023-12-02 15:29:51,201 INFO L349 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2023-12-02 15:29:51,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 923 treesize of output 821 [2023-12-02 15:29:51,241 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-12-02 15:29:51,241 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 32 treesize of output 46 [2023-12-02 15:29:51,254 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 16 treesize of output 15 [2023-12-02 15:29:51,262 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 35 treesize of output 19 [2023-12-02 15:29:51,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:29:51,438 INFO L349 Elim1Store]: treesize reduction 1115, result has 17.8 percent of original size [2023-12-02 15:29:51,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 518 treesize of output 739 [2023-12-02 15:29:51,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 15:29:51,611 INFO L349 Elim1Store]: treesize reduction 433, result has 7.5 percent of original size [2023-12-02 15:29:51,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 1056 treesize of output 945 [2023-12-02 15:29:53,168 INFO L349 Elim1Store]: treesize reduction 40, result has 86.2 percent of original size [2023-12-02 15:29:53,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 761 treesize of output 767 [2023-12-02 15:29:53,380 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2023-12-02 15:29:53,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 447 treesize of output 515 [2023-12-02 15:29:53,418 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 237 treesize of output 235 [2023-12-02 15:29:53,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 15:29:57,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 15:29:57,067 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:29:57,067 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:29:57,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [727646498] [2023-12-02 15:29:57,069 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 15:29:57,070 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:29:57,070 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:29:57,070 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:29:57,070 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:29:57,076 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:29:57,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:29:57,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-12-02 15:29:57,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111935556] [2023-12-02 15:29:57,078 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-02 15:29:57,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 15:29:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:29:57,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 15:29:57,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:29:57,079 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:29:57,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:29:57,081 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 15:29:57,081 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 15:29:57,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 15:29:57,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:29:57,282 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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:29:57,284 INFO L158 Benchmark]: Toolchain (without parser) took 589800.85ms. Allocated memory was 144.7MB in the beginning and 524.3MB in the end (delta: 379.6MB). Free memory was 112.2MB in the beginning and 357.6MB in the end (delta: -245.4MB). Peak memory consumption was 136.6MB. Max. memory is 16.1GB. [2023-12-02 15:29:57,284 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 67.9MB in the beginning and 67.8MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:29:57,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.66ms. Allocated memory is still 144.7MB. Free memory was 112.2MB in the beginning and 93.7MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 15:29:57,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.74ms. Allocated memory is still 144.7MB. Free memory was 93.3MB in the beginning and 91.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:29:57,285 INFO L158 Benchmark]: Boogie Preprocessor took 32.31ms. Allocated memory is still 144.7MB. Free memory was 91.6MB in the beginning and 89.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:29:57,285 INFO L158 Benchmark]: RCFGBuilder took 344.43ms. Allocated memory is still 144.7MB. Free memory was 89.7MB in the beginning and 72.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 15:29:57,286 INFO L158 Benchmark]: TraceAbstraction took 589011.10ms. Allocated memory was 144.7MB in the beginning and 524.3MB in the end (delta: 379.6MB). Free memory was 72.3MB in the beginning and 357.6MB in the end (delta: -285.3MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2023-12-02 15:29:57,287 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 67.9MB in the beginning and 67.8MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.66ms. Allocated memory is still 144.7MB. Free memory was 112.2MB in the beginning and 93.7MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.74ms. Allocated memory is still 144.7MB. Free memory was 93.3MB in the beginning and 91.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.31ms. Allocated memory is still 144.7MB. Free memory was 91.6MB in the beginning and 89.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.43ms. Allocated memory is still 144.7MB. Free memory was 89.7MB in the beginning and 72.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 589011.10ms. Allocated memory was 144.7MB in the beginning and 524.3MB in the end (delta: 379.6MB). Free memory was 72.3MB in the beginning and 357.6MB in the end (delta: -285.3MB). Peak memory consumption was 96.8MB. 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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:29:58,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:29:59,064 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 15:29:59,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:29:59,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:29:59,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:29:59,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:29:59,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:29:59,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:29:59,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:29:59,101 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:29:59,102 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:29:59,102 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:29:59,103 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:29:59,103 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:29:59,104 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:29:59,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:29:59,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:29:59,106 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:29:59,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:29:59,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:29:59,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:29:59,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:29:59,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:29:59,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:29:59,109 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:29:59,110 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:29:59,110 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:29:59,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:29:59,111 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:29:59,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:29:59,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:29:59,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:29:59,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:29:59,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:29:59,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:29:59,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:29:59,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:29:59,114 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:29:59,114 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:29:59,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:29:59,114 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:29:59,115 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:29:59,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:29:59,115 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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 ! call(reach_error())) ) 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-12-02 15:29:59,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:29:59,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:29:59,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:29:59,410 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:29:59,410 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:29:59,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-12-02 15:30:02,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:30:02,405 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:30:02,406 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-12-02 15:30:02,420 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/data/db820dae8/8593b80af6874505aaca2eccf969f587/FLAG84a082411 [2023-12-02 15:30:02,435 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/data/db820dae8/8593b80af6874505aaca2eccf969f587 [2023-12-02 15:30:02,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:30:02,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:30:02,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:30:02,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:30:02,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:30:02,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56424e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02, skipping insertion in model container [2023-12-02 15:30:02,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,497 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:30:02,755 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-12-02 15:30:02,762 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-12-02 15:30:02,763 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-12-02 15:30:02,765 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-12-02 15:30:02,766 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-12-02 15:30:02,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-12-02 15:30:02,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:30:02,785 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:30:02,818 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-12-02 15:30:02,821 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-12-02 15:30:02,822 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-12-02 15:30:02,823 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-12-02 15:30:02,824 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-12-02 15:30:02,826 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-12-02 15:30:02,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:30:02,861 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:30:02,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02 WrapperNode [2023-12-02 15:30:02,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:30:02,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:30:02,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:30:02,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:30:02,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,909 INFO L138 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2023-12-02 15:30:02,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:30:02,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:30:02,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:30:02,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:30:02,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:30:02,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:30:02,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:30:02,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:30:02,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (1/1) ... [2023-12-02 15:30:02,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:30:02,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:30:02,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:30:02,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:30:03,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 15:30:03,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:30:03,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:30:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:30:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:30:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:30:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 15:30:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:30:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:30:03,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:30:03,135 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:30:03,138 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:30:04,150 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:30:04,176 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:30:04,176 INFO L309 CfgBuilder]: Removed 15 assume(true) statements. [2023-12-02 15:30:04,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:30:04 BoogieIcfgContainer [2023-12-02 15:30:04,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:30:04,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:30:04,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:30:04,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:30:04,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:30:02" (1/3) ... [2023-12-02 15:30:04,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@916fed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:30:04, skipping insertion in model container [2023-12-02 15:30:04,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:02" (2/3) ... [2023-12-02 15:30:04,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@916fed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:30:04, skipping insertion in model container [2023-12-02 15:30:04,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:30:04" (3/3) ... [2023-12-02 15:30:04,186 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-12-02 15:30:04,204 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:30:04,205 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-12-02 15:30:04,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:30:04,248 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@59eb764, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:30:04,249 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 15:30:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:30:04,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:04,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:30:04,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:30:04,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:04,265 INFO L85 PathProgramCache]: Analyzing trace with hash 178303299, now seen corresponding path program 1 times [2023-12-02 15:30:04,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:30:04,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240090342] [2023-12-02 15:30:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:04,283 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 15:30:04,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:30:04,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:04,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:04,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 15:30:04,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:04,439 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 15:30:04,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:30:04,440 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:30:04,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240090342] [2023-12-02 15:30:04,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240090342] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:04,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:04,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:30:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522310204] [2023-12-02 15:30:04,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:04,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:30:04,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:30:04,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:30:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:30:04,477 INFO L87 Difference]: Start difference. First operand has 41 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:04,534 INFO L93 Difference]: Finished difference Result 81 states and 127 transitions. [2023-12-02 15:30:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:30:04,536 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 15:30:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:04,543 INFO L225 Difference]: With dead ends: 81 [2023-12-02 15:30:04,544 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 15:30:04,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:30:04,550 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:04,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:30:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 15:30:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-02 15:30:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.25) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-12-02 15:30:04,584 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 5 [2023-12-02 15:30:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:04,584 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-12-02 15:30:04,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-12-02 15:30:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:30:04,585 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:04,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:30:04,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:04,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:04,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:30:04,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash 177536678, now seen corresponding path program 1 times [2023-12-02 15:30:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:30:04,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031354701] [2023-12-02 15:30:04,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:04,788 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 15:30:04,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:30:04,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:04,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:04,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:30:04,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:04,973 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 15:30:05,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:30:05,046 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:30:05,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 15:30:05,056 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 15:30:05,057 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:30:05,057 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:30:05,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031354701] [2023-12-02 15:30:05,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031354701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:05,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:05,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:30:05,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938430255] [2023-12-02 15:30:05,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:05,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:30:05,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:30:05,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:30:05,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:30:05,061 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:06,814 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2023-12-02 15:30:06,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:30:06,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 15:30:06,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:06,815 INFO L225 Difference]: With dead ends: 38 [2023-12-02 15:30:06,816 INFO L226 Difference]: Without dead ends: 36 [2023-12-02 15:30:06,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:30:06,817 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:06,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 15:30:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-02 15:30:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-02 15:30:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-12-02 15:30:06,825 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 5 [2023-12-02 15:30:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:06,826 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-12-02 15:30:06,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-12-02 15:30:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:30:06,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:06,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:30:06,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:07,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:07,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:30:07,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1208626208, now seen corresponding path program 1 times [2023-12-02 15:30:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:30:07,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056737269] [2023-12-02 15:30:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:07,032 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 15:30:07,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:30:07,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:07,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:07,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:30:07,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:07,171 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 15:30:07,172 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:30:07,172 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:30:07,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056737269] [2023-12-02 15:30:07,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056737269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:07,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:07,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:30:07,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786135980] [2023-12-02 15:30:07,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:07,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:30:07,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:30:07,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:30:07,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:30:07,173 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:07,469 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2023-12-02 15:30:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:30:07,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-12-02 15:30:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:07,471 INFO L225 Difference]: With dead ends: 62 [2023-12-02 15:30:07,471 INFO L226 Difference]: Without dead ends: 60 [2023-12-02 15:30:07,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 15:30:07,473 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:07,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 44 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:30:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-02 15:30:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2023-12-02 15:30:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2023-12-02 15:30:07,482 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 6 [2023-12-02 15:30:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:07,482 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2023-12-02 15:30:07,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2023-12-02 15:30:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:30:07,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:07,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:07,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:30:07,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:07,687 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:30:07,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1556646194, now seen corresponding path program 1 times [2023-12-02 15:30:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:30:07,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635869548] [2023-12-02 15:30:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:07,688 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 15:30:07,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:30:07,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:07,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:07,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:30:07,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:07,823 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 15:30:07,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:30:07,824 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:30:07,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635869548] [2023-12-02 15:30:07,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635869548] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:07,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:07,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:30:07,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283672326] [2023-12-02 15:30:07,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:07,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:30:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:30:07,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:30:07,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:30:07,826 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 15:30:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:08,935 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-12-02 15:30:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:30:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 15:30:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:08,936 INFO L225 Difference]: With dead ends: 34 [2023-12-02 15:30:08,937 INFO L226 Difference]: Without dead ends: 32 [2023-12-02 15:30:08,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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 15:30:08,938 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:08,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 15:30:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-02 15:30:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-02 15:30:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-12-02 15:30:08,945 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2023-12-02 15:30:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:08,946 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-12-02 15:30:08,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 15:30:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-12-02 15:30:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:30:08,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:08,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:08,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:09,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:09,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:30:09,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1556683930, now seen corresponding path program 1 times [2023-12-02 15:30:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:30:09,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245083208] [2023-12-02 15:30:09,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:09,149 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 15:30:09,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:30:09,150 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:09,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:09,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 15:30:09,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:09,286 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 15:30:09,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:30:09,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:30:09,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-12-02 15:30:09,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 15:30:09,432 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 17 treesize of output 9 [2023-12-02 15:30:09,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:30:09,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:30:09,497 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 15:30:09,497 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:30:09,497 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:30:09,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245083208] [2023-12-02 15:30:09,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245083208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:09,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:09,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:30:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537981450] [2023-12-02 15:30:09,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:09,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:30:09,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:30:09,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:30:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:30:09,500 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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 15:30:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:11,681 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2023-12-02 15:30:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:30:11,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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 15:30:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:11,683 INFO L225 Difference]: With dead ends: 67 [2023-12-02 15:30:11,683 INFO L226 Difference]: Without dead ends: 43 [2023-12-02 15:30:11,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:30:11,685 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:11,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 15:30:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-02 15:30:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2023-12-02 15:30:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:30:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2023-12-02 15:30:11,694 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2023-12-02 15:30:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:11,695 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2023-12-02 15:30:11,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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 15:30:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2023-12-02 15:30:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:30:11,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:11,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:11,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:11,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:11,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:30:11,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1300437210, now seen corresponding path program 1 times [2023-12-02 15:30:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:30:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889444753] [2023-12-02 15:30:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:11,898 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 15:30:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:30:11,899 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:11,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:12,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 15:30:12,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:12,049 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 15:30:12,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:30:12,161 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 0 case distinctions, treesize of input 190 treesize of output 133 [2023-12-02 15:30:12,171 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 15:30:12,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:30:12,181 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 0 case distinctions, treesize of input 154 treesize of output 105 [2023-12-02 15:30:12,191 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 0 case distinctions, treesize of input 86 treesize of output 77 [2023-12-02 15:30:12,247 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-12-02 15:30:12,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 203 [2023-12-02 15:30:12,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:30:12,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:30:12,288 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-12-02 15:30:12,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 148 [2023-12-02 15:30:12,307 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 145 treesize of output 125 [2023-12-02 15:30:12,390 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-12-02 15:30:12,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 83 [2023-12-02 15:30:12,439 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-02 15:30:12,440 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 15:30:12,480 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-12-02 15:30:12,480 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 2 case distinctions, treesize of input 29 treesize of output 5 [2023-12-02 15:30:12,525 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:30:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889444753] [2023-12-02 15:30:12,526 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no need to replace index [2023-12-02 15:30:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [95433119] [2023-12-02 15:30:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:12,526 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:30:12,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:30:12,531 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:30:12,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-02 15:30:12,616 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5b7bf432 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:116) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1297) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:387) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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) [2023-12-02 15:30:12,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241423828] [2023-12-02 15:30:12,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:12,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:30:12,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:30:12,620 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:30:12,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 15:30:12,679 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5b7bf432 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:116) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1297) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:387) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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) [2023-12-02 15:30:12,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:12,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2023-12-02 15:30:12,680 ERROR L171 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2023-12-02 15:30:12,681 INFO L360 BasicCegarLoop]: Counterexample might be feasible [2023-12-02 15:30:12,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-12-02 15:30:12,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-02 15:30:12,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-12-02 15:30:12,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-12-02 15:30:12,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-12-02 15:30:12,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-02 15:30:12,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 15:30:12,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-02 15:30:13,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:13,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/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 15:30:13,292 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-02 15:30:13,294 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:30:13,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:30:13 BoogieIcfgContainer [2023-12-02 15:30:13,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:30:13,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:30:13,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:30:13,306 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:30:13,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:30:04" (3/4) ... [2023-12-02 15:30:13,308 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 15:30:13,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:30:13,309 INFO L158 Benchmark]: Toolchain (without parser) took 10870.00ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 92.4MB in the beginning and 59.2MB in the end (delta: 33.3MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2023-12-02 15:30:13,309 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 59.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:30:13,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.10ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 72.7MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 15:30:13,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.93ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 70.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:30:13,310 INFO L158 Benchmark]: Boogie Preprocessor took 36.44ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 68.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 15:30:13,310 INFO L158 Benchmark]: RCFGBuilder took 1229.43ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 85.8MB in the end (delta: -17.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2023-12-02 15:30:13,310 INFO L158 Benchmark]: TraceAbstraction took 9125.45ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 85.2MB in the beginning and 60.2MB in the end (delta: 25.0MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2023-12-02 15:30:13,311 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 142.6MB. Free memory is still 59.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:30:13,313 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.27ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 59.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.10ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 72.7MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.93ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 70.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.44ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 68.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1229.43ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 85.8MB in the end (delta: -17.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9125.45ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 85.2MB in the beginning and 60.2MB in the end (delta: 25.0MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 142.6MB. Free memory is still 59.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1037]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1004] SLL* head = malloc(sizeof(SLL)); [L1005] head->next = ((void*)0) [L1006] head->prev = ((void*)0) [L1007] head->data = 0 [L1009] SLL* x = head; [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1021] x->data = 1 [L1022] x->next = malloc(sizeof(SLL)) [L1023] EXPR x->next [L1023] x->next->prev = x [L1024] EXPR x->next [L1024] x->next->data = 2 [L1026] x = head [L1028] COND FALSE !(!(((void*)0) != x)) [L1030] EXPR x->data [L1030] COND FALSE !(1 != x->data) [L1035] EXPR x->data [L1035] COND FALSE !(!(1 == x->data)) [L1036] EXPR x->next [L1036] x = x->next [L1037] EXPR x->data [L1037] COND TRUE !(2 == x->data) [L1037] reach_error() - UnprovableResult [Line: 1019]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 333 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 151 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 143 SizeOfPredicates, 10 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-02 15:30:13,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbe5294c-ca25-42ec-a09e-8d73c392fd1b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN