./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/loop-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- 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-2329fc7 [2022-12-13 21:20:35,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:20:35,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:20:35,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:20:35,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:20:35,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:20:35,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:20:35,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:20:35,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:20:35,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:20:35,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:20:35,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:20:35,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:20:35,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:20:35,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:20:35,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:20:35,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:20:35,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:20:35,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:20:35,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:20:35,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:20:35,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:20:35,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:20:35,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:20:35,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:20:35,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:20:35,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:20:35,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:20:35,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:20:35,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:20:35,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:20:35,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:20:35,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:20:35,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:20:35,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:20:35,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:20:35,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:20:35,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:20:35,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:20:35,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:20:35,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:20:35,565 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:20:35,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:20:35,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:20:35,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:20:35,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:20:35,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:20:35,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:20:35,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:20:35,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:20:35,586 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:20:35,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:20:35,586 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:20:35,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:20:35,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:20:35,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:20:35,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:20:35,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:20:35,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:20:35,593 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:20:35,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:20:35,593 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:20:35,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:20:35,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:20:35,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:20:35,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:20:35,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:20:35,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:20:35,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:20:35,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:20:35,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:20:35,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:20:35,594 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:20:35,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:20:35,595 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:20:35,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:20:35,595 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:20:35,595 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/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_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8 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 -> Automizer 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-12-13 21:20:35,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:20:35,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:20:35,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:20:35,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:20:35,801 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:20:35,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/loop-1.c [2022-12-13 21:20:38,475 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:20:38,626 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:20:38,627 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/sv-benchmarks/c/float-benchs/loop-1.c [2022-12-13 21:20:38,631 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/data/8b62aeca4/2d15f5850fb348958aa27112f9af28b8/FLAG0d0e4cb7d [2022-12-13 21:20:38,645 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/data/8b62aeca4/2d15f5850fb348958aa27112f9af28b8 [2022-12-13 21:20:38,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:20:38,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:20:38,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:20:38,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:20:38,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:20:38,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e713be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38, skipping insertion in model container [2022-12-13 21:20:38,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:20:38,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:20:38,783 WARN L237 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_a53be4ed-4338-44a4-99f1-3abd79427898/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-12-13 21:20:38,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:20:38,802 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:20:38,813 WARN L237 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_a53be4ed-4338-44a4-99f1-3abd79427898/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-12-13 21:20:38,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:20:38,829 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:20:38,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38 WrapperNode [2022-12-13 21:20:38,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:20:38,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:20:38,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:20:38,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:20:38,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,860 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-12-13 21:20:38,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:20:38,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:20:38,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:20:38,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:20:38,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,879 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:20:38,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:20:38,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:20:38,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:20:38,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (1/1) ... [2022-12-13 21:20:38,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:20:38,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:20:38,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:20:38,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:20:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:20:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:20:38,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:20:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:20:38,995 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:20:38,996 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:20:39,065 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:20:39,069 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:20:39,069 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 21:20:39,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:39 BoogieIcfgContainer [2022-12-13 21:20:39,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:20:39,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:20:39,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:20:39,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:20:39,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:20:38" (1/3) ... [2022-12-13 21:20:39,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6757d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:20:39, skipping insertion in model container [2022-12-13 21:20:39,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:38" (2/3) ... [2022-12-13 21:20:39,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6757d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:20:39, skipping insertion in model container [2022-12-13 21:20:39,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:39" (3/3) ... [2022-12-13 21:20:39,080 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-12-13 21:20:39,099 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:20:39,099 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:20:39,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:20:39,153 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=PETRI_NET, 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;@2618bdda, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:20:39,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 21:20:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) 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-12-13 21:20:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 21:20:39,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:20:39,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 21:20:39,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:20:39,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:20:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-12-13 21:20:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:20:39,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111619530] [2022-12-13 21:20:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:20:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:20:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:20:39,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:20:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:20:39,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:20:39,283 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:20:39,284 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 21:20:39,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:20:39,289 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-13 21:20:39,292 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:20:39,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:20:39 BoogieIcfgContainer [2022-12-13 21:20:39,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:20:39,305 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:20:39,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:20:39,305 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:20:39,313 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:39" (3/4) ... [2022-12-13 21:20:39,316 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 21:20:39,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:20:39,317 INFO L158 Benchmark]: Toolchain (without parser) took 668.41ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 94.5MB in the beginning and 127.8MB in the end (delta: -33.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-12-13 21:20:39,317 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 127.9MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:20:39,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.42ms. Allocated memory is still 127.9MB. Free memory was 94.5MB in the beginning and 84.6MB in the end (delta: 9.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 21:20:39,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.67ms. Allocated memory is still 127.9MB. Free memory was 84.3MB in the beginning and 83.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:20:39,319 INFO L158 Benchmark]: Boogie Preprocessor took 20.72ms. Allocated memory is still 127.9MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:20:39,319 INFO L158 Benchmark]: RCFGBuilder took 189.06ms. Allocated memory is still 127.9MB. Free memory was 81.9MB in the beginning and 73.1MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 21:20:39,320 INFO L158 Benchmark]: TraceAbstraction took 231.52ms. Allocated memory is still 127.9MB. Free memory was 72.5MB in the beginning and 59.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 21:20:39,320 INFO L158 Benchmark]: Witness Printer took 10.72ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 59.4MB in the beginning and 127.8MB in the end (delta: -68.4MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2022-12-13 21:20:39,322 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.16ms. Allocated memory is still 127.9MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.42ms. Allocated memory is still 127.9MB. Free memory was 94.5MB in the beginning and 84.6MB in the end (delta: 9.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.67ms. Allocated memory is still 127.9MB. Free memory was 84.3MB in the beginning and 83.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.72ms. Allocated memory is still 127.9MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 189.06ms. Allocated memory is still 127.9MB. Free memory was 81.9MB in the beginning and 73.1MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 231.52ms. Allocated memory is still 127.9MB. Free memory was 72.5MB in the beginning and 59.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 10.72ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 59.4MB in the beginning and 127.8MB in the end (delta: -68.4MB). Peak memory consumption was 6.8MB. 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: 4]: 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 20, overapproximation of someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f VAL [x=1, y=10000000, z=42] [L14] COND FALSE !(x < y) VAL [x=1, y=10000000, z=42] [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 21:20:39,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- 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-2329fc7 [2022-12-13 21:20:40,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:20:40,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:20:40,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:20:40,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:20:40,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:20:40,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:20:40,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:20:40,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:20:40,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:20:40,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:20:40,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:20:40,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:20:40,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:20:40,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:20:40,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:20:40,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:20:40,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:20:40,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:20:40,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:20:40,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:20:40,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:20:40,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:20:40,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:20:40,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:20:40,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:20:40,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:20:40,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:20:40,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:20:40,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:20:40,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:20:40,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:20:40,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:20:40,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:20:40,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:20:40,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:20:40,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:20:40,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:20:40,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:20:40,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:20:40,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:20:40,948 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 21:20:40,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:20:40,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:20:40,971 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:20:40,971 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:20:40,971 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:20:40,972 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:20:40,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:20:40,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:20:40,972 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:20:40,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:20:40,973 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:20:40,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:20:40,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:20:40,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:20:40,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:20:40,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:20:40,974 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 21:20:40,974 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 21:20:40,974 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 21:20:40,974 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:20:40,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:20:40,974 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:20:40,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:20:40,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:20:40,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:20:40,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:20:40,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:20:40,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:20:40,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:20:40,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:20:40,975 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 21:20:40,975 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 21:20:40,976 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:20:40,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:20:40,976 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:20:40,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:20:40,976 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 21:20:40,976 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:20:40,976 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/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_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8 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 -> Automizer 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2022-12-13 21:20:41,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:20:41,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:20:41,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:20:41,231 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:20:41,231 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:20:41,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/loop-1.c [2022-12-13 21:20:43,817 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:20:43,966 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:20:43,966 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/sv-benchmarks/c/float-benchs/loop-1.c [2022-12-13 21:20:43,971 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/data/4257c88c2/a3cb0857e22b454ca955ff03b040a01d/FLAG49f6af77e [2022-12-13 21:20:43,981 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/data/4257c88c2/a3cb0857e22b454ca955ff03b040a01d [2022-12-13 21:20:43,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:20:43,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:20:43,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:20:43,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:20:43,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:20:43,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:20:43" (1/1) ... [2022-12-13 21:20:43,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6234c127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:43, skipping insertion in model container [2022-12-13 21:20:43,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:20:43" (1/1) ... [2022-12-13 21:20:43,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:20:44,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:20:44,106 WARN L237 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_a53be4ed-4338-44a4-99f1-3abd79427898/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-12-13 21:20:44,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:20:44,125 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:20:44,134 WARN L237 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_a53be4ed-4338-44a4-99f1-3abd79427898/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2022-12-13 21:20:44,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:20:44,145 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:20:44,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44 WrapperNode [2022-12-13 21:20:44,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:20:44,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:20:44,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:20:44,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:20:44,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,169 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-12-13 21:20:44,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:20:44,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:20:44,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:20:44,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:20:44,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,185 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:20:44,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:20:44,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:20:44,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:20:44,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (1/1) ... [2022-12-13 21:20:44,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:20:44,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:20:44,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:20:44,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:20:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:20:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:20:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:20:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 21:20:44,307 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:20:44,308 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:20:44,720 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:20:44,725 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:20:44,725 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 21:20:44,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:44 BoogieIcfgContainer [2022-12-13 21:20:44,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:20:44,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:20:44,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:20:44,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:20:44,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:20:43" (1/3) ... [2022-12-13 21:20:44,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bae53ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:20:44, skipping insertion in model container [2022-12-13 21:20:44,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:44" (2/3) ... [2022-12-13 21:20:44,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bae53ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:20:44, skipping insertion in model container [2022-12-13 21:20:44,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:44" (3/3) ... [2022-12-13 21:20:44,736 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2022-12-13 21:20:44,753 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:20:44,753 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:20:44,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:20:44,792 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=PETRI_NET, 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;@eab94c4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:20:44,792 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 21:20:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) 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-12-13 21:20:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 21:20:44,799 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:20:44,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 21:20:44,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:20:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:20:44,803 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-12-13 21:20:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:20:44,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640702584] [2022-12-13 21:20:44,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:20:44,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:20:44,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:20:44,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:20:44,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 21:20:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:20:44,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:20:44,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:20:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:20:44,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:20:44,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:20:44,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640702584] [2022-12-13 21:20:44,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640702584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:20:44,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:20:44,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:20:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410542253] [2022-12-13 21:20:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:20:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:20:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:20:45,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:20:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:20:45,007 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:20:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:20:45,271 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-12-13 21:20:45,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:20:45,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 21:20:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:20:45,280 INFO L225 Difference]: With dead ends: 20 [2022-12-13 21:20:45,280 INFO L226 Difference]: Without dead ends: 8 [2022-12-13 21:20:45,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12-13 21:20:45,285 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:20:45,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:20:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-12-13 21:20:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-12-13 21:20:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:20:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-12-13 21:20:45,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-12-13 21:20:45,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:20:45,308 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-12-13 21:20:45,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:20:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-12-13 21:20:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 21:20:45,308 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:20:45,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:20:45,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:20:45,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:20:45,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:20:45,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:20:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-12-13 21:20:45,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:20:45,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802923720] [2022-12-13 21:20:45,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:20:45,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:20:45,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:20:45,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:20:45,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 21:20:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:20:45,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 21:20:45,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:20:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:20:45,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:20:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:20:49,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:20:49,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802923720] [2022-12-13 21:20:49,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802923720] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:20:49,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:20:49,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-12-13 21:20:49,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339345232] [2022-12-13 21:20:49,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:20:49,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:20:49,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:20:49,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:20:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2022-12-13 21:20:49,500 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:20:55,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:20:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:20:56,635 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-12-13 21:20:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:20:56,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 21:20:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:20:56,640 INFO L225 Difference]: With dead ends: 15 [2022-12-13 21:20:56,640 INFO L226 Difference]: Without dead ends: 11 [2022-12-13 21:20:56,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=36, Invalid=53, Unknown=1, NotChecked=0, Total=90 [2022-12-13 21:20:56,642 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:20:56,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-13 21:20:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-12-13 21:20:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-12-13 21:20:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-12-13 21:20:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-12-13 21:20:56,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-12-13 21:20:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:20:56,646 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-12-13 21:20:56,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:20:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-12-13 21:20:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 21:20:56,647 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:20:56,647 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-12-13 21:20:56,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 21:20:56,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:20:56,849 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:20:56,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:20:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-12-13 21:20:56,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:20:56,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983014214] [2022-12-13 21:20:56,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:20:56,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:20:56,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:20:56,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:20:56,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 21:20:57,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 21:20:57,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:20:57,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 21:20:57,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:20:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:20:59,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:21:20,908 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) is different from false [2022-12-13 21:21:28,587 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from false [2022-12-13 21:21:30,609 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from true [2022-12-13 21:21:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-13 21:21:30,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:21:30,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983014214] [2022-12-13 21:21:30,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983014214] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:21:30,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:21:30,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-12-13 21:21:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799127408] [2022-12-13 21:21:30,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:21:30,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 21:21:30,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:21:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 21:21:30,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=70, Unknown=6, NotChecked=38, Total=156 [2022-12-13 21:21:30,624 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-12-13 21:21:55,181 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:21:57,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:22:04,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:22:07,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:22:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:22:09,366 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-12-13 21:22:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:22:09,377 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) Word has length 10 [2022-12-13 21:22:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:22:09,377 INFO L225 Difference]: With dead ends: 19 [2022-12-13 21:22:09,377 INFO L226 Difference]: Without dead ends: 15 [2022-12-13 21:22:09,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 51.6s TimeCoverageRelationStatistics Valid=82, Invalid=130, Unknown=6, NotChecked=54, Total=272 [2022-12-13 21:22:09,378 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-12-13 21:22:09,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 2 Unknown, 22 Unchecked, 11.8s Time] [2022-12-13 21:22:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-12-13 21:22:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-12-13 21:22:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:22:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-13 21:22:09,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2022-12-13 21:22:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:22:09,381 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-13 21:22:09,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-12-13 21:22:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-13 21:22:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 21:22:09,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:22:09,382 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2022-12-13 21:22:09,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-12-13 21:22:09,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:22:09,584 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:22:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:22:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1620705621, now seen corresponding path program 3 times [2022-12-13 21:22:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:22:09,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915620430] [2022-12-13 21:22:09,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 21:22:09,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:22:09,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:22:09,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:22:09,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 21:22:10,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 21:22:10,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:22:10,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 21:22:10,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:22:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:22:39,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:23:04,063 WARN L233 SmtUtils]: Spent 7.14s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:23:24,256 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2022-12-13 21:23:42,694 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from false [2022-12-13 21:23:44,726 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from true [2022-12-13 21:24:03,257 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-12-13 21:24:05,297 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-12-13 21:24:23,909 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-12-13 21:24:25,955 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-12-13 21:24:44,657 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2022-12-13 21:24:46,716 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2022-12-13 21:25:05,469 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from false [2022-12-13 21:25:07,521 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from true [2022-12-13 21:25:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-12-13 21:25:07,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:25:07,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915620430] [2022-12-13 21:25:07,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915620430] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:25:07,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:25:07,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-12-13 21:25:07,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649337266] [2022-12-13 21:25:07,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:25:07,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 21:25:07,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:25:07,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 21:25:07,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=142, Unknown=18, NotChecked=186, Total=420 [2022-12-13 21:25:07,546 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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-12-13 21:25:09,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 21:25:11,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:25:14,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:25:17,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:25:19,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:25:21,340 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse3 .cse4)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 21:25:23,396 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse3 .cse4)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 21:25:25,453 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)))))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse4 .cse4)) (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 21:25:28,117 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-12-13 21:26:00,013 WARN L233 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 37 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:26:35,331 WARN L233 SmtUtils]: Spent 18.14s on a formula simplification. DAG size of input: 19 DAG size of output: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:26:37,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:26:47,348 WARN L233 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 14 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:26:50,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:26:53,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:27:26,002 WARN L233 SmtUtils]: Spent 22.71s on a formula simplification. DAG size of input: 19 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:27:28,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 21:27:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:27:28,926 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-12-13 21:27:28,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 21:27:28,951 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 21:27:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:27:28,952 INFO L225 Difference]: With dead ends: 23 [2022-12-13 21:27:28,952 INFO L226 Difference]: Without dead ends: 19 [2022-12-13 21:27:28,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 189.8s TimeCoverageRelationStatistics Valid=158, Invalid=274, Unknown=24, NotChecked=414, Total=870 [2022-12-13 21:27:28,953 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:27:28,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 14 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 8 Unknown, 90 Unchecked, 24.0s Time] [2022-12-13 21:27:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-12-13 21:27:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-12-13 21:27:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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-12-13 21:27:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-12-13 21:27:28,957 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2022-12-13 21:27:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:27:28,957 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-12-13 21:27:28,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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-12-13 21:27:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-12-13 21:27:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 21:27:28,958 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:27:28,958 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2022-12-13 21:27:28,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 21:27:29,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:27:29,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:27:29,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:27:29,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1499312107, now seen corresponding path program 4 times [2022-12-13 21:27:29,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:27:29,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136343276] [2022-12-13 21:27:29,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 21:27:29,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:27:29,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:27:29,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 21:27:29,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a53be4ed-4338-44a4-99f1-3abd79427898/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 21:27:30,595 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 21:27:30,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:27:30,641 WARN L261 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 21:27:30,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:29:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:29:00,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:29:31,919 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:29:51,652 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2022-12-13 21:30:14,227 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from false [2022-12-13 21:30:16,258 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from true [2022-12-13 21:30:44,227 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse6))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse8 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))) is different from true [2022-12-13 21:31:15,327 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse9 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse10 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse9 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse6 .cse8) (fp.sub c_currentRoundingMode .cse7 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))) is different from false [2022-12-13 21:31:17,384 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse9 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse10 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse9 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse6 .cse8) (fp.sub c_currentRoundingMode .cse7 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))) is different from true [2022-12-13 21:31:52,910 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse8))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse11 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse11 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse12 .cse8))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse9 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse9 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse10 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))) is different from false [2022-12-13 21:31:54,974 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse8))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse11 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse11 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse12 .cse8))) (let ((.cse10 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse9 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse9 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse10 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)) (not (fp.lt .cse9 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))) is different from true [2022-12-13 21:32:34,935 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse9)) (.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse9))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse5 .cse9)) (.cse2 (fp.add c_currentRoundingMode .cse4 .cse9))) (let ((.cse13 (fp.add c_currentRoundingMode .cse2 .cse9)) (.cse14 (fp.sub c_currentRoundingMode .cse3 .cse9))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse14 .cse9)) (.cse6 (fp.add c_currentRoundingMode .cse13 .cse9))) (let ((.cse11 (fp.add c_currentRoundingMode .cse6 .cse9)) (.cse12 (fp.sub c_currentRoundingMode .cse7 .cse9))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse12 .cse9)) (.cse0 (fp.add c_currentRoundingMode .cse11 .cse9))) (let ((.cse8 (fp.add c_currentRoundingMode .cse0 .cse9)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse9))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse8 .cse9) (fp.sub c_currentRoundingMode .cse10 .cse9)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse8 .cse10)) (not (fp.lt .cse13 .cse14)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))) is different from false [2022-12-13 21:32:37,008 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse9)) (.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse9))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse5 .cse9)) (.cse2 (fp.add c_currentRoundingMode .cse4 .cse9))) (let ((.cse13 (fp.add c_currentRoundingMode .cse2 .cse9)) (.cse14 (fp.sub c_currentRoundingMode .cse3 .cse9))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse14 .cse9)) (.cse6 (fp.add c_currentRoundingMode .cse13 .cse9))) (let ((.cse11 (fp.add c_currentRoundingMode .cse6 .cse9)) (.cse12 (fp.sub c_currentRoundingMode .cse7 .cse9))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse12 .cse9)) (.cse0 (fp.add c_currentRoundingMode .cse11 .cse9))) (let ((.cse8 (fp.add c_currentRoundingMode .cse0 .cse9)) (.cse10 (fp.sub c_currentRoundingMode .cse1 .cse9))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse8 .cse9) (fp.sub c_currentRoundingMode .cse10 .cse9)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse8 .cse10)) (not (fp.lt .cse13 .cse14)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))) is different from true [2022-12-13 21:33:21,475 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse11)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse11)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse11))) (let ((.cse16 (fp.sub c_currentRoundingMode .cse3 .cse11)) (.cse15 (fp.add c_currentRoundingMode .cse2 .cse11))) (let ((.cse6 (fp.add c_currentRoundingMode .cse15 .cse11)) (.cse7 (fp.sub c_currentRoundingMode .cse16 .cse11))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse7 .cse11)) (.cse8 (fp.add c_currentRoundingMode .cse6 .cse11))) (let ((.cse0 (fp.add c_currentRoundingMode .cse8 .cse11)) (.cse1 (fp.sub c_currentRoundingMode .cse9 .cse11))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse1 .cse11)) (.cse13 (fp.add c_currentRoundingMode .cse0 .cse11))) (let ((.cse10 (fp.add c_currentRoundingMode .cse13 .cse11)) (.cse12 (fp.sub c_currentRoundingMode .cse14 .cse11))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse10 .cse11) (fp.sub c_currentRoundingMode .cse12 .cse11)) (not (fp.lt .cse10 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))) is different from false [2022-12-13 21:33:23,563 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse11)) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse11))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 .cse11)) (.cse3 (fp.sub c_currentRoundingMode .cse5 .cse11))) (let ((.cse16 (fp.sub c_currentRoundingMode .cse3 .cse11)) (.cse15 (fp.add c_currentRoundingMode .cse2 .cse11))) (let ((.cse6 (fp.add c_currentRoundingMode .cse15 .cse11)) (.cse7 (fp.sub c_currentRoundingMode .cse16 .cse11))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse7 .cse11)) (.cse8 (fp.add c_currentRoundingMode .cse6 .cse11))) (let ((.cse0 (fp.add c_currentRoundingMode .cse8 .cse11)) (.cse1 (fp.sub c_currentRoundingMode .cse9 .cse11))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse1 .cse11)) (.cse13 (fp.add c_currentRoundingMode .cse0 .cse11))) (let ((.cse10 (fp.add c_currentRoundingMode .cse13 .cse11)) (.cse12 (fp.sub c_currentRoundingMode .cse14 .cse11))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse10 .cse11) (fp.sub c_currentRoundingMode .cse12 .cse11)) (not (fp.lt .cse10 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))) is different from true [2022-12-13 21:34:12,451 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse10))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse10)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse10))) (let ((.cse17 (fp.add c_currentRoundingMode .cse4 .cse10)) (.cse18 (fp.sub c_currentRoundingMode .cse5 .cse10))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse18 .cse10)) (.cse8 (fp.add c_currentRoundingMode .cse17 .cse10))) (let ((.cse11 (fp.add c_currentRoundingMode .cse8 .cse10)) (.cse12 (fp.sub c_currentRoundingMode .cse9 .cse10))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse12 .cse10)) (.cse2 (fp.add c_currentRoundingMode .cse11 .cse10))) (let ((.cse15 (fp.add c_currentRoundingMode .cse2 .cse10)) (.cse16 (fp.sub c_currentRoundingMode .cse3 .cse10))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse16 .cse10)) (.cse13 (fp.add c_currentRoundingMode .cse15 .cse10))) (let ((.cse0 (fp.add c_currentRoundingMode .cse13 .cse10)) (.cse1 (fp.sub c_currentRoundingMode .cse14 .cse10))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse10) (fp.sub c_currentRoundingMode .cse1 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))))) is different from false [2022-12-13 21:34:14,531 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse10))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse10)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse10))) (let ((.cse17 (fp.add c_currentRoundingMode .cse4 .cse10)) (.cse18 (fp.sub c_currentRoundingMode .cse5 .cse10))) (let ((.cse9 (fp.sub c_currentRoundingMode .cse18 .cse10)) (.cse8 (fp.add c_currentRoundingMode .cse17 .cse10))) (let ((.cse11 (fp.add c_currentRoundingMode .cse8 .cse10)) (.cse12 (fp.sub c_currentRoundingMode .cse9 .cse10))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse12 .cse10)) (.cse2 (fp.add c_currentRoundingMode .cse11 .cse10))) (let ((.cse15 (fp.add c_currentRoundingMode .cse2 .cse10)) (.cse16 (fp.sub c_currentRoundingMode .cse3 .cse10))) (let ((.cse14 (fp.sub c_currentRoundingMode .cse16 .cse10)) (.cse13 (fp.add c_currentRoundingMode .cse15 .cse10))) (let ((.cse0 (fp.add c_currentRoundingMode .cse13 .cse10)) (.cse1 (fp.sub c_currentRoundingMode .cse14 .cse10))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse10) (fp.sub c_currentRoundingMode .cse1 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))))) is different from true [2022-12-13 21:35:07,754 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse13)) (.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse13)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse13))) (let ((.cse20 (fp.sub c_currentRoundingMode .cse5 .cse13)) (.cse19 (fp.add c_currentRoundingMode .cse4 .cse13))) (let ((.cse8 (fp.add c_currentRoundingMode .cse19 .cse13)) (.cse9 (fp.sub c_currentRoundingMode .cse20 .cse13))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse9 .cse13)) (.cse10 (fp.add c_currentRoundingMode .cse8 .cse13))) (let ((.cse2 (fp.add c_currentRoundingMode .cse10 .cse13)) (.cse3 (fp.sub c_currentRoundingMode .cse11 .cse13))) (let ((.cse18 (fp.sub c_currentRoundingMode .cse3 .cse13)) (.cse17 (fp.add c_currentRoundingMode .cse2 .cse13))) (let ((.cse15 (fp.add c_currentRoundingMode .cse17 .cse13)) (.cse16 (fp.sub c_currentRoundingMode .cse18 .cse13))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse16 .cse13)) (.cse0 (fp.add c_currentRoundingMode .cse15 .cse13))) (let ((.cse12 (fp.add c_currentRoundingMode .cse0 .cse13)) (.cse14 (fp.sub c_currentRoundingMode .cse1 .cse13))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (not (fp.lt .cse10 .cse11)) (fp.lt (fp.add c_currentRoundingMode .cse12 .cse13) (fp.sub c_currentRoundingMode .cse14 .cse13)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse12 .cse14)) (not (fp.lt .cse17 .cse18)) (not (fp.lt .cse19 .cse20)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))))) is different from false [2022-12-13 21:35:09,839 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse13)) (.cse6 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse13))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse13)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse13))) (let ((.cse20 (fp.sub c_currentRoundingMode .cse5 .cse13)) (.cse19 (fp.add c_currentRoundingMode .cse4 .cse13))) (let ((.cse8 (fp.add c_currentRoundingMode .cse19 .cse13)) (.cse9 (fp.sub c_currentRoundingMode .cse20 .cse13))) (let ((.cse11 (fp.sub c_currentRoundingMode .cse9 .cse13)) (.cse10 (fp.add c_currentRoundingMode .cse8 .cse13))) (let ((.cse2 (fp.add c_currentRoundingMode .cse10 .cse13)) (.cse3 (fp.sub c_currentRoundingMode .cse11 .cse13))) (let ((.cse18 (fp.sub c_currentRoundingMode .cse3 .cse13)) (.cse17 (fp.add c_currentRoundingMode .cse2 .cse13))) (let ((.cse15 (fp.add c_currentRoundingMode .cse17 .cse13)) (.cse16 (fp.sub c_currentRoundingMode .cse18 .cse13))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse16 .cse13)) (.cse0 (fp.add c_currentRoundingMode .cse15 .cse13))) (let ((.cse12 (fp.add c_currentRoundingMode .cse0 .cse13)) (.cse14 (fp.sub c_currentRoundingMode .cse1 .cse13))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (not (fp.lt .cse10 .cse11)) (fp.lt (fp.add c_currentRoundingMode .cse12 .cse13) (fp.sub c_currentRoundingMode .cse14 .cse13)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse12 .cse14)) (not (fp.lt .cse17 .cse18)) (not (fp.lt .cse19 .cse20)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))))))))))) is different from true [2022-12-13 21:36:07,628 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse9 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse10))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse9 .cse10)) (.cse6 (fp.add c_currentRoundingMode .cse8 .cse10))) (let ((.cse21 (fp.add c_currentRoundingMode .cse6 .cse10)) (.cse22 (fp.sub c_currentRoundingMode .cse7 .cse10))) (let ((.cse12 (fp.sub c_currentRoundingMode .cse22 .cse10)) (.cse11 (fp.add c_currentRoundingMode .cse21 .cse10))) (let ((.cse13 (fp.add c_currentRoundingMode .cse11 .cse10)) (.cse14 (fp.sub c_currentRoundingMode .cse12 .cse10))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse14 .cse10)) (.cse2 (fp.add c_currentRoundingMode .cse13 .cse10))) (let ((.cse19 (fp.add c_currentRoundingMode .cse2 .cse10)) (.cse20 (fp.sub c_currentRoundingMode .cse3 .cse10))) (let ((.cse16 (fp.sub c_currentRoundingMode .cse20 .cse10)) (.cse15 (fp.add c_currentRoundingMode .cse19 .cse10))) (let ((.cse0 (fp.add c_currentRoundingMode .cse15 .cse10)) (.cse1 (fp.sub c_currentRoundingMode .cse16 .cse10))) (let ((.cse18 (fp.sub c_currentRoundingMode .cse1 .cse10)) (.cse17 (fp.add c_currentRoundingMode .cse0 .cse10))) (let ((.cse4 (fp.add c_currentRoundingMode .cse17 .cse10)) (.cse5 (fp.sub c_currentRoundingMode .cse18 .cse10))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (not (fp.lt .cse8 .cse9)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse10) (fp.sub c_currentRoundingMode .cse5 .cse10)) (not (fp.lt .cse11 .cse12)) (not (fp.lt .cse13 .cse14)) (not (fp.lt .cse15 .cse16)) (not (fp.lt .cse17 .cse18)) (not (fp.lt .cse19 .cse20)) (not (fp.lt .cse21 .cse22)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))))))))))) is different from false