./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro --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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- 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-8393723 [2022-11-18 20:51:25,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:51:25,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:51:25,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:51:25,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:51:25,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:51:25,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:51:25,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:51:25,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:51:25,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:51:25,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:51:25,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:51:25,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:51:25,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:51:25,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:51:25,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:51:25,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:51:25,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:51:25,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:51:25,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:51:25,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:51:25,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:51:25,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:51:25,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:51:25,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:51:25,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:51:25,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:51:25,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:51:25,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:51:25,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:51:25,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:51:25,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:51:25,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:51:25,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:51:25,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:51:25,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:51:25,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:51:25,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:51:25,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:51:25,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:51:25,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:51:25,191 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:51:25,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:51:25,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:51:25,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:51:25,235 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:51:25,236 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:51:25,236 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:51:25,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:51:25,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:51:25,237 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:51:25,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:51:25,238 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:51:25,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:51:25,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:51:25,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:51:25,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:51:25,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:51:25,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:51:25,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:51:25,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:51:25,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:51:25,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:51:25,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:51:25,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:51:25,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:51:25,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:25,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:51:25,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:51:25,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:51:25,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:51:25,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:51:25,264 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:51:25,264 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:51:25,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:51:25,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/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_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-11-18 20:51:25,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:51:25,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:51:25,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:51:25,584 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:51:25,585 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:51:25,586 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/float-benchs/filter1.c [2022-11-18 20:51:25,657 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/data/16ccf4d1d/302effc0a24140f0956ba2e3798b04d4/FLAGbdc084a2e [2022-11-18 20:51:26,191 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:51:26,192 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/sv-benchmarks/c/float-benchs/filter1.c [2022-11-18 20:51:26,198 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/data/16ccf4d1d/302effc0a24140f0956ba2e3798b04d4/FLAGbdc084a2e [2022-11-18 20:51:26,542 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/data/16ccf4d1d/302effc0a24140f0956ba2e3798b04d4 [2022-11-18 20:51:26,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:51:26,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:51:26,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:26,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:51:26,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:51:26,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:26,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9136e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26, skipping insertion in model container [2022-11-18 20:51:26,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:26,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:51:26,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:51:26,887 WARN L234 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_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-18 20:51:26,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:26,930 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:51:26,948 WARN L234 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_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-18 20:51:26,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:26,980 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:51:26,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26 WrapperNode [2022-11-18 20:51:26,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:26,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:26,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:51:26,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:51:26,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,027 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-11-18 20:51:27,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:27,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:51:27,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:51:27,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:51:27,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,074 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:51:27,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:51:27,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:51:27,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:51:27,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (1/1) ... [2022-11-18 20:51:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:27,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:51:27,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:51:27,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:51:27,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:51:27,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:51:27,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:51:27,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:51:27,285 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:51:27,288 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:51:27,484 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:51:27,491 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:51:27,491 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:51:27,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:27 BoogieIcfgContainer [2022-11-18 20:51:27,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:51:27,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:51:27,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:51:27,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:51:27,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:51:26" (1/3) ... [2022-11-18 20:51:27,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a8413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:27, skipping insertion in model container [2022-11-18 20:51:27,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:26" (2/3) ... [2022-11-18 20:51:27,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a8413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:27, skipping insertion in model container [2022-11-18 20:51:27,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:27" (3/3) ... [2022-11-18 20:51:27,515 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-11-18 20:51:27,533 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:51:27,533 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:51:27,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:51:27,605 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;@3cc58c29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:51:27,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:51:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:51:27,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:27,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:27,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:51:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:27,637 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2022-11-18 20:51:27,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:27,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787835515] [2022-11-18 20:51:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:27,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:27,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787835515] [2022-11-18 20:51:27,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787835515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:27,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:27,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957744887] [2022-11-18 20:51:27,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:27,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:51:27,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:27,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:51:27,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:51:27,924 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:27,943 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-11-18 20:51:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:51:27,946 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-18 20:51:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:27,956 INFO L225 Difference]: With dead ends: 30 [2022-11-18 20:51:27,957 INFO L226 Difference]: Without dead ends: 12 [2022-11-18 20:51:27,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:51:27,967 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:27,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:51:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-18 20:51:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-18 20:51:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-18 20:51:28,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-11-18 20:51:28,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:28,016 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-18 20:51:28,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-18 20:51:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:51:28,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:28,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:28,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:51:28,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:51:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2022-11-18 20:51:28,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:28,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777844641] [2022-11-18 20:51:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:28,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:51:28,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:51:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:51:28,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:51:28,110 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:51:28,113 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:51:28,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:51:28,126 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-18 20:51:28,130 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:51:28,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:51:28 BoogieIcfgContainer [2022-11-18 20:51:28,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:51:28,161 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:51:28,161 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:51:28,161 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:51:28,162 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:27" (3/4) ... [2022-11-18 20:51:28,166 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:51:28,166 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:51:28,167 INFO L158 Benchmark]: Toolchain (without parser) took 1620.87ms. Allocated memory is still 109.1MB. Free memory was 66.5MB in the beginning and 47.7MB in the end (delta: 18.8MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-11-18 20:51:28,168 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 109.1MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:51:28,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.51ms. Allocated memory is still 109.1MB. Free memory was 66.3MB in the beginning and 84.5MB in the end (delta: -18.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:51:28,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.54ms. Allocated memory is still 109.1MB. Free memory was 84.5MB in the beginning and 83.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:51:28,170 INFO L158 Benchmark]: Boogie Preprocessor took 50.78ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 81.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:51:28,170 INFO L158 Benchmark]: RCFGBuilder took 413.84ms. Allocated memory is still 109.1MB. Free memory was 81.7MB in the beginning and 72.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:51:28,171 INFO L158 Benchmark]: TraceAbstraction took 660.65ms. Allocated memory is still 109.1MB. Free memory was 71.6MB in the beginning and 48.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-18 20:51:28,171 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 109.1MB. Free memory was 48.1MB in the beginning and 47.7MB in the end (delta: 410.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:51:28,175 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.33ms. Allocated memory is still 109.1MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.51ms. Allocated memory is still 109.1MB. Free memory was 66.3MB in the beginning and 84.5MB in the end (delta: -18.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.54ms. Allocated memory is still 109.1MB. Free memory was 84.5MB in the beginning and 83.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.78ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 81.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.84ms. Allocated memory is still 109.1MB. Free memory was 81.7MB in the beginning and 72.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 660.65ms. Allocated memory is still 109.1MB. Free memory was 71.6MB in the beginning and 48.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 109.1MB. Free memory was 48.1MB in the beginning and 47.7MB in the end (delta: 410.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of to_real at line 34. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 VAL [i=0] [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] CALL assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 VAL [E0=53, i=0] [L39] E1 = E0 [L41] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 17 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 20:51:28,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro --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 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- 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-8393723 [2022-11-18 20:51:30,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:51:30,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:51:30,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:51:30,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:51:30,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:51:30,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:51:30,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:51:30,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:51:30,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:51:30,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:51:30,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:51:30,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:51:30,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:51:30,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:51:30,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:51:30,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:51:30,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:51:30,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:51:30,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:51:30,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:51:30,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:51:30,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:51:30,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:51:30,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:51:30,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:51:30,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:51:30,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:51:30,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:51:30,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:51:30,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:51:30,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:51:30,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:51:30,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:51:30,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:51:30,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:51:30,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:51:30,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:51:30,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:51:30,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:51:30,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:51:30,994 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-18 20:51:31,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:51:31,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:51:31,036 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:51:31,036 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:51:31,037 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:51:31,038 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:51:31,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:51:31,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:51:31,040 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:51:31,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:51:31,042 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:51:31,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:51:31,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:51:31,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:51:31,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:51:31,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:51:31,044 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:51:31,044 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:51:31,044 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:51:31,045 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:51:31,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:51:31,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:51:31,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:51:31,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:51:31,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:51:31,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:51:31,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:31,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:51:31,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:51:31,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:51:31,048 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:51:31,048 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:51:31,049 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:51:31,049 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:51:31,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:51:31,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:51:31,050 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/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_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro 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 -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2022-11-18 20:51:31,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:51:31,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:51:31,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:51:31,562 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:51:31,563 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:51:31,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/float-benchs/filter1.c [2022-11-18 20:51:31,656 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/data/3f71dd285/c9ff0396a2094c5e906dae07de34adee/FLAGa0858b62d [2022-11-18 20:51:32,245 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:51:32,246 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/sv-benchmarks/c/float-benchs/filter1.c [2022-11-18 20:51:32,255 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/data/3f71dd285/c9ff0396a2094c5e906dae07de34adee/FLAGa0858b62d [2022-11-18 20:51:32,630 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/data/3f71dd285/c9ff0396a2094c5e906dae07de34adee [2022-11-18 20:51:32,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:51:32,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:51:32,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:32,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:51:32,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:51:32,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:32" (1/1) ... [2022-11-18 20:51:32,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6251680d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:32, skipping insertion in model container [2022-11-18 20:51:32,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:32" (1/1) ... [2022-11-18 20:51:32,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:51:32,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:51:32,901 WARN L234 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_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-18 20:51:32,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:32,949 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:51:33,031 WARN L234 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_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2022-11-18 20:51:33,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:33,064 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:51:33,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33 WrapperNode [2022-11-18 20:51:33,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:33,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:33,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:51:33,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:51:33,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,113 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-11-18 20:51:33,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:33,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:51:33,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:51:33,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:51:33,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,152 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:51:33,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:51:33,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:51:33,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:51:33,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (1/1) ... [2022-11-18 20:51:33,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:33,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:51:33,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:51:33,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:51:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:51:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:51:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:51:33,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:51:33,350 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:51:33,351 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:51:35,644 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:51:35,651 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:51:35,652 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:51:35,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:35 BoogieIcfgContainer [2022-11-18 20:51:35,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:51:35,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:51:35,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:51:35,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:51:35,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:51:32" (1/3) ... [2022-11-18 20:51:35,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dd7780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:35, skipping insertion in model container [2022-11-18 20:51:35,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:33" (2/3) ... [2022-11-18 20:51:35,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dd7780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:35, skipping insertion in model container [2022-11-18 20:51:35,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:35" (3/3) ... [2022-11-18 20:51:35,664 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2022-11-18 20:51:35,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:51:35,719 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:51:35,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:51:35,832 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;@6d02cd59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:51:35,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:51:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:51:35,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:35,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:35,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:51:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2022-11-18 20:51:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:51:35,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859580111] [2022-11-18 20:51:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:35,885 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-11-18 20:51:35,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:51:35,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:35,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:35,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:51:35,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:51:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:35,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:51:35,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:51:35,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859580111] [2022-11-18 20:51:35,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859580111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:35,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:35,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580046787] [2022-11-18 20:51:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:36,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:51:36,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:51:36,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:51:36,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:51:36,043 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:36,081 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-11-18 20:51:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:51:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-18 20:51:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:36,093 INFO L225 Difference]: With dead ends: 30 [2022-11-18 20:51:36,093 INFO L226 Difference]: Without dead ends: 12 [2022-11-18 20:51:36,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:51:36,102 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:36,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:51:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-18 20:51:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-18 20:51:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-18 20:51:36,142 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-11-18 20:51:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:36,142 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-18 20:51:36,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-18 20:51:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:51:36,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:36,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:36,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Ended with exit code 0 [2022-11-18 20:51:36,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:36,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:51:36,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:36,360 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2022-11-18 20:51:36,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:51:36,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874423207] [2022-11-18 20:51:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:36,362 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-11-18 20:51:36,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:51:36,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:36,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:36,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:51:36,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:51:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:36,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:51:36,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:51:36,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874423207] [2022-11-18 20:51:36,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874423207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:36,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:36,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:51:36,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827930424] [2022-11-18 20:51:36,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:36,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:51:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:51:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:51:36,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:51:36,673 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:38,125 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-18 20:51:38,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:51:38,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-18 20:51:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:38,128 INFO L225 Difference]: With dead ends: 28 [2022-11-18 20:51:38,129 INFO L226 Difference]: Without dead ends: 26 [2022-11-18 20:51:38,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:38,131 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:38,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-18 20:51:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-18 20:51:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2022-11-18 20:51:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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-11-18 20:51:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-18 20:51:38,144 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-11-18 20:51:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:38,145 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-18 20:51:38,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-18 20:51:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:51:38,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:38,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:38,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-18 20:51:38,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:38,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:51:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash -274941459, now seen corresponding path program 1 times [2022-11-18 20:51:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:51:38,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759185207] [2022-11-18 20:51:38,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:38,373 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-11-18 20:51:38,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:51:38,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:38,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:38,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 20:51:38,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:51:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:40,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:51:40,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:51:40,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759185207] [2022-11-18 20:51:40,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759185207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:40,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:40,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:51:40,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036781549] [2022-11-18 20:51:40,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:40,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:51:40,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:51:40,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:51:40,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:51:40,301 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:43,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-18 20:51:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:43,831 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-11-18 20:51:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:51:43,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-18 20:51:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:43,834 INFO L225 Difference]: With dead ends: 24 [2022-11-18 20:51:43,834 INFO L226 Difference]: Without dead ends: 22 [2022-11-18 20:51:43,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:51:43,836 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:43,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 1 Unknown, 8 Unchecked, 3.2s Time] [2022-11-18 20:51:43,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-18 20:51:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-11-18 20:51:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-11-18 20:51:43,843 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2022-11-18 20:51:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:43,843 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-18 20:51:43,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-11-18 20:51:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:51:43,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:43,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:43,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:44,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:44,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:51:44,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:44,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1443795685, now seen corresponding path program 1 times [2022-11-18 20:51:44,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:51:44,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795436060] [2022-11-18 20:51:44,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:44,061 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-11-18 20:51:44,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:51:44,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:44,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:51:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:44,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 20:51:44,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:41,133 WARN L233 SmtUtils]: Spent 9.58s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:52:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:52:42,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:52:57,626 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-18 20:52:59,670 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-18 20:53:22,639 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2022-11-18 20:53:24,692 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-11-18 20:53:51,776 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1))))))) is different from true [2022-11-18 20:55:33,002 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3)))))) is different from true [2022-11-18 20:56:00,936 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse3))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-11-18 20:56:18,199 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse1 (fp.neg .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)))))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) (fp.neg .cse3)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1))))))) is different from false [2022-11-18 20:56:20,219 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse1 (fp.neg .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)))))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) (fp.neg .cse3)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1))))))) is different from true [2022-11-18 20:56:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 20:56:29,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:56:29,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795436060] [2022-11-18 20:56:29,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795436060] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:56:29,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:56:29,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-11-18 20:56:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947283438] [2022-11-18 20:56:29,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:56:29,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:56:29,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:56:29,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:56:29,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=130, Unknown=18, NotChecked=174, Total=380 [2022-11-18 20:56:29,230 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:56:31,278 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse1 (fp.neg .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) .cse3) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)))))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_7| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |v_ULTIMATE.start_main_~E0~0#1_7|) (fp.neg .cse3)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_7| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_7| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-18 20:57:14,018 WARN L233 SmtUtils]: Spent 32.45s on a formula simplification. DAG size of input: 43 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:57:38,549 WARN L233 SmtUtils]: Spent 14.87s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:57:41,376 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse3)))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse1) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-18 20:57:44,005 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.neg .cse2)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_6| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_6| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_6| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_6|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-18 20:57:46,663 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 (fp.neg .cse4))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) .cse2) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (let ((.cse6 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse3)) (.cse5 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse4))) (or (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6) (and (or (not .cse6) (not .cse5)) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-18 20:57:49,098 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse3) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse0) (fp.leq .cse1 .cse2) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-18 20:58:01,013 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:58:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:04,553 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-11-18 20:58:04,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:58:04,554 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 17 [2022-11-18 20:58:04,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:04,555 INFO L225 Difference]: With dead ends: 33 [2022-11-18 20:58:04,555 INFO L226 Difference]: Without dead ends: 31 [2022-11-18 20:58:04,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 158.4s TimeCoverageRelationStatistics Valid=90, Invalid=231, Unknown=29, NotChecked=462, Total=812 [2022-11-18 20:58:04,557 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:04,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 47 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2022-11-18 20:58:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-18 20:58:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-11-18 20:58:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-11-18 20:58:04,564 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2022-11-18 20:58:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:04,565 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-11-18 20:58:04,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-11-18 20:58:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:58:04,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:04,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:58:04,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-18 20:58:04,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:58:04,775 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:58:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1185630247, now seen corresponding path program 1 times [2022-11-18 20:58:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:58:04,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847005741] [2022-11-18 20:58:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:04,777 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-11-18 20:58:04,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:58:04,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:58:04,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46fff5ab-4cd8-4bd5-9f53-756ebf8c36dd/bin/uautomizer-TMbwUNV5ro/mathsat -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-11-18 20:58:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:06,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:58:06,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:58:35,888 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse1 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) |ULTIMATE.start_main_~E1~0#1|) .cse2)))) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-18 21:00:18,587 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (let ((.cse5 (fp.neg .cse6)) (.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4))) (or (and (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse6)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|))) (and (fp.leq .cse7 .cse6) (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq .cse7 .cse5) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2022-11-18 21:00:49,990 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse5))) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))))) is different from false [2022-11-18 21:00:52,024 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse0)) (.cse3 (fp.mul roundNearestTiesToEven .cse2 .cse4)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse5))) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~E1~0#1|) .cse4)) |ULTIMATE.start_main_~E0~0#1|) |ULTIMATE.start_main_~E1~0#1|) .cse5)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0)))))))) is different from true [2022-11-18 21:00:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-18 21:00:52,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:01:02,745 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-18 21:01:04,807 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-18 21:01:27,916 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2022-11-18 21:01:29,977 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-11-18 21:01:57,309 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3))))))) is different from true [2022-11-18 21:03:15,232 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E1~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from true [2022-11-18 21:03:42,605 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse4))) (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse0 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3))))))) (not (fp.geq |c_ULTIMATE.start_main_~S~0#1| .cse2)) (not (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse4))))) is different from true [2022-11-18 21:04:19,457 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse2)) (.cse6 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4)))))) (not (fp.geq .cse6 .cse4)) (not (fp.leq .cse6 .cse2))))) is different from false [2022-11-18 21:04:21,584 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse2)) (.cse6 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4)))))) (not (fp.geq .cse6 .cse4)) (not (fp.leq .cse6 .cse2))))) is different from true [2022-11-18 21:05:37,731 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse2)) (.cse6 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4)))))) (not (fp.geq .cse6 .cse4)) (not (fp.leq .cse6 .cse2)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from false [2022-11-18 21:05:39,865 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse4 (fp.neg .cse2)) (.cse6 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode .cse5 .cse6))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_9|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4)))))) (not (fp.geq .cse6 .cse4)) (not (fp.leq .cse6 .cse2)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))))) is different from true [2022-11-18 21:06:42,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse5 (fp.neg .cse4)) (.cse0 (fp.neg .cse1)) (.cse6 (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~S~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |v_ULTIMATE.start_main_~E0~0#1_9|) |v_ULTIMATE.start_main_~E0~0#1_10|) .cse4))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse1)) (not (fp.geq .cse3 .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse0)) (not (fp.leq .cse3 .cse4))))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse7) |v_ULTIMATE.start_main_~E0~0#1_9|) |v_ULTIMATE.start_main_~E0~0#1_10|) .cse5))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse1)) (not (fp.geq .cse7 .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse0)) (not (fp.leq .cse7 .cse4)))))))) is different from false [2022-11-18 21:06:44,408 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse5 (fp.neg .cse4)) (.cse0 (fp.neg .cse1)) (.cse6 (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~S~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) |v_ULTIMATE.start_main_~E0~0#1_9|) |v_ULTIMATE.start_main_~E0~0#1_10|) .cse4))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse1)) (not (fp.geq .cse3 .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse0)) (not (fp.leq .cse3 .cse4))))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_10|) |c_ULTIMATE.start_main_~E1~0#1|))) (or (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse1)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse7) |v_ULTIMATE.start_main_~E0~0#1_9|) |v_ULTIMATE.start_main_~E0~0#1_10|) .cse5))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_10| .cse1)) (not (fp.geq .cse7 .cse5)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_10| .cse0)) (not (fp.leq .cse7 .cse4)))))))) is different from true