./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:04:45,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:04:45,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:04:46,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:04:46,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:04:46,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:04:46,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:04:46,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:04:46,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:04:46,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:04:46,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:04:46,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:04:46,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:04:46,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:04:46,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:04:46,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:04:46,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:04:46,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:04:46,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:04:46,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:04:46,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:04:46,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:04:46,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:04:46,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:04:46,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:04:46,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:04:46,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:04:46,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:04:46,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:04:46,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:04:46,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:04:46,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:04:46,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:04:46,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:04:46,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:04:46,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:04:46,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:04:46,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:04:46,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:04:46,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:04:46,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:04:46,105 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:04:46,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:04:46,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:04:46,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:04:46,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:04:46,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:04:46,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:04:46,134 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:04:46,134 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:04:46,134 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:04:46,134 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:04:46,134 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:04:46,134 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:04:46,135 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:04:46,135 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:04:46,135 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:04:46,135 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:04:46,135 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:04:46,136 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:04:46,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:04:46,136 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:04:46,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:04:46,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:04:46,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:04:46,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:04:46,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:04:46,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:04:46,138 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:04:46,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:04:46,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:04:46,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:04:46,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:04:46,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:04:46,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:04:46,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:04:46,139 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:04:46,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:04:46,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:04:46,140 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:04:46,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:04:46,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:04:46,140 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:04:46,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/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_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2022-11-03 02:04:46,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:04:46,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:04:46,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:04:46,436 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:04:46,437 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:04:46,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2022-11-03 02:04:46,512 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/data/f234af133/2cb9b37063fb4b94bcb06c51f1d050e7/FLAGe4bebba61 [2022-11-03 02:04:47,075 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:04:47,076 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2022-11-03 02:04:47,083 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/data/f234af133/2cb9b37063fb4b94bcb06c51f1d050e7/FLAGe4bebba61 [2022-11-03 02:04:47,437 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/data/f234af133/2cb9b37063fb4b94bcb06c51f1d050e7 [2022-11-03 02:04:47,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:04:47,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:04:47,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:04:47,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:04:47,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:04:47,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266b6a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47, skipping insertion in model container [2022-11-03 02:04:47,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:04:47,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:04:47,698 WARN L230 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_151729f9-3b5f-4e4e-a965-d53c5b91f06c/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2022-11-03 02:04:47,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:04:47,713 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:04:47,733 WARN L230 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_151729f9-3b5f-4e4e-a965-d53c5b91f06c/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2022-11-03 02:04:47,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:04:47,749 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:04:47,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47 WrapperNode [2022-11-03 02:04:47,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:04:47,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:04:47,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:04:47,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:04:47,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,786 INFO L138 Inliner]: procedures = 18, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 108 [2022-11-03 02:04:47,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:04:47,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:04:47,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:04:47,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:04:47,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,822 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:04:47,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:04:47,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:04:47,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:04:47,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (1/1) ... [2022-11-03 02:04:47,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:04:47,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:47,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:04:47,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:04:47,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:04:47,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:04:47,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:04:47,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-03 02:04:47,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:04:47,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:04:47,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-11-03 02:04:47,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:04:47,997 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:04:47,999 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:04:48,154 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:04:48,171 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:04:48,172 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:04:48,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:04:48 BoogieIcfgContainer [2022-11-03 02:04:48,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:04:48,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:04:48,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:04:48,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:04:48,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:04:47" (1/3) ... [2022-11-03 02:04:48,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a0d54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:04:48, skipping insertion in model container [2022-11-03 02:04:48,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:47" (2/3) ... [2022-11-03 02:04:48,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a0d54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:04:48, skipping insertion in model container [2022-11-03 02:04:48,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:04:48" (3/3) ... [2022-11-03 02:04:48,184 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2022-11-03 02:04:48,204 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:04:48,204 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:04:48,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:04:48,262 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=LoopsAndPotentialCycles, 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;@2aaa063d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:04:48,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:04:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:04:48,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:48,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:48,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:04:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1392335393, now seen corresponding path program 1 times [2022-11-03 02:04:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:48,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332342041] [2022-11-03 02:04:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:48,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:48,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:48,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332342041] [2022-11-03 02:04:48,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332342041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:04:48,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:04:48,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:04:48,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562619354] [2022-11-03 02:04:48,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:04:48,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:04:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:48,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:04:48,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:04:48,761 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:48,842 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-11-03 02:04:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:04:48,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:04:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:48,853 INFO L225 Difference]: With dead ends: 26 [2022-11-03 02:04:48,853 INFO L226 Difference]: Without dead ends: 14 [2022-11-03 02:04:48,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:04:48,859 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:48,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:04:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-03 02:04:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-03 02:04:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-11-03 02:04:48,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2022-11-03 02:04:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:48,905 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-03 02:04:48,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-11-03 02:04:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:04:48,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:48,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:48,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:04:48,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:04:48,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1409346054, now seen corresponding path program 1 times [2022-11-03 02:04:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:48,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494128551] [2022-11-03 02:04:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:48,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:48,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494128551] [2022-11-03 02:04:48,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494128551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:04:48,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:04:48,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:04:48,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437645781] [2022-11-03 02:04:48,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:04:48,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:04:48,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:48,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:04:48,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:04:48,985 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:49,004 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-11-03 02:04:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:04:49,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:04:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:49,005 INFO L225 Difference]: With dead ends: 32 [2022-11-03 02:04:49,006 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 02:04:49,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:04:49,008 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:49,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:04:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 02:04:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2022-11-03 02:04:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-11-03 02:04:49,014 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-11-03 02:04:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:49,015 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-03 02:04:49,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-11-03 02:04:49,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:04:49,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:49,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:49,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:04:49,016 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:04:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1916271840, now seen corresponding path program 1 times [2022-11-03 02:04:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:49,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361447688] [2022-11-03 02:04:49,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:49,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:04:49,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:04:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:04:49,066 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:04:49,066 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:04:49,067 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:04:49,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:04:49,073 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-03 02:04:49,076 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:04:49,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:04:49 BoogieIcfgContainer [2022-11-03 02:04:49,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:04:49,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:04:49,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:04:49,106 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:04:49,106 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:04:48" (3/4) ... [2022-11-03 02:04:49,109 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 02:04:49,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:04:49,111 INFO L158 Benchmark]: Toolchain (without parser) took 1666.29ms. Allocated memory is still 138.4MB. Free memory was 100.3MB in the beginning and 54.6MB in the end (delta: 45.7MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2022-11-03 02:04:49,111 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 138.4MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:04:49,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.88ms. Allocated memory is still 138.4MB. Free memory was 100.0MB in the beginning and 112.6MB in the end (delta: -12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:04:49,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.77ms. Allocated memory is still 138.4MB. Free memory was 112.6MB in the beginning and 111.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:04:49,113 INFO L158 Benchmark]: Boogie Preprocessor took 37.43ms. Allocated memory is still 138.4MB. Free memory was 111.2MB in the beginning and 109.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:04:49,113 INFO L158 Benchmark]: RCFGBuilder took 349.20ms. Allocated memory is still 138.4MB. Free memory was 109.7MB in the beginning and 97.4MB in the end (delta: 12.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 02:04:49,114 INFO L158 Benchmark]: TraceAbstraction took 928.43ms. Allocated memory is still 138.4MB. Free memory was 96.5MB in the beginning and 55.4MB in the end (delta: 41.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-03 02:04:49,115 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 138.4MB. Free memory was 55.2MB in the beginning and 54.6MB in the end (delta: 611.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:04:49,118 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 138.4MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.88ms. Allocated memory is still 138.4MB. Free memory was 100.0MB in the beginning and 112.6MB in the end (delta: -12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.77ms. Allocated memory is still 138.4MB. Free memory was 112.6MB in the beginning and 111.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.43ms. Allocated memory is still 138.4MB. Free memory was 111.2MB in the beginning and 109.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 349.20ms. Allocated memory is still 138.4MB. Free memory was 109.7MB in the beginning and 97.4MB in the end (delta: 12.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 928.43ms. Allocated memory is still 138.4MB. Free memory was 96.5MB in the beginning and 55.4MB in the end (delta: 41.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 138.4MB. Free memory was 55.2MB in the beginning and 54.6MB in the end (delta: 611.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 51]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_125; [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; [L22] EXPR main__min[0] VAL [__return_125=0, __return_main=0, main__max={4:0}, main__min={5:0}, main__min[0]=56] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_125=0, __return_main=0, main__max={4:0}, main__max[4UL]=57, main__min={5:0}] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={4:0}, main__min={5:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__max[main__i]=55, main__min={5:0}] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L51] reach_error() VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 29 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 30 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 [2022-11-03 02:04:49,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:04:51,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:04:51,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:04:51,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:04:51,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:04:51,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:04:51,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:04:51,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:04:51,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:04:51,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:04:51,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:04:51,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:04:51,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:04:51,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:04:51,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:04:51,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:04:51,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:04:51,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:04:51,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:04:51,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:04:51,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:04:51,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:04:51,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:04:51,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:04:51,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:04:51,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:04:51,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:04:51,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:04:51,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:04:51,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:04:51,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:04:51,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:04:51,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:04:51,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:04:51,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:04:51,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:04:51,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:04:51,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:04:51,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:04:51,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:04:51,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:04:51,630 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 02:04:51,665 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:04:51,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:04:51,666 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:04:51,666 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:04:51,667 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:04:51,667 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:04:51,667 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:04:51,667 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:04:51,667 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:04:51,668 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:04:51,668 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:04:51,668 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:04:51,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:04:51,669 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:04:51,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:04:51,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:04:51,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:04:51,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:04:51,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:04:51,670 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:04:51,671 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:04:51,671 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:04:51,671 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:04:51,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:04:51,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:04:51,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:04:51,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:04:51,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:04:51,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:04:51,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:04:51,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:04:51,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:04:51,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:04:51,673 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:04:51,674 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:04:51,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:04:51,674 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:04:51,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:04:51,675 INFO L138 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_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/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_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2022-11-03 02:04:52,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:04:52,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:04:52,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:04:52,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:04:52,101 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:04:52,103 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2022-11-03 02:04:52,184 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/data/a693e658c/8e4abf3510414a74afcda84b07bf3a2f/FLAGf7fbd4a4d [2022-11-03 02:04:52,719 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:04:52,720 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2022-11-03 02:04:52,727 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/data/a693e658c/8e4abf3510414a74afcda84b07bf3a2f/FLAGf7fbd4a4d [2022-11-03 02:04:53,061 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/data/a693e658c/8e4abf3510414a74afcda84b07bf3a2f [2022-11-03 02:04:53,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:04:53,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:04:53,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:04:53,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:04:53,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:04:53,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc1ef20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53, skipping insertion in model container [2022-11-03 02:04:53,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:04:53,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:04:53,321 WARN L230 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_151729f9-3b5f-4e4e-a965-d53c5b91f06c/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2022-11-03 02:04:53,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:04:53,387 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:04:53,437 WARN L230 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_151729f9-3b5f-4e4e-a965-d53c5b91f06c/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2022-11-03 02:04:53,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:04:53,469 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:04:53,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53 WrapperNode [2022-11-03 02:04:53,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:04:53,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:04:53,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:04:53,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:04:53,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,535 INFO L138 Inliner]: procedures = 19, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 109 [2022-11-03 02:04:53,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:04:53,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:04:53,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:04:53,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:04:53,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,584 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:04:53,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:04:53,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:04:53,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:04:53,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (1/1) ... [2022-11-03 02:04:53,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:04:53,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:53,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:04:53,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:04:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:04:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-11-03 02:04:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:04:53,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:04:53,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-11-03 02:04:53,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:04:53,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:04:53,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:04:53,801 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:04:53,803 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:04:54,660 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:04:54,667 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:04:54,667 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:04:54,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:04:54 BoogieIcfgContainer [2022-11-03 02:04:54,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:04:54,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:04:54,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:04:54,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:04:54,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:04:53" (1/3) ... [2022-11-03 02:04:54,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2eb7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:04:54, skipping insertion in model container [2022-11-03 02:04:54,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:04:53" (2/3) ... [2022-11-03 02:04:54,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2eb7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:04:54, skipping insertion in model container [2022-11-03 02:04:54,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:04:54" (3/3) ... [2022-11-03 02:04:54,681 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2022-11-03 02:04:54,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:04:54,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:04:54,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:04:54,767 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=LoopsAndPotentialCycles, 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;@3fe304a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:04:54,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:04:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:04:54,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:54,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:54,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:04:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2022-11-03 02:04:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:04:54,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503645218] [2022-11-03 02:04:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:54,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:04:54,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:04:54,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:04:54,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:04:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:55,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:04:55,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:55,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:04:55,280 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:04:55,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503645218] [2022-11-03 02:04:55,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503645218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:04:55,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:04:55,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:04:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686140984] [2022-11-03 02:04:55,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:04:55,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:04:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:04:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:04:55,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:04:55,334 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:57,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:04:59,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:04:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:59,648 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2022-11-03 02:04:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:04:59,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:04:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:59,697 INFO L225 Difference]: With dead ends: 42 [2022-11-03 02:04:59,697 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 02:04:59,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:04:59,703 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:59,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-11-03 02:04:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 02:04:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2022-11-03 02:04:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-11-03 02:04:59,736 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2022-11-03 02:04:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:59,736 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-11-03 02:04:59,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-11-03 02:04:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:04:59,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:59,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:59,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:59,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:04:59,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:04:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:59,942 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2022-11-03 02:04:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:04:59,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433048214] [2022-11-03 02:04:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:59,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:04:59,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:04:59,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:04:59,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:05:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:00,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:05:00,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:05:00,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:05:00,402 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:05:00,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433048214] [2022-11-03 02:05:00,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433048214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:00,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:05:00,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:05:00,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934090501] [2022-11-03 02:05:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:00,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:05:00,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:05:00,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:05:00,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:05:00,407 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:02,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:05:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:02,637 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-11-03 02:05:02,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:05:02,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:05:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:02,639 INFO L225 Difference]: With dead ends: 20 [2022-11-03 02:05:02,639 INFO L226 Difference]: Without dead ends: 16 [2022-11-03 02:05:02,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:05:02,641 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:02,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 02:05:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-03 02:05:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-03 02:05:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-11-03 02:05:02,646 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-11-03 02:05:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:02,646 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-11-03 02:05:02,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-11-03 02:05:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:05:02,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:02,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:05:02,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:02,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:05:02,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2022-11-03 02:05:02,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:05:02,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22177666] [2022-11-03 02:05:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:02,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:05:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:05:02,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:05:02,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:05:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:03,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 02:05:03,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:05,516 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:05:05,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 178 treesize of output 86 [2022-11-03 02:05:40,326 WARN L234 SmtUtils]: Spent 12.64s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:06:04,150 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2022-11-03 02:06:06,178 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2022-11-03 02:07:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:07:08,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:07:08,907 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:07:08,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22177666] [2022-11-03 02:07:08,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22177666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:07:08,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:07:08,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:07:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136669673] [2022-11-03 02:07:08,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:07:08,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:07:08,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:07:08,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:07:08,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=58, Unknown=5, NotChecked=16, Total=110 [2022-11-03 02:07:08,911 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:10,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:07:13,149 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (.cse3 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (and (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse2 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= .cse4 .cse5) (= .cse6 .cse7) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse6)))) (= .cse4 (let ((.cse8 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= .cse7 .cse3) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-03 02:07:15,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:07:17,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:07:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:07:18,087 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-11-03 02:07:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:07:18,094 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:07:18,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:07:18,094 INFO L225 Difference]: With dead ends: 26 [2022-11-03 02:07:18,095 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 02:07:18,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=33, Invalid=59, Unknown=6, NotChecked=34, Total=132 [2022-11-03 02:07:18,097 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:07:18,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 15 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 2 Unknown, 35 Unchecked, 7.0s Time] [2022-11-03 02:07:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 02:07:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-11-03 02:07:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-03 02:07:18,106 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-11-03 02:07:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:07:18,106 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-03 02:07:18,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:07:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-03 02:07:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:07:18,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:07:18,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:07:18,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:07:18,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:07:18,322 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:07:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:07:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2022-11-03 02:07:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:07:18,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969733102] [2022-11-03 02:07:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:07:18,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:07:18,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:07:18,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:07:18,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:07:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:07:19,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 02:07:19,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:07:21,888 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:07:21,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 178 treesize of output 86 [2022-11-03 02:07:33,311 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:07:51,096 WARN L833 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:08:20,337 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from false [2022-11-03 02:08:22,384 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from true [2022-11-03 02:09:41,951 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2022-11-03 02:09:43,982 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true [2022-11-03 02:09:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:09:43,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:09:43,983 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:09:43,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969733102] [2022-11-03 02:09:43,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969733102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:09:43,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:09:43,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:09:43,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456374924] [2022-11-03 02:09:43,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:09:43,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:09:43,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:09:43,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:09:43,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=48, Unknown=6, NotChecked=68, Total=156 [2022-11-03 02:09:43,986 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:46,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:09:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:09:46,561 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-11-03 02:09:46,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:09:46,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:09:46,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:09:46,567 INFO L225 Difference]: With dead ends: 25 [2022-11-03 02:09:46,569 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 02:09:46,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=34, Invalid=48, Unknown=6, NotChecked=68, Total=156 [2022-11-03 02:09:46,573 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:09:46,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 1 Unknown, 51 Unchecked, 2.6s Time] [2022-11-03 02:09:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 02:09:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 02:09:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-03 02:09:46,584 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-11-03 02:09:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:09:46,586 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-03 02:09:46,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-03 02:09:46,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:09:46,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:09:46,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:09:46,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:46,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:09:46,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:09:46,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:09:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash 392786167, now seen corresponding path program 1 times [2022-11-03 02:09:46,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:09:46,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053409704] [2022-11-03 02:09:46,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:46,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:09:46,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:09:46,791 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:09:46,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 02:09:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:47,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:09:47,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:09:47,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:09:47,317 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:09:47,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053409704] [2022-11-03 02:09:47,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053409704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:47,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1988824607] [2022-11-03 02:09:47,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:47,319 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:09:47,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:09:47,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:09:47,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-03 02:09:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:47,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:09:47,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:09:47,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:09:48,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1988824607] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:48,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964446085] [2022-11-03 02:09:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:48,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:09:48,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:09:48,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:09:48,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:09:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:48,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:09:48,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:09:48,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:09:48,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964446085] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:48,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:09:48,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2022-11-03 02:09:48,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391353164] [2022-11-03 02:09:48,416 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:09:48,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:09:48,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:09:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:09:48,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:09:48,418 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:50,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:09:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:09:50,802 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-11-03 02:09:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:09:50,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:09:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:09:50,805 INFO L225 Difference]: With dead ends: 33 [2022-11-03 02:09:50,805 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 02:09:50,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:09:50,806 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:09:50,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-03 02:09:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 02:09:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-11-03 02:09:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-03 02:09:50,815 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2022-11-03 02:09:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:09:50,816 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-03 02:09:50,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-11-03 02:09:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:09:50,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:09:50,818 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:09:50,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:51,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:51,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:51,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:09:51,422 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:09:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:09:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash 467686415, now seen corresponding path program 1 times [2022-11-03 02:09:51,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:09:51,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349584403] [2022-11-03 02:09:51,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:51,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:09:51,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:09:51,425 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:09:51,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 02:09:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:51,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 02:09:51,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:55,090 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-03 02:09:55,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 case distinctions, treesize of input 225 treesize of output 109 [2022-11-03 02:10:07,490 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_11 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))))) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:10:33,590 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse3 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse2 .cse3))) (_ +zero 11 53)))))) is different from false [2022-11-03 02:10:35,613 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= .cse3 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse2 .cse3))) (_ +zero 11 53)))))) is different from true [2022-11-03 02:11:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:47,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:54,989 WARN L833 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from false [2022-11-03 02:11:57,056 WARN L855 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from true [2022-11-03 02:12:07,545 WARN L833 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from false [2022-11-03 02:12:09,608 WARN L855 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from true [2022-11-03 02:12:18,215 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from false [2022-11-03 02:12:20,267 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from true [2022-11-03 02:12:31,377 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from false [2022-11-03 02:12:33,434 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from true [2022-11-03 02:12:47,739 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse3 (let ((.cse6 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)))) (_ +zero 11 53))))) is different from false [2022-11-03 02:12:49,795 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse3 (let ((.cse6 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)))) (_ +zero 11 53))))) is different from true [2022-11-03 02:13:02,577 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from false [2022-11-03 02:13:04,640 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from true [2022-11-03 02:13:22,124 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from false [2022-11-03 02:13:24,187 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) is different from true [2022-11-03 02:13:46,491 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse6 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))))) is different from true [2022-11-03 02:14:10,615 WARN L234 SmtUtils]: Spent 24.10s on a formula simplification. DAG size of input: 14 DAG size of output: 3 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:14:10,615 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-03 02:14:10,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 case distinctions, treesize of input 276 treesize of output 135 [2022-11-03 02:14:47,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (or (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) .cse1)) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (not (= .cse3 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse2 .cse4))) (_ +zero 11 53)) (not (= .cse3 .cse4)) (not (= (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2022-11-03 02:14:49,133 WARN L855 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (or (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) .cse1)) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (not (= .cse3 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse2 .cse4))) (_ +zero 11 53)) (not (= .cse3 .cse4)) (not (= (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true [2022-11-03 02:14:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 02:14:49,134 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:14:49,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349584403] [2022-11-03 02:14:49,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349584403] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:49,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [792866174] [2022-11-03 02:14:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:49,135 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:14:49,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:14:49,136 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:14:49,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-03 02:14:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:50,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 02:14:50,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:54,738 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-03 02:14:54,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 98 [2022-11-03 02:15:05,313 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_18 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (exists ((v_arrayElimCell_20 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17)))) (and (= .cse0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= .cse0 .cse3) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 02:15:30,404 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_20 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse2 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (_ +zero 11 53))) (= .cse2 .cse3)))) is different from false [2022-11-03 02:15:32,423 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_20 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse2 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub roundNearestTiesToEven .cse0 .cse3))) (_ +zero 11 53))) (= .cse2 .cse3)))) is different from true [2022-11-03 02:16:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:42,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:18:05,368 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))))) is different from true [2022-11-03 02:18:29,487 WARN L234 SmtUtils]: Spent 24.09s on a formula simplification. DAG size of input: 14 DAG size of output: 3 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 02:18:29,488 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-03 02:18:29,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 113 [2022-11-03 02:18:58,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_22 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (not (= .cse2 .cse0)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse4)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse4)) (not (= .cse2 .cse3))))) is different from false [2022-11-03 02:19:00,723 WARN L855 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_22 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))) (_ +zero 11 53)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (not (= .cse2 .cse0)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse4)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse4)) (not (= .cse2 .cse3))))) is different from true [2022-11-03 02:19:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 02:19:00,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [792866174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:00,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596583652] [2022-11-03 02:19:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:00,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:00,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:00,726 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:00,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151729f9-3b5f-4e4e-a965-d53c5b91f06c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:19:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:08,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 02:19:08,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:12,039 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-03 02:19:12,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 case distinctions, treesize of input 225 treesize of output 109 [2022-11-03 02:20:05,821 WARN L234 SmtUtils]: Spent 17.80s on a formula simplification. DAG size of input: 55 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)