./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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_ee55696f-006f-43eb-92d7-f09aec2f23e3/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 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:20:18,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:20:18,520 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:20:18,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:20:18,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:20:18,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:20:18,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:20:18,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:20:18,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:20:18,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:20:18,551 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:20:18,551 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:20:18,552 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:20:18,552 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:20:18,553 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:20:18,553 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:20:18,554 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:20:18,554 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:20:18,555 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:20:18,555 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:20:18,556 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:20:18,556 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:20:18,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:20:18,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:20:18,558 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:20:18,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:20:18,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:20:18,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:20:18,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:20:18,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:20:18,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:20:18,560 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:20:18,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:20:18,560 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:20:18,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:20:18,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:20:18,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:20:18,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:20:18,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:20:18,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:20:18,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:20:18,562 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:20:18,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:20:18,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:20:18,563 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:20:18,563 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:20:18,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:20:18,563 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_ee55696f-006f-43eb-92d7-f09aec2f23e3/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_ee55696f-006f-43eb-92d7-f09aec2f23e3/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 -> 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 [2023-12-02 15:20:18,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:20:18,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:20:18,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:20:18,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:20:18,815 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:20:18,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2023-12-02 15:20:21,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:20:21,764 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:20:21,765 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2023-12-02 15:20:21,774 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/data/423d6262e/62865997d079472d86b8b636fef56f28/FLAGe0450e21f [2023-12-02 15:20:21,791 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/data/423d6262e/62865997d079472d86b8b636fef56f28 [2023-12-02 15:20:21,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:20:21,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:20:21,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:20:21,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:20:21,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:20:21,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:20:21" (1/1) ... [2023-12-02 15:20:21,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2923b6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:21, skipping insertion in model container [2023-12-02 15:20:21,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:20:21" (1/1) ... [2023-12-02 15:20:21,834 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:20:21,984 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_ee55696f-006f-43eb-92d7-f09aec2f23e3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2023-12-02 15:20:22,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:20:22,046 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:20:22,059 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_ee55696f-006f-43eb-92d7-f09aec2f23e3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2023-12-02 15:20:22,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:20:22,101 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:20:22,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:22 WrapperNode [2023-12-02 15:20:22,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:20:22,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:20:22,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:20:22,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:20:22,109 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:22" (1/1) ... [2023-12-02 15:20:22,120 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:22" (1/1) ... [2023-12-02 15:20:22,152 INFO L138 Inliner]: procedures = 29, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 303 [2023-12-02 15:20:22,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:20:22,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:20:22,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:20:22,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:20:22,163 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:22" (1/1) ... [2023-12-02 15:20:22,163 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:22" (1/1) ... [2023-12-02 15:20:22,169 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:22" (1/1) ... [2023-12-02 15:20:22,170 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:22" (1/1) ... [2023-12-02 15:20:22,187 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:22" (1/1) ... [2023-12-02 15:20:22,192 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:22" (1/1) ... [2023-12-02 15:20:22,194 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:22" (1/1) ... [2023-12-02 15:20:22,196 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:22" (1/1) ... [2023-12-02 15:20:22,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:20:22,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:20:22,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:20:22,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:20:22,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:22" (1/1) ... [2023-12-02 15:20:22,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:20:22,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:20:22,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:22,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:20:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-12-02 15:20:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:20:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-12-02 15:20:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 15:20:22,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-12-02 15:20:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 15:20:22,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 15:20:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:20:22,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:20:22,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:20:22,370 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:20:22,372 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:20:22,701 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:20:23,099 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:20:23,099 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 15:20:23,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:20:23 BoogieIcfgContainer [2023-12-02 15:20:23,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:20:23,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:20:23,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:20:23,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:20:23,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:20:21" (1/3) ... [2023-12-02 15:20:23,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20829a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:20:23, skipping insertion in model container [2023-12-02 15:20:23,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:22" (2/3) ... [2023-12-02 15:20:23,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20829a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:20:23, skipping insertion in model container [2023-12-02 15:20:23,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:20:23" (3/3) ... [2023-12-02 15:20:23,109 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-9.i [2023-12-02 15:20:23,122 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:20:23,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:20:23,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:20:23,167 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;@6ebe77e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:20:23,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:20:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:20:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:20:23,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:23,177 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:23,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:20:23,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1141670329, now seen corresponding path program 1 times [2023-12-02 15:20:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:20:23,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39436839] [2023-12-02 15:20:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:20:23,359 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 15:20:23,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [534268682] [2023-12-02 15:20:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:23,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:20:23,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:20:23,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:20:23,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:20:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:20:23,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:20:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:20:24,210 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:20:24,213 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:20:24,214 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 15:20:24,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:20:24,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-02 15:20:24,420 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 15:20:24,423 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:20:24,451 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated [2023-12-02 15:20:24,452 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated [2023-12-02 15:20:24,452 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated [2023-12-02 15:20:24,453 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated [2023-12-02 15:20:24,454 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-12-02 15:20:24,454 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-12-02 15:20:24,454 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-12-02 15:20:24,454 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated [2023-12-02 15:20:24,455 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated [2023-12-02 15:20:24,455 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated [2023-12-02 15:20:24,455 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-12-02 15:20:24,456 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-12-02 15:20:24,456 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated [2023-12-02 15:20:24,456 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated [2023-12-02 15:20:24,456 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated [2023-12-02 15:20:24,456 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-12-02 15:20:24,457 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-12-02 15:20:24,457 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-12-02 15:20:24,457 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-12-02 15:20:24,458 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-12-02 15:20:24,458 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-12-02 15:20:24,459 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-12-02 15:20:24,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:20:24 BoogieIcfgContainer [2023-12-02 15:20:24,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:20:24,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:20:24,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:20:24,473 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:20:24,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:20:23" (3/4) ... [2023-12-02 15:20:24,475 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 15:20:24,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:20:24,477 INFO L158 Benchmark]: Toolchain (without parser) took 2681.78ms. Allocated memory is still 155.2MB. Free memory was 111.0MB in the beginning and 83.3MB in the end (delta: 27.7MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2023-12-02 15:20:24,478 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:20:24,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.47ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 97.0MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 15:20:24,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.47ms. Allocated memory is still 155.2MB. Free memory was 97.0MB in the beginning and 94.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:20:24,480 INFO L158 Benchmark]: Boogie Preprocessor took 47.25ms. Allocated memory is still 155.2MB. Free memory was 94.3MB in the beginning and 91.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:20:24,480 INFO L158 Benchmark]: RCFGBuilder took 900.30ms. Allocated memory is still 155.2MB. Free memory was 91.5MB in the beginning and 74.0MB in the end (delta: 17.5MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2023-12-02 15:20:24,481 INFO L158 Benchmark]: TraceAbstraction took 1368.98ms. Allocated memory is still 155.2MB. Free memory was 72.7MB in the beginning and 83.3MB in the end (delta: -10.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:20:24,481 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 155.2MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:20:24,484 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.21ms. Allocated memory is still 155.2MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.47ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 97.0MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.47ms. Allocated memory is still 155.2MB. Free memory was 97.0MB in the beginning and 94.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.25ms. Allocated memory is still 155.2MB. Free memory was 94.3MB in the beginning and 91.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 900.30ms. Allocated memory is still 155.2MB. Free memory was 91.5MB in the beginning and 74.0MB in the end (delta: 17.5MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1368.98ms. Allocated memory is still 155.2MB. Free memory was 72.7MB in the beginning and 83.3MB in the end (delta: -10.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 155.2MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of shiftLeft at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[2] = { 9.2, 0.975 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -16 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L37] double last_1_double_Array_0_0_ = 9.2; [L38] signed long int last_1_signed_long_int_Array_0_0_ = -16; [L39] signed short int last_1_signed_short_int_Array_0_0_ = 1; [L40] unsigned char last_1_unsigned_char_Array_0_2_ = 10; [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L81] EXPR double_Array_0[0] [L81] last_1_double_Array_0_0_ = double_Array_0[0] [L82] EXPR signed_long_int_Array_0[0] [L82] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L83] EXPR signed_short_int_Array_0[0] [L83] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L84] EXPR unsigned_char_Array_0[2] [L84] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] double_Array_0[1] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L75] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L77] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET updateVariables() [L96] CALL step() [L44] unsigned char stepLocal_0 = last_1_double_Array_0_0_ > last_1_double_Array_0_0_; [L45] COND TRUE ((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || stepLocal_0 [L46] EXPR unsigned_char_Array_0[1] [L46] EXPR ((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_) [L46] EXPR unsigned_char_Array_0[1] [L46] EXPR ((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_) [L46] signed_short_int_Array_0[0] = ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))) [L50] EXPR signed_short_int_Array_0[0] [L50] signed_long_int_Array_0[0] = signed_short_int_Array_0[0] [L51] EXPR signed_short_int_Array_0[0] [L51] EXPR 10 << signed_short_int_Array_0[0] [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0] [L51] COND FALSE !((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) [L54] unsigned_char_Array_0[0] = 64 [L55] EXPR double_Array_0[1] [L55] double_Array_0[0] = double_Array_0[1] [L56] EXPR signed_short_int_Array_0[0] [L56] COND FALSE !(signed_short_int_Array_0[0] <= 16) [L59] EXPR double_Array_0[0] [L59] EXPR double_Array_0[0] [L59] EXPR ((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]) [L59] EXPR double_Array_0[0] [L59] EXPR ((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]) [L59] EXPR double_Array_0[0] [L59] COND FALSE !(((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) [L66] EXPR unsigned_char_Array_0[1] [L66] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR (signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) [L87] EXPR double_Array_0[0] [L87] EXPR double_Array_0[0] [L87] EXPR ((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]) [L87] EXPR double_Array_0[0] [L87] EXPR ((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]) [L87] EXPR double_Array_0[0] [L87] EXPR (((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) [L87] EXPR unsigned_char_Array_0[2] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR (((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) [L87] EXPR (signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR 10 << signed_short_int_Array_0[0] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR ((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1 [L87] EXPR signed_short_int_Array_0[1] [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR ((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1 [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) [L87] EXPR (((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64)) [L87] EXPR ((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1])) [L87] EXPR (((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) [L87] EXPR ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) [L87-L88] return ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 1, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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:20:24,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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_ee55696f-006f-43eb-92d7-f09aec2f23e3/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 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:20:26,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:20:26,504 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 15:20:26,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:20:26,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:20:26,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:20:26,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:20:26,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:20:26,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:20:26,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:20:26,540 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:20:26,541 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:20:26,541 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:20:26,542 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:20:26,542 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:20:26,543 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:20:26,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:20:26,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:20:26,545 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:20:26,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:20:26,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:20:26,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:20:26,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:20:26,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:20:26,548 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:20:26,548 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:20:26,549 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:20:26,549 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:20:26,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:20:26,550 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:20:26,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:20:26,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:20:26,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:20:26,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:20:26,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:20:26,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:20:26,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:20:26,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:20:26,552 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:20:26,553 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:20:26,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:20:26,553 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:20:26,553 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:20:26,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:20:26,554 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_ee55696f-006f-43eb-92d7-f09aec2f23e3/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_ee55696f-006f-43eb-92d7-f09aec2f23e3/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 -> 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 [2023-12-02 15:20:26,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:20:26,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:20:26,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:20:26,850 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:20:26,851 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:20:26,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2023-12-02 15:20:29,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:20:29,869 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:20:29,869 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2023-12-02 15:20:29,879 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/data/24932d4d0/b9998e7159c44521a6c955cb4dd39849/FLAG3843633fd [2023-12-02 15:20:29,894 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/data/24932d4d0/b9998e7159c44521a6c955cb4dd39849 [2023-12-02 15:20:29,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:20:29,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:20:29,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:20:29,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:20:29,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:20:29,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:20:29" (1/1) ... [2023-12-02 15:20:29,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2bbec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:29, skipping insertion in model container [2023-12-02 15:20:29,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:20:29" (1/1) ... [2023-12-02 15:20:29,937 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:20:30,086 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_ee55696f-006f-43eb-92d7-f09aec2f23e3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2023-12-02 15:20:30,137 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:20:30,152 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:20:30,165 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_ee55696f-006f-43eb-92d7-f09aec2f23e3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2023-12-02 15:20:30,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:20:30,223 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:20:30,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:30 WrapperNode [2023-12-02 15:20:30,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:20:30,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:20:30,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:20:30,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:20:30,232 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:30" (1/1) ... [2023-12-02 15:20:30,249 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:30" (1/1) ... [2023-12-02 15:20:30,283 INFO L138 Inliner]: procedures = 36, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 294 [2023-12-02 15:20:30,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:20:30,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:20:30,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:20:30,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:20:30,295 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:30" (1/1) ... [2023-12-02 15:20:30,296 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:30" (1/1) ... [2023-12-02 15:20:30,304 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:30" (1/1) ... [2023-12-02 15:20:30,305 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:30" (1/1) ... [2023-12-02 15:20:30,326 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:30" (1/1) ... [2023-12-02 15:20:30,331 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:30" (1/1) ... [2023-12-02 15:20:30,335 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:30" (1/1) ... [2023-12-02 15:20:30,338 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:30" (1/1) ... [2023-12-02 15:20:30,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:20:30,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:20:30,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:20:30,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:20:30,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:30" (1/1) ... [2023-12-02 15:20:30,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:20:30,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:20:30,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:30,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:20:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-12-02 15:20:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-12-02 15:20:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 15:20:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-12-02 15:20:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:20:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-12-02 15:20:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-12-02 15:20:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 15:20:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-12-02 15:20:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 15:20:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 15:20:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:20:30,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:20:30,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-12-02 15:20:30,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-12-02 15:20:30,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 15:20:30,526 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:20:30,528 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:20:31,090 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:20:31,146 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:20:31,146 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 15:20:31,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:20:31 BoogieIcfgContainer [2023-12-02 15:20:31,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:20:31,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:20:31,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:20:31,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:20:31,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:20:29" (1/3) ... [2023-12-02 15:20:31,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a06b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:20:31, skipping insertion in model container [2023-12-02 15:20:31,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:20:30" (2/3) ... [2023-12-02 15:20:31,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a06b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:20:31, skipping insertion in model container [2023-12-02 15:20:31,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:20:31" (3/3) ... [2023-12-02 15:20:31,154 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-9.i [2023-12-02 15:20:31,168 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:20:31,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:20:31,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:20:31,213 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;@52154fd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:20:31,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:20:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:20:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 15:20:31,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:31,226 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:31,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:20:31,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:31,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1212209025, now seen corresponding path program 1 times [2023-12-02 15:20:31,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:20:31,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372321668] [2023-12-02 15:20:31,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:31,243 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:20:31,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:20:31,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:31,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:31,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 15:20:31,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 15:20:31,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:20:31,517 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:20:31,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372321668] [2023-12-02 15:20:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372321668] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:31,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:20:31,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114208107] [2023-12-02 15:20:31,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:31,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:20:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:20:31,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:20:31,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:20:31,552 INFO L87 Difference]: Start difference. First operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:20:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:31,594 INFO L93 Difference]: Finished difference Result 123 states and 187 transitions. [2023-12-02 15:20:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:20:31,596 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-12-02 15:20:31,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:31,602 INFO L225 Difference]: With dead ends: 123 [2023-12-02 15:20:31,602 INFO L226 Difference]: Without dead ends: 61 [2023-12-02 15:20:31,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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:31,608 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:31,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:20:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-02 15:20:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-02 15:20:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:20:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2023-12-02 15:20:31,642 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 55 [2023-12-02 15:20:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:31,643 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2023-12-02 15:20:31,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:20:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2023-12-02 15:20:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 15:20:31,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:31,646 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:31,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:31,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:31,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:20:31,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:31,848 INFO L85 PathProgramCache]: Analyzing trace with hash -428638785, now seen corresponding path program 1 times [2023-12-02 15:20:31,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:20:31,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273933249] [2023-12-02 15:20:31,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:31,849 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:20:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:20:31,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:31,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:32,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:20:32,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 15:20:32,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:20:32,120 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:20:32,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273933249] [2023-12-02 15:20:32,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273933249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:32,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:32,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:20:32,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720374731] [2023-12-02 15:20:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:32,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:20:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:20:32,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:20:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:20:32,125 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:20:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:32,248 INFO L93 Difference]: Finished difference Result 127 states and 182 transitions. [2023-12-02 15:20:32,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:20:32,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-12-02 15:20:32,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:32,250 INFO L225 Difference]: With dead ends: 127 [2023-12-02 15:20:32,250 INFO L226 Difference]: Without dead ends: 67 [2023-12-02 15:20:32,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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:32,253 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 10 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:32,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 238 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:20:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-02 15:20:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2023-12-02 15:20:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:20:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2023-12-02 15:20:32,264 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 55 [2023-12-02 15:20:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:32,265 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2023-12-02 15:20:32,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:20:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2023-12-02 15:20:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 15:20:32,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:32,268 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:32,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:32,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:32,473 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:20:32,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:32,473 INFO L85 PathProgramCache]: Analyzing trace with hash -852285507, now seen corresponding path program 1 times [2023-12-02 15:20:32,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:20:32,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96828607] [2023-12-02 15:20:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:32,475 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:20:32,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:20:32,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:32,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:32,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:20:32,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:20:32,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:20:32,729 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:20:32,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96828607] [2023-12-02 15:20:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96828607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:32,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:32,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:20:32,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229163078] [2023-12-02 15:20:32,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:32,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:20:32,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:20:32,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:20:32,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:20:32,733 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:20:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:32,805 INFO L93 Difference]: Finished difference Result 149 states and 212 transitions. [2023-12-02 15:20:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:20:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-02 15:20:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:32,807 INFO L225 Difference]: With dead ends: 149 [2023-12-02 15:20:32,807 INFO L226 Difference]: Without dead ends: 87 [2023-12-02 15:20:32,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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:32,810 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:32,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 249 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:20:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-02 15:20:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2023-12-02 15:20:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:20:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2023-12-02 15:20:32,820 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 55 [2023-12-02 15:20:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:32,820 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2023-12-02 15:20:32,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:20:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2023-12-02 15:20:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 15:20:32,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:32,823 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:32,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 15:20:33,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:33,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:20:33,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1245312517, now seen corresponding path program 1 times [2023-12-02 15:20:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:20:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248324720] [2023-12-02 15:20:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:33,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:20:33,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:20:33,031 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:33,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:33,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:20:33,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:20:33,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:20:33,295 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:20:33,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248324720] [2023-12-02 15:20:33,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248324720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:33,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:33,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:20:33,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825108501] [2023-12-02 15:20:33,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:33,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:20:33,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:20:33,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:20:33,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:20:33,298 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:20:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:33,404 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2023-12-02 15:20:33,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:20:33,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-02 15:20:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:33,407 INFO L225 Difference]: With dead ends: 160 [2023-12-02 15:20:33,407 INFO L226 Difference]: Without dead ends: 96 [2023-12-02 15:20:33,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:20:33,409 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 69 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:33,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 342 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:20:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-02 15:20:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 67. [2023-12-02 15:20:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:20:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2023-12-02 15:20:33,418 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 55 [2023-12-02 15:20:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:33,418 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2023-12-02 15:20:33,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:20:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2023-12-02 15:20:33,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 15:20:33,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:33,420 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:33,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:33,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:33,625 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:20:33,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2054659143, now seen corresponding path program 1 times [2023-12-02 15:20:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:20:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221270582] [2023-12-02 15:20:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:33,626 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:20:33,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:20:33,627 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:33,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:33,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:20:33,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:20:33,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:20:33,842 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:20:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221270582] [2023-12-02 15:20:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221270582] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:33,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:20:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178477734] [2023-12-02 15:20:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:33,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:20:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:20:33,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:20:33,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:20:33,845 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:20:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:34,056 INFO L93 Difference]: Finished difference Result 154 states and 213 transitions. [2023-12-02 15:20:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 15:20:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-02 15:20:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:34,058 INFO L225 Difference]: With dead ends: 154 [2023-12-02 15:20:34,058 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 15:20:34,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-02 15:20:34,060 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 34 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:34,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 446 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:20:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 15:20:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2023-12-02 15:20:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:20:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2023-12-02 15:20:34,069 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 55 [2023-12-02 15:20:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:34,069 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2023-12-02 15:20:34,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:20:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2023-12-02 15:20:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 15:20:34,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:34,071 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:34,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:34,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:34,272 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:20:34,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:34,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2054599561, now seen corresponding path program 1 times [2023-12-02 15:20:34,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:20:34,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049414638] [2023-12-02 15:20:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:34,273 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:20:34,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:20:34,274 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:34,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:34,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 15:20:34,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:34,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-12-02 15:20:34,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:34,574 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 66 treesize of output 30 [2023-12-02 15:20:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:20:34,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:20:34,599 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:20:34,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049414638] [2023-12-02 15:20:34,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049414638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:34,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:20:34,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:20:34,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714336898] [2023-12-02 15:20:34,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:34,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:20:34,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:20:34,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:20:34,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:20:34,602 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:20:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:20:35,138 INFO L93 Difference]: Finished difference Result 165 states and 225 transitions. [2023-12-02 15:20:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:20:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-02 15:20:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:20:35,140 INFO L225 Difference]: With dead ends: 165 [2023-12-02 15:20:35,140 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 15:20:35,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:20:35,142 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 92 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:20:35,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 207 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:20:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 15:20:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2023-12-02 15:20:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:20:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2023-12-02 15:20:35,151 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 55 [2023-12-02 15:20:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:20:35,151 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2023-12-02 15:20:35,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:20:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2023-12-02 15:20:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 15:20:35,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:20:35,153 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:20:35,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:35,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:35,354 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:20:35,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:20:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash 757046272, now seen corresponding path program 1 times [2023-12-02 15:20:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:20:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410558673] [2023-12-02 15:20:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:35,355 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:20:35,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:20:35,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:20:35,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 15:20:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:35,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 15:20:35,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:35,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2023-12-02 15:20:36,915 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 131 treesize of output 102 [2023-12-02 15:20:37,566 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 131 treesize of output 102 [2023-12-02 15:20:37,616 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 131 treesize of output 102 [2023-12-02 15:20:37,753 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 131 treesize of output 102 [2023-12-02 15:20:37,872 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 203 treesize of output 157 [2023-12-02 15:20:37,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:37,889 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 1 case distinctions, treesize of input 157 treesize of output 102 [2023-12-02 15:20:38,061 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 161 treesize of output 134 [2023-12-02 15:20:38,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:38,666 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 346 treesize of output 144 [2023-12-02 15:20:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 15:20:38,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:20:39,248 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_149 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse6 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_149) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_153) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|))))))) is different from false [2023-12-02 15:20:39,286 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_149 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64))) (let ((.cse6 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_148))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_149) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_153) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2023-12-02 15:20:39,330 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_149 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64))) (let ((.cse8 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_147) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_148))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_149) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_153) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2023-12-02 15:20:39,407 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:20:39,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410558673] [2023-12-02 15:20:39,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410558673] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:20:39,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [852522961] [2023-12-02 15:20:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:39,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:20:39,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:20:39,409 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:20:39,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-02 15:20:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:40,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 15:20:40,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:40,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 15:20:41,769 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 113 treesize of output 82 [2023-12-02 15:20:42,347 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 113 treesize of output 82 [2023-12-02 15:20:42,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 82 [2023-12-02 15:20:42,561 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 113 treesize of output 82 [2023-12-02 15:20:42,710 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 171 treesize of output 123 [2023-12-02 15:20:42,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 100 [2023-12-02 15:20:42,955 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 174 treesize of output 127 [2023-12-02 15:20:43,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 139 [2023-12-02 15:20:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 15:20:43,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:20:43,858 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_153 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (v_ArrVal_180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (not (= (let ((.cse0 (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_180) |c_~#double_Array_0~0.base|))) (concat (select .cse1 .cse2) (select .cse1 .cse3))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base|) |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_153) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 15:20:44,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [852522961] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:20:44,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141437544] [2023-12-02 15:20:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:20:44,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:20:44,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:20:44,571 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:20:44,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 15:20:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:20:44,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 15:20:44,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:20:45,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2023-12-02 15:20:48,431 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 131 treesize of output 102 [2023-12-02 15:20:48,947 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 131 treesize of output 102 [2023-12-02 15:20:48,992 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 131 treesize of output 102 [2023-12-02 15:20:49,030 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 131 treesize of output 102 [2023-12-02 15:20:49,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 172 [2023-12-02 15:20:49,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 169 [2023-12-02 15:20:49,064 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 9 treesize of output 8 [2023-12-02 15:20:49,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:49,075 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 1 case distinctions, treesize of input 157 treesize of output 102 [2023-12-02 15:20:49,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 140 [2023-12-02 15:20:49,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:20:49,852 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 346 treesize of output 144 [2023-12-02 15:20:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 15:20:49,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:20:49,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141437544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:20:49,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:20:49,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12, 12] total 26 [2023-12-02 15:20:49,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045730135] [2023-12-02 15:20:49,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:20:49,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:20:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:20:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:20:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=769, Unknown=35, NotChecked=244, Total=1190 [2023-12-02 15:20:49,878 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:21:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:00,458 INFO L93 Difference]: Finished difference Result 211 states and 286 transitions. [2023-12-02 15:21:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 15:21:00,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-12-02 15:21:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:00,460 INFO L225 Difference]: With dead ends: 211 [2023-12-02 15:21:00,460 INFO L226 Difference]: Without dead ends: 139 [2023-12-02 15:21:00,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=221, Invalid=1159, Unknown=42, NotChecked=300, Total=1722 [2023-12-02 15:21:00,462 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 258 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 16 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:00,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 351 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 615 Invalid, 15 Unknown, 0 Unchecked, 6.9s Time] [2023-12-02 15:21:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-02 15:21:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 114. [2023-12-02 15:21:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 15:21:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 157 transitions. [2023-12-02 15:21:00,477 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 157 transitions. Word has length 57 [2023-12-02 15:21:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:00,477 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 157 transitions. [2023-12-02 15:21:00,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:21:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2023-12-02 15:21:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 15:21:00,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:00,479 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:00,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-12-02 15:21:00,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 15:21:00,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 15:21:01,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:21:01,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:01,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:01,081 INFO L85 PathProgramCache]: Analyzing trace with hash -52300354, now seen corresponding path program 1 times [2023-12-02 15:21:01,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:01,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781418675] [2023-12-02 15:21:01,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:01,081 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:21:01,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:01,082 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:01,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 15:21:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:01,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:21:01,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:01,486 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 17 treesize of output 17 [2023-12-02 15:21:01,489 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 17 treesize of output 12 [2023-12-02 15:21:01,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-12-02 15:21:01,539 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 34 treesize of output 22 [2023-12-02 15:21:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:21:01,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:01,553 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:01,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781418675] [2023-12-02 15:21:01,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781418675] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:01,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:01,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:21:01,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248034202] [2023-12-02 15:21:01,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:01,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:21:01,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:01,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:21:01,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:21:01,555 INFO L87 Difference]: Start difference. First operand 114 states and 157 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:02,004 INFO L93 Difference]: Finished difference Result 231 states and 317 transitions. [2023-12-02 15:21:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:21:02,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2023-12-02 15:21:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:02,006 INFO L225 Difference]: With dead ends: 231 [2023-12-02 15:21:02,006 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 15:21:02,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:21:02,007 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 118 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:02,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 143 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:21:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 15:21:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2023-12-02 15:21:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 15:21:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2023-12-02 15:21:02,019 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 57 [2023-12-02 15:21:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:02,019 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2023-12-02 15:21:02,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2023-12-02 15:21:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 15:21:02,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:02,020 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:02,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-02 15:21:02,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:02,221 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:02,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:02,221 INFO L85 PathProgramCache]: Analyzing trace with hash -445327364, now seen corresponding path program 1 times [2023-12-02 15:21:02,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:02,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108035948] [2023-12-02 15:21:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:02,222 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:21:02,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:02,223 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:02,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 15:21:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:02,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 15:21:02,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:02,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:21:02,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 15:21:02,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:21:02,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-12-02 15:21:03,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 43 [2023-12-02 15:21:03,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2023-12-02 15:21:03,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:03,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 51 [2023-12-02 15:21:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:21:03,331 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:03,331 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:03,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108035948] [2023-12-02 15:21:03,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108035948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:03,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 15:21:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528928011] [2023-12-02 15:21:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:03,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:21:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:21:03,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:21:03,332 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:06,062 INFO L93 Difference]: Finished difference Result 561 states and 756 transitions. [2023-12-02 15:21:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 15:21:06,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2023-12-02 15:21:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:06,065 INFO L225 Difference]: With dead ends: 561 [2023-12-02 15:21:06,065 INFO L226 Difference]: Without dead ends: 448 [2023-12-02 15:21:06,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2023-12-02 15:21:06,066 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 533 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:06,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 358 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-02 15:21:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-12-02 15:21:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 271. [2023-12-02 15:21:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 250 states have (on average 1.36) internal successors, (340), 250 states have internal predecessors, (340), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 15:21:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 372 transitions. [2023-12-02 15:21:06,083 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 372 transitions. Word has length 57 [2023-12-02 15:21:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:06,084 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 372 transitions. [2023-12-02 15:21:06,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 372 transitions. [2023-12-02 15:21:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 15:21:06,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:06,085 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:06,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-02 15:21:06,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:06,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:06,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1262975814, now seen corresponding path program 1 times [2023-12-02 15:21:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443566146] [2023-12-02 15:21:06,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:06,286 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:21:06,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:06,287 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:06,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 15:21:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:06,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 15:21:06,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:06,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:21:06,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 15:21:06,990 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 14 treesize of output 10 [2023-12-02 15:21:07,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:21:07,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2023-12-02 15:21:07,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2023-12-02 15:21:07,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:07,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2023-12-02 15:21:07,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:07,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 41 [2023-12-02 15:21:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:21:07,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:07,528 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:07,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443566146] [2023-12-02 15:21:07,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443566146] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:07,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:07,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:21:07,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144982970] [2023-12-02 15:21:07,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:07,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:21:07,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:07,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:21:07,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:21:07,530 INFO L87 Difference]: Start difference. First operand 271 states and 372 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:10,203 INFO L93 Difference]: Finished difference Result 660 states and 893 transitions. [2023-12-02 15:21:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:21:10,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2023-12-02 15:21:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:10,205 INFO L225 Difference]: With dead ends: 660 [2023-12-02 15:21:10,206 INFO L226 Difference]: Without dead ends: 390 [2023-12-02 15:21:10,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:21:10,207 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 281 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:10,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 289 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 15:21:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-12-02 15:21:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 265. [2023-12-02 15:21:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 244 states have (on average 1.3524590163934427) internal successors, (330), 244 states have internal predecessors, (330), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 15:21:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 362 transitions. [2023-12-02 15:21:10,227 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 362 transitions. Word has length 57 [2023-12-02 15:21:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:10,227 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 362 transitions. [2023-12-02 15:21:10,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 362 transitions. [2023-12-02 15:21:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 15:21:10,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:10,229 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:10,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 15:21:10,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:10,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:10,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1685530232, now seen corresponding path program 1 times [2023-12-02 15:21:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:10,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339908287] [2023-12-02 15:21:10,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:10,433 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:21:10,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:10,434 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:10,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 15:21:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:10,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:21:10,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:10,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:10,838 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 175 treesize of output 67 [2023-12-02 15:21:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:21:10,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:21:11,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:11,132 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 113 treesize of output 1 [2023-12-02 15:21:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 15:21:11,136 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339908287] [2023-12-02 15:21:11,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339908287] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:21:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [267906338] [2023-12-02 15:21:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:11,136 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:21:11,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:21:11,137 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:21:11,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-02 15:21:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:11,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 15:21:11,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:11,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:11,896 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 175 treesize of output 67 [2023-12-02 15:21:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:21:11,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:21:11,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:11,999 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 113 treesize of output 1 [2023-12-02 15:21:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 15:21:12,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [267906338] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:21:12,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389271045] [2023-12-02 15:21:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:12,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:21:12,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:21:12,004 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:21:12,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 15:21:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:12,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:21:12,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:12,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:12,443 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 230 treesize of output 86 [2023-12-02 15:21:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:21:12,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:21:13,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:13,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 1 [2023-12-02 15:21:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 15:21:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389271045] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:21:13,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:21:13,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 8, 10, 9] total 16 [2023-12-02 15:21:13,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446658393] [2023-12-02 15:21:13,481 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:21:13,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 15:21:13,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:13,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 15:21:13,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-02 15:21:13,483 INFO L87 Difference]: Start difference. First operand 265 states and 362 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-02 15:21:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:15,069 INFO L93 Difference]: Finished difference Result 559 states and 759 transitions. [2023-12-02 15:21:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 15:21:15,070 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 59 [2023-12-02 15:21:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:15,072 INFO L225 Difference]: With dead ends: 559 [2023-12-02 15:21:15,072 INFO L226 Difference]: Without dead ends: 269 [2023-12-02 15:21:15,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2023-12-02 15:21:15,073 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:15,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 357 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 15:21:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-12-02 15:21:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2023-12-02 15:21:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 240 states have (on average 1.3416666666666666) internal successors, (322), 240 states have internal predecessors, (322), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 15:21:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 354 transitions. [2023-12-02 15:21:15,094 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 354 transitions. Word has length 59 [2023-12-02 15:21:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:15,094 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 354 transitions. [2023-12-02 15:21:15,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-02 15:21:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 354 transitions. [2023-12-02 15:21:15,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 15:21:15,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:15,096 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:15,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-02 15:21:15,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-02 15:21:15,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2023-12-02 15:21:15,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:21:15,697 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:15,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1770829936, now seen corresponding path program 1 times [2023-12-02 15:21:15,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:15,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197469645] [2023-12-02 15:21:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:15,698 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:21:15,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:15,699 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:15,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-02 15:21:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:15,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 15:21:15,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:15,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 17 treesize of output 9 [2023-12-02 15:21:16,350 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 14 treesize of output 10 [2023-12-02 15:21:16,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:21:16,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2023-12-02 15:21:16,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:16,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 62 [2023-12-02 15:21:16,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2023-12-02 15:21:16,592 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 0 case distinctions, treesize of input 57 treesize of output 49 [2023-12-02 15:21:17,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:17,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 40 [2023-12-02 15:21:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:21:17,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:17,121 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197469645] [2023-12-02 15:21:17,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197469645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:17,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:17,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 15:21:17,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138011514] [2023-12-02 15:21:17,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:17,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:21:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:17,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:21:17,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:21:17,123 INFO L87 Difference]: Start difference. First operand 261 states and 354 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:20,318 INFO L93 Difference]: Finished difference Result 395 states and 522 transitions. [2023-12-02 15:21:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:21:20,319 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-12-02 15:21:20,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:20,321 INFO L225 Difference]: With dead ends: 395 [2023-12-02 15:21:20,321 INFO L226 Difference]: Without dead ends: 393 [2023-12-02 15:21:20,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2023-12-02 15:21:20,322 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 358 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 17 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:20,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 294 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 477 Invalid, 8 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 15:21:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-12-02 15:21:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 263. [2023-12-02 15:21:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 242 states have internal predecessors, (324), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 15:21:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 356 transitions. [2023-12-02 15:21:20,344 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 356 transitions. Word has length 59 [2023-12-02 15:21:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:20,344 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 356 transitions. [2023-12-02 15:21:20,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 356 transitions. [2023-12-02 15:21:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 15:21:20,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:20,345 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:20,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-12-02 15:21:20,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:20,546 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:20,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1770770354, now seen corresponding path program 1 times [2023-12-02 15:21:20,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:20,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020555869] [2023-12-02 15:21:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:20,547 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:21:20,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:20,548 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:20,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-02 15:21:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:20,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 15:21:20,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:20,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:21:21,225 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 12 treesize of output 8 [2023-12-02 15:21:21,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:21:21,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2023-12-02 15:21:21,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2023-12-02 15:21:21,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-12-02 15:21:22,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:22,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 53 [2023-12-02 15:21:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:21:22,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:22,140 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:22,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020555869] [2023-12-02 15:21:22,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020555869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:22,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:22,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-02 15:21:22,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563158903] [2023-12-02 15:21:22,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:22,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 15:21:22,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:22,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 15:21:22,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-12-02 15:21:22,142 INFO L87 Difference]: Start difference. First operand 263 states and 356 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:25,471 INFO L93 Difference]: Finished difference Result 661 states and 882 transitions. [2023-12-02 15:21:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 15:21:25,472 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-12-02 15:21:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:25,474 INFO L225 Difference]: With dead ends: 661 [2023-12-02 15:21:25,474 INFO L226 Difference]: Without dead ends: 399 [2023-12-02 15:21:25,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=550, Unknown=0, NotChecked=0, Total=756 [2023-12-02 15:21:25,476 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 338 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:25,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 389 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-02 15:21:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-12-02 15:21:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 266. [2023-12-02 15:21:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 245 states have (on average 1.3346938775510204) internal successors, (327), 245 states have internal predecessors, (327), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 15:21:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 359 transitions. [2023-12-02 15:21:25,497 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 359 transitions. Word has length 59 [2023-12-02 15:21:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:25,498 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 359 transitions. [2023-12-02 15:21:25,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 359 transitions. [2023-12-02 15:21:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 15:21:25,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:25,499 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:25,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-02 15:21:25,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:25,700 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:25,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -958649553, now seen corresponding path program 1 times [2023-12-02 15:21:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939824532] [2023-12-02 15:21:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:25,701 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:21:25,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:25,702 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:25,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 15:21:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:25,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:21:25,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:25,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:25,882 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 91 treesize of output 31 [2023-12-02 15:21:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:21:25,900 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:25,901 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:25,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939824532] [2023-12-02 15:21:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939824532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:21:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736504643] [2023-12-02 15:21:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:25,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:21:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:21:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:25,902 INFO L87 Difference]: Start difference. First operand 266 states and 359 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:25,982 INFO L93 Difference]: Finished difference Result 597 states and 797 transitions. [2023-12-02 15:21:25,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:21:25,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-12-02 15:21:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:25,984 INFO L225 Difference]: With dead ends: 597 [2023-12-02 15:21:25,984 INFO L226 Difference]: Without dead ends: 332 [2023-12-02 15:21:25,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:25,985 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 32 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:25,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 167 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-12-02 15:21:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 266. [2023-12-02 15:21:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 245 states have (on average 1.310204081632653) internal successors, (321), 245 states have internal predecessors, (321), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 15:21:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 353 transitions. [2023-12-02 15:21:26,000 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 353 transitions. Word has length 59 [2023-12-02 15:21:26,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:26,001 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 353 transitions. [2023-12-02 15:21:26,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 353 transitions. [2023-12-02 15:21:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 15:21:26,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:26,002 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:26,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-02 15:21:26,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:26,204 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:26,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:26,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1747969841, now seen corresponding path program 1 times [2023-12-02 15:21:26,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:26,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453989214] [2023-12-02 15:21:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:26,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:21:26,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:26,207 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:26,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-02 15:21:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:26,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 15:21:26,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:26,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 15:21:26,681 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 18 treesize of output 13 [2023-12-02 15:21:26,697 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 18 treesize of output 10 [2023-12-02 15:21:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:21:26,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:26,721 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:26,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453989214] [2023-12-02 15:21:26,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453989214] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:26,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:21:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470276185] [2023-12-02 15:21:26,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:26,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:21:26,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:26,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:21:26,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:21:26,723 INFO L87 Difference]: Start difference. First operand 266 states and 353 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:28,685 INFO L93 Difference]: Finished difference Result 696 states and 905 transitions. [2023-12-02 15:21:28,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:21:28,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-12-02 15:21:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:28,688 INFO L225 Difference]: With dead ends: 696 [2023-12-02 15:21:28,688 INFO L226 Difference]: Without dead ends: 431 [2023-12-02 15:21:28,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:21:28,689 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 184 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:28,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 170 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 15:21:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-12-02 15:21:28,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 278. [2023-12-02 15:21:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 257 states have (on average 1.2957198443579767) internal successors, (333), 257 states have internal predecessors, (333), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 15:21:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 365 transitions. [2023-12-02 15:21:28,709 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 365 transitions. Word has length 59 [2023-12-02 15:21:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:28,709 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 365 transitions. [2023-12-02 15:21:28,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 365 transitions. [2023-12-02 15:21:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 15:21:28,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:28,711 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:28,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-02 15:21:28,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:28,913 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:28,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1375273281, now seen corresponding path program 1 times [2023-12-02 15:21:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:28,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346068736] [2023-12-02 15:21:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:28,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:21:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:28,915 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:28,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-02 15:21:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:29,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:21:29,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:29,105 INFO L349 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2023-12-02 15:21:29,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2023-12-02 15:21:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:21:29,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:29,273 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:29,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346068736] [2023-12-02 15:21:29,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346068736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:29,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:29,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:21:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504591659] [2023-12-02 15:21:29,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:29,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:21:29,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:29,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:21:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:29,275 INFO L87 Difference]: Start difference. First operand 278 states and 365 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:29,803 INFO L93 Difference]: Finished difference Result 709 states and 930 transitions. [2023-12-02 15:21:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:21:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-12-02 15:21:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:29,806 INFO L225 Difference]: With dead ends: 709 [2023-12-02 15:21:29,806 INFO L226 Difference]: Without dead ends: 432 [2023-12-02 15:21:29,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:21:29,807 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 53 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:29,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 251 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:21:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-12-02 15:21:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 413. [2023-12-02 15:21:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 382 states have (on average 1.2984293193717278) internal successors, (496), 382 states have internal predecessors, (496), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-02 15:21:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 544 transitions. [2023-12-02 15:21:29,838 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 544 transitions. Word has length 59 [2023-12-02 15:21:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:29,838 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 544 transitions. [2023-12-02 15:21:29,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:21:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 544 transitions. [2023-12-02 15:21:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 15:21:29,839 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:29,839 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:29,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-02 15:21:30,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:30,040 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:30,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1715950726, now seen corresponding path program 1 times [2023-12-02 15:21:30,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:30,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999795399] [2023-12-02 15:21:30,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:30,041 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:21:30,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:30,042 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:21:30,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-02 15:21:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:30,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 15:21:30,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:30,593 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 30 treesize of output 1 [2023-12-02 15:21:31,397 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 119 treesize of output 92 [2023-12-02 15:21:31,793 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 119 treesize of output 92 [2023-12-02 15:21:31,813 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 119 treesize of output 92 [2023-12-02 15:21:31,896 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 119 treesize of output 92 [2023-12-02 15:21:31,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 162 [2023-12-02 15:21:31,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 159 [2023-12-02 15:21:31,996 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 9 treesize of output 8 [2023-12-02 15:21:32,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:32,007 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 1 case distinctions, treesize of input 147 treesize of output 96 [2023-12-02 15:21:32,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 157 [2023-12-02 15:21:32,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:32,660 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 129 [2023-12-02 15:21:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:21:32,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:21:34,417 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_80| (_ BitVec 64)) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_487))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#unsigned_char_Array_0~0.base| (store (select .cse6 |c_~#unsigned_char_Array_0~0.base|) |~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_80|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_80|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_80|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_80|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_80|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2023-12-02 15:21:34,470 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_80| (_ BitVec 64)) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_486) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_487))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#unsigned_char_Array_0~0.base| (store (select .cse8 |c_~#unsigned_char_Array_0~0.base|) |~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_80|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_80|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_80|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_80|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_80|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2023-12-02 15:21:34,569 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999795399] [2023-12-02 15:21:34,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999795399] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:21:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [171394870] [2023-12-02 15:21:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:34,570 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:21:34,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:21:34,571 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:21:34,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 15:21:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:35,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 15:21:35,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:35,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 15:21:41,812 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 111 treesize of output 80 [2023-12-02 15:21:42,442 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 111 treesize of output 80 [2023-12-02 15:21:42,478 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 111 treesize of output 80 [2023-12-02 15:21:42,663 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 111 treesize of output 80 [2023-12-02 15:21:42,855 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 169 treesize of output 121 [2023-12-02 15:21:42,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 98 [2023-12-02 15:21:43,101 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 172 treesize of output 125 [2023-12-02 15:21:43,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 137 [2023-12-02 15:21:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:21:43,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:21:44,063 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_85| (_ BitVec 64))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_517) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_85|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_85|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_85|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_85|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_85|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2023-12-02 15:21:44,100 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_85| (_ BitVec 64)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_515))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_517) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_85|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_85|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_85|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_85|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_85|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2023-12-02 15:21:44,141 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_514 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_85| (_ BitVec 64)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_514) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_515))) (let ((.cse2 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_517) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_85|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_85|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_85|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_85|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_85|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2023-12-02 15:21:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [171394870] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:21:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452256895] [2023-12-02 15:21:44,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:44,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:21:44,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:21:44,208 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:21:44,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 15:21:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:44,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 15:21:44,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:44,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2023-12-02 15:21:53,069 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 129 treesize of output 100 [2023-12-02 15:21:53,606 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 129 treesize of output 100 [2023-12-02 15:21:53,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 100 [2023-12-02 15:21:57,890 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 129 treesize of output 100 [2023-12-02 15:22:04,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 170 [2023-12-02 15:22:04,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 167 [2023-12-02 15:22:04,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:22:04,172 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 1 case distinctions, treesize of input 155 treesize of output 100 [2023-12-02 15:22:04,219 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 9 treesize of output 8 [2023-12-02 15:22:04,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 157 [2023-12-02 15:22:04,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:22:04,761 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 129 [2023-12-02 15:22:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:22:04,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:22:04,862 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_548) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2023-12-02 15:22:06,032 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_80| (_ BitVec 64)) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_545))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#unsigned_char_Array_0~0.base| (store (select .cse6 |c_~#unsigned_char_Array_0~0.base|) |~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_80|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_80|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_80|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_80|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_80|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2023-12-02 15:22:06,079 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_80| (_ BitVec 64)) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_544) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_545))) (let ((.cse4 (bvadd |c_~#double_Array_0~0.offset| (_ bv12 32))) (.cse7 (select (store .cse6 |c_~#unsigned_char_Array_0~0.base| (store (select .cse6 |c_~#unsigned_char_Array_0~0.base|) |~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_80|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_80|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_80|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_80|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_80|)))))))) is different from false [2023-12-02 15:22:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452256895] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:22:06,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:22:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 18] total 40 [2023-12-02 15:22:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282273451] [2023-12-02 15:22:06,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:22:06,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 15:22:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 15:22:06,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1672, Unknown=31, NotChecked=728, Total=2652 [2023-12-02 15:22:06,167 INFO L87 Difference]: Start difference. First operand 413 states and 544 transitions. Second operand has 41 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 37 states have internal predecessors, (98), 8 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 5 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-02 15:22:08,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:10,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:12,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:14,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:16,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:18,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:21,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:23,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:25,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:27,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:35,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:39,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:42,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:45,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:22:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:46,400 INFO L93 Difference]: Finished difference Result 772 states and 991 transitions. [2023-12-02 15:22:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 15:22:46,402 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 37 states have internal predecessors, (98), 8 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 5 states have call predecessors, (13), 8 states have call successors, (13) Word has length 59 [2023-12-02 15:22:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:46,404 INFO L225 Difference]: With dead ends: 772 [2023-12-02 15:22:46,404 INFO L226 Difference]: Without dead ends: 495 [2023-12-02 15:22:46,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 192 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=660, Invalid=3897, Unknown=31, NotChecked=1112, Total=5700 [2023-12-02 15:22:46,407 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 818 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 137 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:46,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 791 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1623 Invalid, 19 Unknown, 0 Unchecked, 36.3s Time] [2023-12-02 15:22:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2023-12-02 15:22:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 294. [2023-12-02 15:22:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 257 states have (on average 1.2373540856031129) internal successors, (318), 260 states have internal predecessors, (318), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-02 15:22:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 366 transitions. [2023-12-02 15:22:46,438 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 366 transitions. Word has length 59 [2023-12-02 15:22:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:46,438 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 366 transitions. [2023-12-02 15:22:46,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 37 states have internal predecessors, (98), 8 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 5 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-02 15:22:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 366 transitions. [2023-12-02 15:22:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 15:22:46,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:46,439 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:46,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-02 15:22:46,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 15:22:46,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-02 15:22:47,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:22:47,040 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:22:47,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:47,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1874183550, now seen corresponding path program 1 times [2023-12-02 15:22:47,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:47,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118663668] [2023-12-02 15:22:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:47,041 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:22:47,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:47,042 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:22:47,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-02 15:22:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:47,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:22:47,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:47,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:22:47,296 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 91 treesize of output 31 [2023-12-02 15:22:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:22:47,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:22:47,322 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118663668] [2023-12-02 15:22:47,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118663668] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:22:47,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:22:47,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:22:47,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562483513] [2023-12-02 15:22:47,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:22:47,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:22:47,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:47,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:22:47,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:22:47,324 INFO L87 Difference]: Start difference. First operand 294 states and 366 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:22:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:47,443 INFO L93 Difference]: Finished difference Result 537 states and 671 transitions. [2023-12-02 15:22:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:22:47,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2023-12-02 15:22:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:47,446 INFO L225 Difference]: With dead ends: 537 [2023-12-02 15:22:47,446 INFO L226 Difference]: Without dead ends: 294 [2023-12-02 15:22:47,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:22:47,447 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:47,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 151 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:22:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-12-02 15:22:47,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2023-12-02 15:22:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 257 states have (on average 1.2178988326848248) internal successors, (313), 260 states have internal predecessors, (313), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-02 15:22:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 361 transitions. [2023-12-02 15:22:47,480 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 361 transitions. Word has length 62 [2023-12-02 15:22:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:47,480 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 361 transitions. [2023-12-02 15:22:47,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:22:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 361 transitions. [2023-12-02 15:22:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 15:22:47,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:47,482 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:47,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-12-02 15:22:47,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:22:47,682 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:22:47,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1655328832, now seen corresponding path program 1 times [2023-12-02 15:22:47,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:47,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887375198] [2023-12-02 15:22:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:47,683 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:22:47,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:47,684 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:22:47,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-02 15:22:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:47,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 15:22:47,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:47,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-12-02 15:22:47,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:22:47,971 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 66 treesize of output 30 [2023-12-02 15:22:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:22:47,998 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:22:47,998 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887375198] [2023-12-02 15:22:47,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887375198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:22:47,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:22:47,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:22:47,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848378962] [2023-12-02 15:22:47,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:22:47,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:22:47,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:48,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:22:48,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:22:48,000 INFO L87 Difference]: Start difference. First operand 294 states and 361 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:22:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:48,705 INFO L93 Difference]: Finished difference Result 620 states and 758 transitions. [2023-12-02 15:22:48,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:22:48,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2023-12-02 15:22:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:48,713 INFO L225 Difference]: With dead ends: 620 [2023-12-02 15:22:48,713 INFO L226 Difference]: Without dead ends: 417 [2023-12-02 15:22:48,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:22:48,714 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 109 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:48,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 290 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 15:22:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-12-02 15:22:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 299. [2023-12-02 15:22:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 262 states have (on average 1.213740458015267) internal successors, (318), 265 states have internal predecessors, (318), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-02 15:22:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 366 transitions. [2023-12-02 15:22:48,739 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 366 transitions. Word has length 62 [2023-12-02 15:22:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:48,740 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 366 transitions. [2023-12-02 15:22:48,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:22:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 366 transitions. [2023-12-02 15:22:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 15:22:48,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:48,741 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:22:48,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-02 15:22:48,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:22:48,942 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:22:48,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1292207643, now seen corresponding path program 1 times [2023-12-02 15:22:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:48,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650601260] [2023-12-02 15:22:48,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:48,943 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:22:48,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:48,944 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:22:48,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-02 15:22:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:49,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:22:49,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:49,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:22:49,221 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 91 treesize of output 31 [2023-12-02 15:22:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:22:49,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:22:49,251 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:22:49,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650601260] [2023-12-02 15:22:49,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650601260] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:22:49,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:22:49,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:22:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960598572] [2023-12-02 15:22:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:22:49,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:22:49,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:22:49,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:22:49,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:22:49,252 INFO L87 Difference]: Start difference. First operand 299 states and 366 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:22:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:22:49,707 INFO L93 Difference]: Finished difference Result 554 states and 672 transitions. [2023-12-02 15:22:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:22:49,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2023-12-02 15:22:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:22:49,710 INFO L225 Difference]: With dead ends: 554 [2023-12-02 15:22:49,711 INFO L226 Difference]: Without dead ends: 328 [2023-12-02 15:22:49,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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:22:49,711 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 51 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:22:49,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 193 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:22:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-12-02 15:22:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 264. [2023-12-02 15:22:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 227 states have (on average 1.1806167400881058) internal successors, (268), 230 states have internal predecessors, (268), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-02 15:22:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 316 transitions. [2023-12-02 15:22:49,738 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 316 transitions. Word has length 64 [2023-12-02 15:22:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:22:49,738 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 316 transitions. [2023-12-02 15:22:49,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:22:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 316 transitions. [2023-12-02 15:22:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 15:22:49,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:22:49,740 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:22:49,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-02 15:22:49,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:22:49,940 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:22:49,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:22:49,940 INFO L85 PathProgramCache]: Analyzing trace with hash 862134133, now seen corresponding path program 1 times [2023-12-02 15:22:49,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:22:49,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997940458] [2023-12-02 15:22:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:22:49,941 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:22:49,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:22:49,942 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:22:49,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-02 15:22:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:22:50,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 15:22:50,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:22:50,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:22:53,449 INFO L349 Elim1Store]: treesize reduction 12, result has 82.6 percent of original size [2023-12-02 15:22:53,449 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 96 [2023-12-02 15:22:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 134 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-02 15:22:55,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:23:03,603 INFO L349 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2023-12-02 15:23:03,603 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 1 [2023-12-02 15:23:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-02 15:23:03,612 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:23:03,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997940458] [2023-12-02 15:23:03,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997940458] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 15:23:03,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:23:03,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 28 [2023-12-02 15:23:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066457368] [2023-12-02 15:23:03,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:23:03,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 15:23:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:23:03,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 15:23:03,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2023-12-02 15:23:03,614 INFO L87 Difference]: Start difference. First operand 264 states and 316 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 15:23:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:23:51,763 INFO L93 Difference]: Finished difference Result 748 states and 882 transitions. [2023-12-02 15:23:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-02 15:23:51,765 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 117 [2023-12-02 15:23:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:23:51,767 INFO L225 Difference]: With dead ends: 748 [2023-12-02 15:23:51,767 INFO L226 Difference]: Without dead ends: 567 [2023-12-02 15:23:51,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=640, Invalid=3650, Unknown=0, NotChecked=0, Total=4290 [2023-12-02 15:23:51,769 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 289 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:23:51,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 401 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2023-12-02 15:23:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2023-12-02 15:23:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 326. [2023-12-02 15:23:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 277 states have (on average 1.1552346570397112) internal successors, (320), 281 states have internal predecessors, (320), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-02 15:23:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 384 transitions. [2023-12-02 15:23:51,807 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 384 transitions. Word has length 117 [2023-12-02 15:23:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:23:51,807 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 384 transitions. [2023-12-02 15:23:51,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 15:23:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 384 transitions. [2023-12-02 15:23:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 15:23:51,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:23:51,808 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:23:51,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-12-02 15:23:52,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:23:52,009 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:23:52,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:23:52,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1048908425, now seen corresponding path program 1 times [2023-12-02 15:23:52,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:23:52,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296203433] [2023-12-02 15:23:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:23:52,010 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:23:52,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:23:52,011 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:23:52,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-02 15:23:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:23:52,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 15:23:52,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:23:52,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:23:52,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 15:23:53,117 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 14 treesize of output 10 [2023-12-02 15:23:53,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:23:53,268 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 0 case distinctions, treesize of input 74 treesize of output 59 [2023-12-02 15:23:53,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:23:53,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 84 [2023-12-02 15:23:53,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 69 [2023-12-02 15:23:53,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:23:53,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 79 [2023-12-02 15:23:54,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:23:54,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 55 [2023-12-02 15:23:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 20 proven. 115 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-02 15:23:55,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:23:55,953 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_696 (_ BitVec 32))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) v_ArrVal_696))) (.cse1 (select (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_694) |c_~#unsigned_char_Array_0~0.base|))) (or (not (= .cse0 ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) (not (bvslt (bvadd .cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_694) |c_~#unsigned_char_Array_0~0.base| (store .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) v_ArrVal_696)) |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|)))) (_ bv10 32)))))) is different from false [2023-12-02 15:23:59,357 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:23:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296203433] [2023-12-02 15:23:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296203433] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:23:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1087483972] [2023-12-02 15:23:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:23:59,358 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:23:59,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:23:59,359 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:23:59,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-12-02 15:24:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:24:00,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 15:24:00,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:24:00,759 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-12-02 15:24:00,759 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 25 treesize of output 22 [2023-12-02 15:24:01,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:24:01,681 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 12 treesize of output 8 [2023-12-02 15:24:01,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:24:01,975 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 0 case distinctions, treesize of input 53 treesize of output 43 [2023-12-02 15:24:01,982 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 39 treesize of output 33 [2023-12-02 15:24:02,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-12-02 15:24:02,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-12-02 15:24:02,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2023-12-02 15:24:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-02 15:24:06,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:24:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1087483972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:24:06,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:24:06,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 24 [2023-12-02 15:24:06,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85641656] [2023-12-02 15:24:06,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:24:06,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 15:24:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:24:06,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 15:24:06,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1041, Unknown=1, NotChecked=66, Total=1260 [2023-12-02 15:24:06,491 INFO L87 Difference]: Start difference. First operand 326 states and 384 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 14 states have internal predecessors, (72), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 15:24:09,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:11,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:13,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:15,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:17,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:20,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:22,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:24,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:27,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:29,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:31,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:33,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:35,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:38,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:24:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:24:39,454 INFO L93 Difference]: Finished difference Result 734 states and 866 transitions. [2023-12-02 15:24:39,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:24:39,455 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 14 states have internal predecessors, (72), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 117 [2023-12-02 15:24:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:24:39,458 INFO L225 Difference]: With dead ends: 734 [2023-12-02 15:24:39,458 INFO L226 Difference]: Without dead ends: 409 [2023-12-02 15:24:39,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=269, Invalid=1456, Unknown=1, NotChecked=80, Total=1806 [2023-12-02 15:24:39,460 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 212 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 23 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:24:39,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 348 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 701 Invalid, 14 Unknown, 0 Unchecked, 31.5s Time] [2023-12-02 15:24:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-12-02 15:24:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 326. [2023-12-02 15:24:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 277 states have (on average 1.151624548736462) internal successors, (319), 281 states have internal predecessors, (319), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-02 15:24:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 383 transitions. [2023-12-02 15:24:39,501 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 383 transitions. Word has length 117 [2023-12-02 15:24:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:24:39,502 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 383 transitions. [2023-12-02 15:24:39,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 14 states have internal predecessors, (72), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 15:24:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 383 transitions. [2023-12-02 15:24:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 15:24:39,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:24:39,503 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:24:39,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2023-12-02 15:24:39,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-12-02 15:24:39,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:24:39,904 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:24:39,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:24:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2103556405, now seen corresponding path program 1 times [2023-12-02 15:24:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:24:39,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037246986] [2023-12-02 15:24:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:24:39,905 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:24:39,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:24:39,905 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:24:39,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-02 15:24:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:24:40,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 15:24:40,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:24:40,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:24:41,032 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 14 treesize of output 10 [2023-12-02 15:24:41,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:24:41,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 15:24:41,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-12-02 15:24:41,616 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 37 treesize of output 17 [2023-12-02 15:24:42,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 15:24:42,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2023-12-02 15:24:42,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2023-12-02 15:24:42,728 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 0 case distinctions, treesize of input 131 treesize of output 102 [2023-12-02 15:24:43,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 165 [2023-12-02 15:24:43,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 174 [2023-12-02 15:24:43,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:43,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 125 [2023-12-02 15:24:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 131 proven. 4 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-02 15:24:43,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:24:43,475 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_795) |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32)))) is different from false [2023-12-02 15:25:06,519 WARN L293 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 15:25:07,759 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:25:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037246986] [2023-12-02 15:25:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037246986] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:25:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1723253078] [2023-12-02 15:25:07,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:25:07,759 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:25:07,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:25:07,760 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:25:07,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 15:25:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:25:09,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-02 15:25:09,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:25:10,259 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-12-02 15:25:10,260 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 25 treesize of output 22 [2023-12-02 15:25:11,185 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 14 treesize of output 10 [2023-12-02 15:25:12,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-12-02 15:25:13,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-12-02 15:25:13,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-12-02 15:25:14,079 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 38 treesize of output 22 [2023-12-02 15:25:14,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:25:17,090 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 43 treesize of output 38 [2023-12-02 15:25:17,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2023-12-02 15:25:18,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 77 [2023-12-02 15:25:20,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 150 [2023-12-02 15:25:20,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 167 [2023-12-02 15:25:21,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 170 [2023-12-02 15:25:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 142 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-02 15:25:21,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:25:38,320 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_848 (_ BitVec 32)) (v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_847))) (let ((.cse4 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_847) |c_~#unsigned_char_Array_0~0.base| (store .cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) v_ArrVal_848)))) (let ((.cse0 (select .cse5 |c_~#signed_short_int_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 |c_~#signed_short_int_Array_0~0.offset|)))) (.cse2 (select (select .cse5 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (or (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse1 .cse2)))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))) (not (bvsle .cse1 (_ bv16 32))) (not (bvslt (bvshl (_ bv10 32) .cse1) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))))) .cse2)))))))))) is different from false [2023-12-02 15:26:53,062 WARN L293 SmtUtils]: Spent 11.88s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 15:27:06,269 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 16) c_~last_1_signed_short_int_Array_0_0_~0))) (let ((.cse2 (bvsgt c_~last_1_signed_long_int_Array_0_0_~0 .cse1))) (let ((.cse4 (not .cse2)) (.cse3 (bvneg c_~last_1_signed_long_int_Array_0_0_~0)) (.cse0 (bvneg .cse1))) (or (not (bvsle ((_ zero_extend 24) |c_ULTIMATE.start_updateVariables_#t~mem39#1|) (_ bv254 32))) (and (or (forall ((|ULTIMATE.start_step_#t~mem4#1| (_ BitVec 8)) (~last_1_unsigned_char_Array_0_2_~0 (_ BitVec 8))) (not (bvsgt (bvadd .cse0 .cse1 ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem4#1|)) ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_2_~0)))) .cse2) (or (forall ((|ULTIMATE.start_step_#t~mem4#1| (_ BitVec 8)) (~last_1_unsigned_char_Array_0_2_~0 (_ BitVec 8))) (not (bvsgt (bvadd .cse3 .cse1 ((_ zero_extend 24) |ULTIMATE.start_step_#t~mem4#1|)) ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_2_~0)))) .cse4)) (let ((.cse11 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse14 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))) (.cse15 ((_ sign_extend 24) (_ bv64 8))) (.cse9 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))) (.cse23 (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|)) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse11))))) (and (let ((.cse22 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse3 .cse24 .cse1))))) (let ((.cse21 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store .cse23 |c_~#signed_short_int_Array_0~0.offset| .cse22))) (.cse19 ((_ sign_extend 16) ((_ extract 15 0) .cse22)))) (let ((.cse16 (store (select .cse21 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| .cse19))) (let ((.cse20 (store .cse21 |c_~#signed_long_int_Array_0~0.base| .cse16))) (let ((.cse17 (select .cse20 |c_~#signed_short_int_Array_0~0.base|))) (let ((.cse18 ((_ sign_extend 16) ((_ extract 15 0) (select .cse17 |c_~#signed_short_int_Array_0~0.offset|))))) (or .cse4 (forall ((v_ArrVal_848 (_ BitVec 32)) (v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| .cse16) |c_~#signed_short_int_Array_0~0.base| (store .cse17 .cse9 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse18 .cse19))))))) (let ((.cse5 (store (store .cse13 |c_~#unsigned_char_Array_0~0.base| (store (select .cse13 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| .cse15)) |c_~#double_Array_0~0.base| v_ArrVal_847))) (let ((.cse10 (select .cse5 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse12 (store (store .cse13 |c_~#double_Array_0~0.base| v_ArrVal_847) |c_~#unsigned_char_Array_0~0.base| (store .cse10 .cse14 v_ArrVal_848)))) (let ((.cse8 (select .cse12 |c_~#signed_short_int_Array_0~0.base|))) (let ((.cse6 ((_ sign_extend 16) ((_ extract 15 0) (select .cse8 |c_~#signed_short_int_Array_0~0.offset|)))) (.cse7 (select (select .cse12 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (or (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse5 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))) (not (bvsle .cse6 (_ bv16 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse6))) ((_ sign_extend 16) ((_ extract 15 0) (select .cse8 .cse9)))) (not (bvslt (bvshl (_ bv10 32) .cse6) (bvmul .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select .cse10 .cse11)))))))))))))) (not (bvslt (bvshl (_ bv10 32) .cse18) (bvmul .cse19 ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse20 |c_~#unsigned_char_Array_0~0.base|) .cse11))))))))))))) (let ((.cse38 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse0 .cse24 .cse1))))) (let ((.cse37 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store .cse23 |c_~#signed_short_int_Array_0~0.offset| .cse38))) (.cse27 ((_ sign_extend 16) ((_ extract 15 0) .cse38)))) (let ((.cse35 (store (select .cse37 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| .cse27))) (let ((.cse26 (store .cse37 |c_~#signed_long_int_Array_0~0.base| .cse35))) (let ((.cse36 (select .cse26 |c_~#signed_short_int_Array_0~0.base|))) (let ((.cse25 ((_ sign_extend 16) ((_ extract 15 0) (select .cse36 |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvslt (bvshl (_ bv10 32) .cse25) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse26 |c_~#unsigned_char_Array_0~0.base|) .cse11))) .cse27))) .cse2 (forall ((v_ArrVal_848 (_ BitVec 32)) (v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| .cse35) |c_~#signed_short_int_Array_0~0.base| (store .cse36 .cse9 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse25 .cse27))))))) (let ((.cse32 (store (store .cse34 |c_~#unsigned_char_Array_0~0.base| (store (select .cse34 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| .cse15)) |c_~#double_Array_0~0.base| v_ArrVal_847))) (let ((.cse31 (select .cse32 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse33 (store (store .cse34 |c_~#double_Array_0~0.base| v_ArrVal_847) |c_~#unsigned_char_Array_0~0.base| (store .cse31 .cse14 v_ArrVal_848)))) (let ((.cse28 (select .cse33 |c_~#signed_short_int_Array_0~0.base|))) (let ((.cse29 (select (select .cse33 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)) (.cse30 ((_ sign_extend 16) ((_ extract 15 0) (select .cse28 |c_~#signed_short_int_Array_0~0.offset|))))) (or (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse28 .cse9))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse29 .cse30)))) (not (bvslt (bvshl (_ bv10 32) .cse30) (bvmul .cse29 ((_ zero_extend 24) ((_ extract 7 0) (select .cse31 .cse11)))))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse32 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))) (not (bvsle .cse30 (_ bv16 32))))))))))))))))))))))))) is different from true [2023-12-02 15:27:06,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1723253078] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:06,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596172952] [2023-12-02 15:27:06,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:06,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:27:06,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:27:06,272 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:27:06,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 15:27:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:06,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 15:27:06,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:27:06,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:27:13,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2023-12-02 15:27:14,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:27:14,544 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 54 treesize of output 47 [2023-12-02 15:27:14,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2023-12-02 15:27:15,714 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 0 case distinctions, treesize of input 90 treesize of output 77 [2023-12-02 15:27:16,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:27:16,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 124 [2023-12-02 15:27:16,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 121 [2023-12-02 15:27:17,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:27:17,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 119 [2023-12-02 15:27:25,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:27:25,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 96 [2023-12-02 15:27:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 125 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-02 15:27:28,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:27:53,668 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (_ BitVec 32))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_895) |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_895) |c_~#unsigned_char_Array_0~0.base| (store .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) v_ArrVal_896)))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvslt (bvshl (_ bv10 32) .cse0) (bvmul (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))))) (not (bvsle .cse0 (_ bv16 32)))))))) is different from false [2023-12-02 15:29:07,049 WARN L293 SmtUtils]: Spent 9.46s on a formula simplification that was a NOOP. DAG size: 140 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 15:29:10,555 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse27 ((_ sign_extend 16) c_~last_1_signed_short_int_Array_0_0_~0)) (.cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse3)))) (.cse26 (bvsgt c_~last_1_signed_long_int_Array_0_0_~0 .cse27))) (let ((.cse15 (not .cse26)) (.cse14 (bvadd (bvneg c_~last_1_signed_long_int_Array_0_0_~0) .cse28 .cse27)) (.cse25 (bvadd (bvneg .cse27) .cse28 .cse27))) (or (let ((.cse5 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))) (.cse6 ((_ sign_extend 24) (_ bv64 8))) (.cse9 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))) (.cse13 (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|))) (and (or (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (_ BitVec 32))) (let ((.cse4 (let ((.cse12 ((_ sign_extend 16) ((_ extract 15 0) .cse14)))) (let ((.cse11 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store .cse13 |c_~#signed_short_int_Array_0~0.offset| .cse12))) (.cse10 ((_ sign_extend 16) ((_ extract 15 0) .cse12)))) (let ((.cse7 (store (select .cse11 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| .cse10))) (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| .cse7) |c_~#signed_short_int_Array_0~0.base| (let ((.cse8 (select (store .cse11 |c_~#signed_long_int_Array_0~0.base| .cse7) |c_~#signed_short_int_Array_0~0.base|))) (store .cse8 .cse9 ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select .cse8 |c_~#signed_short_int_Array_0~0.offset|))) .cse10))))))))))) (let ((.cse2 (select (store (store .cse4 |c_~#unsigned_char_Array_0~0.base| (store (select .cse4 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| .cse6)) |c_~#double_Array_0~0.base| v_ArrVal_895) |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_895) |c_~#unsigned_char_Array_0~0.base| (store .cse2 .cse5 v_ArrVal_896)))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvslt (bvshl (_ bv10 32) .cse0) (bvmul (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 .cse3)))))) (not (bvsle .cse0 (_ bv16 32))))))))) .cse15) (or (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (_ BitVec 32))) (let ((.cse19 (let ((.cse24 ((_ sign_extend 16) ((_ extract 15 0) .cse25)))) (let ((.cse23 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store .cse13 |c_~#signed_short_int_Array_0~0.offset| .cse24))) (.cse22 ((_ sign_extend 16) ((_ extract 15 0) .cse24)))) (let ((.cse20 (store (select .cse23 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| .cse22))) (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| .cse20) |c_~#signed_short_int_Array_0~0.base| (let ((.cse21 (select (store .cse23 |c_~#signed_long_int_Array_0~0.base| .cse20) |c_~#signed_short_int_Array_0~0.base|))) (store .cse21 .cse9 ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select .cse21 |c_~#signed_short_int_Array_0~0.offset|))) .cse22))))))))))) (let ((.cse17 (select (store (store .cse19 |c_~#unsigned_char_Array_0~0.base| (store (select .cse19 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| .cse6)) |c_~#double_Array_0~0.base| v_ArrVal_895) |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse18 (store (store .cse19 |c_~#double_Array_0~0.base| v_ArrVal_895) |c_~#unsigned_char_Array_0~0.base| (store .cse17 .cse5 v_ArrVal_896)))) (let ((.cse16 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse18 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvsle .cse16 (_ bv16 32))) (not (bvslt (bvshl (_ bv10 32) .cse16) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse17 .cse3))) (select (select .cse18 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))))))) .cse26))) (and (or .cse15 (forall ((~last_1_unsigned_char_Array_0_2_~0 (_ BitVec 8))) (not (bvsgt .cse14 ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_2_~0))))) (or (forall ((~last_1_unsigned_char_Array_0_2_~0 (_ BitVec 8))) (not (bvsgt .cse25 ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_2_~0)))) .cse26)))))) is different from true [2023-12-02 15:29:13,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596172952] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:29:13,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:29:13,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 19] total 37 [2023-12-02 15:29:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451738373] [2023-12-02 15:29:13,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:29:13,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 15:29:13,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:29:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 15:29:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=3687, Unknown=52, NotChecked=650, Total=4830 [2023-12-02 15:29:13,129 INFO L87 Difference]: Start difference. First operand 326 states and 383 transitions. Second operand has 38 states, 37 states have (on average 4.486486486486487) internal successors, (166), 37 states have internal predecessors, (166), 5 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-02 15:29:17,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:20,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:23,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:25,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:27,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:30,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:32,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:34,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:43,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:45,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:48,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:50,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:52,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:55,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:57,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:29:59,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:30:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:38,038 INFO L93 Difference]: Finished difference Result 990 states and 1169 transitions. [2023-12-02 15:30:38,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-02 15:30:38,039 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.486486486486487) internal successors, (166), 37 states have internal predecessors, (166), 5 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 117 [2023-12-02 15:30:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:38,043 INFO L225 Difference]: With dead ends: 990 [2023-12-02 15:30:38,043 INFO L226 Difference]: Without dead ends: 808 [2023-12-02 15:30:38,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3123 ImplicationChecksByTransitivity, 273.0s TimeCoverageRelationStatistics Valid=1618, Invalid=9906, Unknown=52, NotChecked=1080, Total=12656 [2023-12-02 15:30:38,048 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 885 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 3589 mSolverCounterSat, 85 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 3690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3589 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:38,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1687 Invalid, 3690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3589 Invalid, 16 Unknown, 0 Unchecked, 49.4s Time] [2023-12-02 15:30:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2023-12-02 15:30:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 589. [2023-12-02 15:30:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 516 states have (on average 1.1705426356589148) internal successors, (604), 522 states have internal predecessors, (604), 48 states have call successors, (48), 24 states have call predecessors, (48), 24 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-02 15:30:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 700 transitions. [2023-12-02 15:30:38,103 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 700 transitions. Word has length 117 [2023-12-02 15:30:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:38,103 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 700 transitions. [2023-12-02 15:30:38,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.486486486486487) internal successors, (166), 37 states have internal predecessors, (166), 5 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-02 15:30:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 700 transitions. [2023-12-02 15:30:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 15:30:38,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:38,104 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:38,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 15:30:38,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 15:30:38,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-12-02 15:30:38,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:38,705 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:30:38,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1285907955, now seen corresponding path program 1 times [2023-12-02 15:30:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:30:38,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228101087] [2023-12-02 15:30:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:38,706 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:38,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:30:38,707 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:38,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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 (34)] Waiting until timeout for monitored process [2023-12-02 15:30:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:39,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 15:30:39,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:39,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:30:39,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 15:30:40,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:30:40,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-12-02 15:30:40,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 15:30:40,758 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 34 treesize of output 18 [2023-12-02 15:30:41,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 15:30:41,917 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 54 treesize of output 47 [2023-12-02 15:30:42,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2023-12-02 15:30:42,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2023-12-02 15:30:42,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 90 [2023-12-02 15:30:42,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:30:42,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 92 [2023-12-02 15:30:42,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:30:42,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 87 [2023-12-02 15:30:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 126 proven. 9 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-02 15:30:42,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:30:43,920 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (_ BitVec 32)) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_944))) (or (not (let ((.cse1 (select .cse2 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_944) |c_~#unsigned_char_Array_0~0.base| (store .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) v_ArrVal_945)))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|)))) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))))) (select (select .cse0 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32)))))) is different from false [2023-12-02 15:30:44,220 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (_ BitVec 32)) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))))) (let ((.cse3 (store (store .cse2 |c_~#unsigned_char_Array_0~0.base| (store (select .cse2 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_944))) (or (not (let ((.cse1 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (store (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_944) |c_~#unsigned_char_Array_0~0.base| (store .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) v_ArrVal_945)))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|)))) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))))) (select (select .cse0 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))))))) is different from false [2023-12-02 15:31:02,957 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:31:02,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228101087] [2023-12-02 15:31:02,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228101087] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:31:02,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [166710277] [2023-12-02 15:31:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:02,958 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:31:02,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:31:02,959 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:31:02,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-12-02 15:31:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:04,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 15:31:04,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:31:05,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:31:07,075 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 14 treesize of output 10 [2023-12-02 15:31:07,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:31:08,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-12-02 15:31:08,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 15:31:09,450 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 34 treesize of output 18 [2023-12-02 15:31:10,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:31:12,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-12-02 15:31:13,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2023-12-02 15:31:14,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 74 [2023-12-02 15:31:14,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2023-12-02 15:31:14,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 74 [2023-12-02 15:31:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 126 proven. 9 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-02 15:31:17,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:31:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [166710277] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:31:52,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652857661] [2023-12-02 15:31:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:52,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:31:52,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:31:52,922 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:31:52,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 15:31:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:53,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 15:31:53,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:31:53,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:32:03,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2023-12-02 15:32:03,847 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 14 treesize of output 10 [2023-12-02 15:32:05,936 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 42 treesize of output 35 [2023-12-02 15:32:07,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2023-12-02 15:32:09,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 82 [2023-12-02 15:32:09,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 72 [2023-12-02 15:32:10,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:10,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 77 [2023-12-02 15:32:12,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:12,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 63 [2023-12-02 15:32:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 149 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 15:32:14,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:32:24,165 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))))) (let ((.cse1 (select (store (store .cse3 |c_~#unsigned_char_Array_0~0.base| (store (select .cse3 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_1038) |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (store (store .cse3 |c_~#double_Array_0~0.base| v_ArrVal_1038) |c_~#unsigned_char_Array_0~0.base| (store .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) v_ArrVal_1040)))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvsle .cse0 (_ bv16 32))) (not (bvslt (bvshl (_ bv10 32) .cse0) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))))) (select (select .cse2 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))))))) is different from false [2023-12-02 15:32:52,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652857661] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:52,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:32:52,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 18] total 37 [2023-12-02 15:32:52,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592710871] [2023-12-02 15:32:52,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:32:52,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 15:32:52,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:32:52,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 15:32:52,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2701, Unknown=49, NotChecked=324, Total=3306 [2023-12-02 15:32:52,670 INFO L87 Difference]: Start difference. First operand 589 states and 700 transitions. Second operand has 38 states, 38 states have (on average 4.657894736842105) internal successors, (177), 37 states have internal predecessors, (177), 5 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-02 15:33:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:25,371 INFO L93 Difference]: Finished difference Result 1269 states and 1496 transitions. [2023-12-02 15:33:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 15:33:25,373 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.657894736842105) internal successors, (177), 37 states have internal predecessors, (177), 5 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 117 [2023-12-02 15:33:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:25,377 INFO L225 Difference]: With dead ends: 1269 [2023-12-02 15:33:25,377 INFO L226 Difference]: Without dead ends: 824 [2023-12-02 15:33:25,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 367 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 133.0s TimeCoverageRelationStatistics Valid=1375, Invalid=7518, Unknown=49, NotChecked=564, Total=9506 [2023-12-02 15:33:25,382 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 1033 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 3376 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 3482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:25,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1615 Invalid, 3482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3376 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2023-12-02 15:33:25,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2023-12-02 15:33:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 717. [2023-12-02 15:33:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 622 states have (on average 1.1559485530546625) internal successors, (719), 631 states have internal predecessors, (719), 62 states have call successors, (62), 32 states have call predecessors, (62), 32 states have return successors, (62), 53 states have call predecessors, (62), 62 states have call successors, (62) [2023-12-02 15:33:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 843 transitions. [2023-12-02 15:33:25,489 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 843 transitions. Word has length 117 [2023-12-02 15:33:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:25,490 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 843 transitions. [2023-12-02 15:33:25,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.657894736842105) internal successors, (177), 37 states have internal predecessors, (177), 5 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-02 15:33:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 843 transitions. [2023-12-02 15:33:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 15:33:25,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:25,492 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:25,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 15:33:25,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-12-02 15:33:25,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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 (34)] Ended with exit code 0 [2023-12-02 15:33:26,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:33:26,093 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:33:26,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:26,093 INFO L85 PathProgramCache]: Analyzing trace with hash 298118071, now seen corresponding path program 1 times [2023-12-02 15:33:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:26,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173789295] [2023-12-02 15:33:26,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:26,094 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:33:26,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:26,095 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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:33:26,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/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 (37)] Waiting until timeout for monitored process [2023-12-02 15:33:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:26,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 15:33:26,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:26,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:33:27,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-02 15:33:27,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:33:27,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 15:33:27,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-12-02 15:33:28,224 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 39 treesize of output 19 [2023-12-02 15:33:28,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 15:33:29,174 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 42 treesize of output 41 [2023-12-02 15:33:29,326 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 65 treesize of output 41 [2023-12-02 15:33:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 117 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-02 15:33:29,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:33:35,280 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:35,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173789295] [2023-12-02 15:33:35,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173789295] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:33:35,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [371229465] [2023-12-02 15:33:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:35,280 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:33:35,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:33:35,281 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:33:35,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-12-02 15:33:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:36,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 15:33:36,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:36,704 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-12-02 15:33:36,704 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 25 treesize of output 22 [2023-12-02 15:33:37,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 15:33:37,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-12-02 15:33:38,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-12-02 15:33:38,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-12-02 15:33:40,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 45 [2023-12-02 15:33:41,223 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 12 treesize of output 8 [2023-12-02 15:33:42,872 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 50 treesize of output 45 [2023-12-02 15:33:43,168 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 71 treesize of output 47 [2023-12-02 15:33:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 42 proven. 117 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 15:33:43,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:33:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [371229465] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:33:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076337797] [2023-12-02 15:33:51,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:33:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:33:51,398 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:33:51,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee55696f-006f-43eb-92d7-f09aec2f23e3/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 15:33:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:51,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 15:33:51,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:51,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 15:34:00,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:00,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 44 [2023-12-02 15:34:03,480 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 14 treesize of output 10 [2023-12-02 15:34:07,283 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 48 treesize of output 41 [2023-12-02 15:34:08,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-12-02 15:34:09,121 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 0 case distinctions, treesize of input 87 treesize of output 66 [2023-12-02 15:34:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 156 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 15:34:09,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:00,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076337797] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:35:00,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:35:00,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 19] total 47 [2023-12-02 15:35:00,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813614407] [2023-12-02 15:35:00,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:35:00,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 15:35:00,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:35:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 15:35:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4250, Unknown=14, NotChecked=0, Total=4556 [2023-12-02 15:35:00,425 INFO L87 Difference]: Start difference. First operand 717 states and 843 transitions. Second operand has 48 states, 48 states have (on average 3.6041666666666665) internal successors, (173), 47 states have internal predecessors, (173), 7 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2023-12-02 15:35:06,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:35:08,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:35:11,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:35:13,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:35:15,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]