./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN --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 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- 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-6b4ec56 [2022-11-20 09:27:26,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:26,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:26,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:26,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:26,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:26,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:26,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:26,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:26,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:26,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:26,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:26,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:26,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:26,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:26,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:26,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:26,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:26,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:26,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:26,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:26,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:26,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:26,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:26,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:26,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:26,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:26,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:26,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:26,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:26,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:26,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:26,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:26,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:26,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:26,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:26,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:26,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:26,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:26,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:26,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:26,235 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:27:26,271 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:26,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:26,272 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:26,272 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:26,273 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:26,273 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:26,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:26,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:26,274 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:26,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:26,275 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:26,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:27:26,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:26,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:26,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:27:26,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:26,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:27:26,276 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:26,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:27:26,276 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:26,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:27:26,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:26,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:26,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:26,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:26,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:26,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:26,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:27:26,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:27:26,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:27:26,279 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:27:26,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:27:26,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:27:26,279 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_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN 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 -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2022-11-20 09:27:26,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:26,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:26,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:26,585 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:26,586 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:26,587 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2022-11-20 09:27:29,731 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:29,936 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:29,936 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2022-11-20 09:27:29,946 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/data/bc877ef94/7048cd7fc4d842088a02f6367e703057/FLAG638a11821 [2022-11-20 09:27:29,966 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/data/bc877ef94/7048cd7fc4d842088a02f6367e703057 [2022-11-20 09:27:29,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:29,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:29,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:29,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:29,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:29,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:29" (1/1) ... [2022-11-20 09:27:29,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a964d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:29, skipping insertion in model container [2022-11-20 09:27:29,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:29" (1/1) ... [2022-11-20 09:27:29,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:30,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:30,176 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2022-11-20 09:27:30,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:30,194 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:30,209 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2022-11-20 09:27:30,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:30,226 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:30,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30 WrapperNode [2022-11-20 09:27:30,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:30,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:30,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:30,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:30,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,259 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-11-20 09:27:30,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:30,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:30,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:30,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:30,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,279 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:30,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:30,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:30,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:30,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (1/1) ... [2022-11-20 09:27:30,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:30,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:30,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:30,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:27:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:30,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:30,456 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:30,459 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:30,700 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:30,706 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:30,706 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:27:30,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:30 BoogieIcfgContainer [2022-11-20 09:27:30,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:30,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:30,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:30,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:30,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:29" (1/3) ... [2022-11-20 09:27:30,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a59a104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:30, skipping insertion in model container [2022-11-20 09:27:30,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:30" (2/3) ... [2022-11-20 09:27:30,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a59a104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:30, skipping insertion in model container [2022-11-20 09:27:30,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:30" (3/3) ... [2022-11-20 09:27:30,718 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2022-11-20 09:27:30,738 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:30,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:27:30,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:30,796 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;@39190cce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:30,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 09:27:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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-20 09:27:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:27:30,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:30,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:30,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash -34829450, now seen corresponding path program 1 times [2022-11-20 09:27:30,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:30,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697785219] [2022-11-20 09:27:30,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,085 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-20 09:27:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:31,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697785219] [2022-11-20 09:27:31,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697785219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:31,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:31,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110890037] [2022-11-20 09:27:31,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:31,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:31,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:31,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:31,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:31,130 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:31,285 INFO L93 Difference]: Finished difference Result 115 states and 167 transitions. [2022-11-20 09:27:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:27:31,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 09:27:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:31,297 INFO L225 Difference]: With dead ends: 115 [2022-11-20 09:27:31,298 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 09:27:31,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:27:31,305 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 162 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:31,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 194 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 09:27:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 23. [2022-11-20 09:27:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-11-20 09:27:31,346 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-11-20 09:27:31,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:31,348 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-11-20 09:27:31,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-11-20 09:27:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:27:31,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:31,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:31,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:27:31,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:31,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash -17818789, now seen corresponding path program 1 times [2022-11-20 09:27:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:31,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585638270] [2022-11-20 09:27:31,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:27:31,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:27:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:27:31,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:27:31,448 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:27:31,450 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 09:27:31,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:27:31,457 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-20 09:27:31,461 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:27:31,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:27:31 BoogieIcfgContainer [2022-11-20 09:27:31,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:27:31,508 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:27:31,508 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:27:31,508 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:27:31,509 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:30" (3/4) ... [2022-11-20 09:27:31,512 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:27:31,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:27:31,514 INFO L158 Benchmark]: Toolchain (without parser) took 1536.91ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 94.6MB in the beginning and 117.6MB in the end (delta: -22.9MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2022-11-20 09:27:31,514 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 146.8MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:27:31,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.66ms. Allocated memory is still 146.8MB. Free memory was 94.3MB in the beginning and 83.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 09:27:31,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.82ms. Allocated memory is still 146.8MB. Free memory was 83.7MB in the beginning and 82.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:27:31,520 INFO L158 Benchmark]: Boogie Preprocessor took 22.29ms. Allocated memory is still 146.8MB. Free memory was 82.2MB in the beginning and 80.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:27:31,524 INFO L158 Benchmark]: RCFGBuilder took 425.30ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 80.9MB in the beginning and 152.4MB in the end (delta: -71.4MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2022-11-20 09:27:31,524 INFO L158 Benchmark]: TraceAbstraction took 795.79ms. Allocated memory is still 184.5MB. Free memory was 152.0MB in the beginning and 117.6MB in the end (delta: 34.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-20 09:27:31,524 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 184.5MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:27:31,532 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.28ms. Allocated memory is still 146.8MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.66ms. Allocated memory is still 146.8MB. Free memory was 94.3MB in the beginning and 83.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.82ms. Allocated memory is still 146.8MB. Free memory was 83.7MB in the beginning and 82.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.29ms. Allocated memory is still 146.8MB. Free memory was 82.2MB in the beginning and 80.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.30ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 80.9MB in the beginning and 152.4MB in the end (delta: -71.4MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 795.79ms. Allocated memory is still 184.5MB. Free memory was 152.0MB in the beginning and 117.6MB in the end (delta: 34.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 184.5MB. Free memory is still 117.6MB. 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: 66]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 20, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] float main__X; [L15] float main__Y; [L16] float main__S; [L17] float main__R; [L18] float main__D; [L19] int main__i; [L20] main__Y = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i < 100000 [L25] main__X = __VERIFIER_nondet_float() [L26] main__D = __VERIFIER_nondet_float() [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__D=54, main__i=0, main__X=53] [L28] COND TRUE main__X >= -128.0 VAL [__return_main=0, main__D=54, main__i=0, main__X=53] [L30] COND TRUE main__X <= 128.0 [L32] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__D=54, main__i=0, main__X=53] [L34] COND TRUE main____CPAchecker_TMP_0 != 0 [L36] int main____CPAchecker_TMP_1; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__D=54, main__i=0, main__X=53] [L37] COND TRUE main__D >= 0.0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__D=54, main__i=0, main__X=53] [L39] COND TRUE main__D <= 16.0 [L41] main____CPAchecker_TMP_1 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=54, main__i=0, main__X=53] [L43] COND TRUE main____CPAchecker_TMP_1 != 0 [L45] main__S = main__Y [L46] main__Y = main__X [L47] main__R = main__X - main__S VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=54, main__i=0, main__S=55, main__X=53, main__Y=53] [L48] COND TRUE main__R <= (-main__D) [L50] main__Y = main__S - main__D VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=54, main__i=0, main__S=55, main__X=53] [L52] int main____CPAchecker_TMP_2; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=54, main__i=0, main__S=55, main__X=53] [L53] COND FALSE !(main__Y >= -129.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__D=54, main__i=0, main__S=55, main__X=53] [L79] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=54, main__i=0, main__S=55, main__X=53] [L60] int __tmp_1; [L61] __tmp_1 = main____CPAchecker_TMP_2 [L62] int __VERIFIER_assert__cond; [L63] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=54, main__i=0, main__S=55, main__X=53] [L64] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=54, main__i=0, main__S=55, main__X=53] [L66] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__D=54, main__i=0, main__S=55, main__X=53] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 60 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 69 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 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-20 09:27:31,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN --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 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- 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-6b4ec56 [2022-11-20 09:27:34,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:34,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:34,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:34,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:34,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:34,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:34,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:34,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:34,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:34,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:34,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:34,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:34,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:34,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:34,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:34,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:34,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:34,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:34,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:34,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:34,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:34,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:34,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:34,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:34,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:34,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:34,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:34,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:34,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:34,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:34,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:34,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:34,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:34,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:34,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:34,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:34,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:34,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:34,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:34,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:34,173 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 09:27:34,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:34,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:34,215 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:34,215 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:34,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:34,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:34,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:34,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:34,217 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:34,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:34,218 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:34,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:34,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:34,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:27:34,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:34,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:27:34,219 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:27:34,219 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 09:27:34,219 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 09:27:34,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:34,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:27:34,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:34,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:27:34,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:34,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:34,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:34,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:34,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:34,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:34,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:27:34,222 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 09:27:34,222 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 09:27:34,222 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:27:34,222 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:27:34,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:27:34,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 09:27:34,223 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_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN 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 -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2022-11-20 09:27:34,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:34,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:34,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:34,657 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:34,657 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:34,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2022-11-20 09:27:37,943 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:38,175 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:38,175 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2022-11-20 09:27:38,182 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/data/e0c175af1/eff188465608456389729462bca2992b/FLAG5bf4f4d33 [2022-11-20 09:27:38,197 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/data/e0c175af1/eff188465608456389729462bca2992b [2022-11-20 09:27:38,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:38,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:38,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:38,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:38,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:38,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b9d630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38, skipping insertion in model container [2022-11-20 09:27:38,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:38,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:38,421 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2022-11-20 09:27:38,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:38,444 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:38,464 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2022-11-20 09:27:38,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:38,497 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:38,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38 WrapperNode [2022-11-20 09:27:38,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:38,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:38,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:38,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:38,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,559 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-11-20 09:27:38,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:38,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:38,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:38,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:38,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,599 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:38,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:38,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:38,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:38,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (1/1) ... [2022-11-20 09:27:38,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:38,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:38,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:38,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 09:27:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:38,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:38,793 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:38,813 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:40,134 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:40,138 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:40,139 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:27:40,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:40 BoogieIcfgContainer [2022-11-20 09:27:40,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:40,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:40,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:40,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:40,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:38" (1/3) ... [2022-11-20 09:27:40,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4475eff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:40, skipping insertion in model container [2022-11-20 09:27:40,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:38" (2/3) ... [2022-11-20 09:27:40,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4475eff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:40, skipping insertion in model container [2022-11-20 09:27:40,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:40" (3/3) ... [2022-11-20 09:27:40,149 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2022-11-20 09:27:40,174 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:40,174 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:27:40,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:40,240 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;@2a97ed36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:40,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 09:27:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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-20 09:27:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:27:40,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:40,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:40,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash -34829450, now seen corresponding path program 1 times [2022-11-20 09:27:40,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:27:40,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344181020] [2022-11-20 09:27:40,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:40,271 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-20 09:27:40,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:27:40,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:27:40,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:27:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:40,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 09:27:40,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:40,503 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-20 09:27:40,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:40,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:27:40,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344181020] [2022-11-20 09:27:40,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344181020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:40,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:40,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127173284] [2022-11-20 09:27:40,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:40,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:27:40,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:40,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:40,542 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:40,681 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-11-20 09:27:40,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:40,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 09:27:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:40,699 INFO L225 Difference]: With dead ends: 51 [2022-11-20 09:27:40,699 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 09:27:40,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:40,711 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 53 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:40,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 09:27:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2022-11-20 09:27:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-11-20 09:27:40,750 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-11-20 09:27:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:40,751 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-11-20 09:27:40,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-11-20 09:27:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:27:40,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:40,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:40,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:40,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:27:40,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:40,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:40,957 INFO L85 PathProgramCache]: Analyzing trace with hash -17818789, now seen corresponding path program 1 times [2022-11-20 09:27:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:27:40,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184453165] [2022-11-20 09:27:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:40,959 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-20 09:27:40,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:27:40,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:27:40,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:27:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:41,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:27:41,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:50,922 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-20 09:27:50,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:50,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:27:50,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184453165] [2022-11-20 09:27:50,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184453165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:50,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:50,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:27:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415802785] [2022-11-20 09:27:50,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:50,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:50,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:27:50,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:50,930 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:02,653 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-11-20 09:28:02,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:28:02,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 09:28:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:02,660 INFO L225 Difference]: With dead ends: 67 [2022-11-20 09:28:02,661 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 09:28:02,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:02,662 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:02,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 90 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 24 Unchecked, 7.7s Time] [2022-11-20 09:28:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 09:28:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2022-11-20 09:28:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2022-11-20 09:28:02,678 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 16 [2022-11-20 09:28:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:02,680 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2022-11-20 09:28:02,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-11-20 09:28:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:28:02,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:02,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:02,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-20 09:28:02,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:02,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1271663018, now seen corresponding path program 1 times [2022-11-20 09:28:02,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:02,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531081481] [2022-11-20 09:28:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:02,900 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-20 09:28:02,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:02,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:02,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:03,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:28:03,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:03,059 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-20 09:28:03,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:03,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:03,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531081481] [2022-11-20 09:28:03,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531081481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:03,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:03,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:28:03,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087764371] [2022-11-20 09:28:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:03,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:28:03,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:03,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:28:03,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:28:03,062 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:03,207 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-11-20 09:28:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:28:03,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 09:28:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:03,214 INFO L225 Difference]: With dead ends: 56 [2022-11-20 09:28:03,214 INFO L226 Difference]: Without dead ends: 33 [2022-11-20 09:28:03,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:28:03,215 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:03,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:28:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-20 09:28:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-20 09:28:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-11-20 09:28:03,222 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 16 [2022-11-20 09:28:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:03,223 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-11-20 09:28:03,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-11-20 09:28:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 09:28:03,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:03,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:03,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:03,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:03,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:03,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1069421883, now seen corresponding path program 1 times [2022-11-20 09:28:03,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:03,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438166671] [2022-11-20 09:28:03,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:03,432 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-20 09:28:03,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:03,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:03,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:03,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:28:03,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:09,518 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-20 09:28:09,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:09,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:09,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438166671] [2022-11-20 09:28:09,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438166671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:09,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:09,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:28:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350890189] [2022-11-20 09:28:09,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:09,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:28:09,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:09,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:28:09,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:28:09,521 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:18,550 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-11-20 09:28:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:28:18,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 09:28:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:18,560 INFO L225 Difference]: With dead ends: 67 [2022-11-20 09:28:18,560 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 09:28:18,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:18,562 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:18,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 41 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 18 Unchecked, 6.6s Time] [2022-11-20 09:28:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 09:28:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-11-20 09:28:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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-20 09:28:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-11-20 09:28:18,569 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 17 [2022-11-20 09:28:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:18,569 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-11-20 09:28:18,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-11-20 09:28:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 09:28:18,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:18,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:18,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:18,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:18,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:18,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:18,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1450538051, now seen corresponding path program 1 times [2022-11-20 09:28:18,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:18,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598287035] [2022-11-20 09:28:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:18,772 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-20 09:28:18,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:18,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:18,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:18,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 09:28:18,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:22,933 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-20 09:28:22,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:22,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:22,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598287035] [2022-11-20 09:28:22,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598287035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:22,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:22,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:28:22,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021199869] [2022-11-20 09:28:22,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:22,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:28:22,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:22,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:28:22,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:28:22,936 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:43,373 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-11-20 09:28:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:28:43,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 09:28:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:43,384 INFO L225 Difference]: With dead ends: 128 [2022-11-20 09:28:43,384 INFO L226 Difference]: Without dead ends: 108 [2022-11-20 09:28:43,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:28:43,385 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 81 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:43,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 54 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2022-11-20 09:28:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-20 09:28:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 49. [2022-11-20 09:28:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-20 09:28:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-11-20 09:28:43,404 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17 [2022-11-20 09:28:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:43,404 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-11-20 09:28:43,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-11-20 09:28:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 09:28:43,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:43,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:43,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:43,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:43,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1069229389, now seen corresponding path program 1 times [2022-11-20 09:28:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:43,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609914140] [2022-11-20 09:28:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:43,616 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-20 09:28:43,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:43,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:28:43,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 09:28:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 09:28:43,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:53,968 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-20 09:28:53,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:53,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:53,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609914140] [2022-11-20 09:28:53,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609914140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:53,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:53,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:28:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711226976] [2022-11-20 09:28:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:53,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:28:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:53,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:28:53,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:53,970 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:03,356 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-11-20 09:29:03,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:29:03,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 09:29:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:03,367 INFO L225 Difference]: With dead ends: 116 [2022-11-20 09:29:03,367 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 09:29:03,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:29:03,368 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 67 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:03,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 53 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 16 Unchecked, 7.0s Time] [2022-11-20 09:29:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 09:29:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 49. [2022-11-20 09:29:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-20 09:29:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-11-20 09:29:03,380 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17 [2022-11-20 09:29:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:03,380 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-11-20 09:29:03,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-11-20 09:29:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 09:29:03,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:03,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:03,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 09:29:03,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:29:03,587 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:29:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1175383176, now seen corresponding path program 1 times [2022-11-20 09:29:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:29:03,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372862153] [2022-11-20 09:29:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:03,588 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-20 09:29:03,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:29:03,589 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:29:03,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-20 09:29:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:29:03,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:29:03,674 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-20 09:29:03,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:29:03,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:29:03,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372862153] [2022-11-20 09:29:03,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372862153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:03,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:03,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:29:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651076032] [2022-11-20 09:29:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:03,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:29:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:03,677 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:03,766 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-11-20 09:29:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:03,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 09:29:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:03,768 INFO L225 Difference]: With dead ends: 75 [2022-11-20 09:29:03,768 INFO L226 Difference]: Without dead ends: 35 [2022-11-20 09:29:03,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:03,769 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:03,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-20 09:29:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-20 09:29:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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-20 09:29:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-20 09:29:03,776 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2022-11-20 09:29:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:03,777 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-20 09:29:03,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-20 09:29:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:29:03,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:03,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:03,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-20 09:29:03,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:29:03,991 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:29:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:03,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1724506925, now seen corresponding path program 1 times [2022-11-20 09:29:03,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:29:03,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117749422] [2022-11-20 09:29:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:03,992 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-20 09:29:03,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:29:03,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:29:04,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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 (9)] Waiting until timeout for monitored process [2022-11-20 09:29:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:04,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 09:29:04,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:29:13,660 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-20 09:29:13,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:29:13,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:29:13,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117749422] [2022-11-20 09:29:13,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117749422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:13,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:13,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:29:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917646113] [2022-11-20 09:29:13,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:13,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:29:13,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:29:13,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:29:13,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:29:13,663 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:23,450 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-11-20 09:29:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:29:23,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 09:29:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:23,461 INFO L225 Difference]: With dead ends: 64 [2022-11-20 09:29:23,461 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 09:29:23,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:29:23,462 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:23,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 21 Unchecked, 6.7s Time] [2022-11-20 09:29:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 09:29:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-11-20 09:29:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-20 09:29:23,469 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 18 [2022-11-20 09:29:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:23,469 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-20 09:29:23,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-20 09:29:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 09:29:23,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:23,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:23,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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 (9)] Ended with exit code 0 [2022-11-20 09:29:23,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:29:23,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:29:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash -66815887, now seen corresponding path program 1 times [2022-11-20 09:29:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:29:23,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89179387] [2022-11-20 09:29:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:23,682 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-20 09:29:23,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:29:23,683 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/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-20 09:29:23,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c200d46-2453-4bca-ba27-4745783dc376/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-20 09:29:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:23,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 09:29:23,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:49,933 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__R~0#1_8| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_12| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 16.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_12|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~main__D~0#1|))) (and (fp.leq .cse0 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_12|) |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq .cse2 .cse1) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_8| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_12|)) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)) (fp.geq .cse2 (_ +zero 11 53))))) is different from false [2022-11-20 09:30:51,949 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__R~0#1_8| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_12| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 16.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_12|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~main__D~0#1|))) (and (fp.leq .cse0 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_12|) |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq .cse2 .cse1) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_8| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_12|)) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)) (fp.geq .cse2 (_ +zero 11 53))))) is different from true [2022-11-20 09:32:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 09:32:17,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:23,406 WARN L233 SmtUtils]: Spent 12.40s on a formula simplification. DAG size of input: 20 DAG size of output: 15 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:34:43,713 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (or (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg .cse1))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1|) .cse1)))) is different from true [2022-11-20 09:34:58,396 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (let ((.cse1 (fp.neg .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1|))) (or (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|)) .cse1)))) (not (fp.geq .cse2 .cse1)) (not (fp.leq .cse2 .cse3))))) is different from true [2022-11-20 09:35:26,016 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__S~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (not (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse2) (not (fp.geq .cse3 (_ +zero 11 53)))))) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from true [2022-11-20 09:35:41,925 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (.cse1 (fp.neg .cse4))) (or (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse1) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (not (fp.geq .cse2 (_ +zero 11 53)))))) (not (fp.leq .cse3 .cse4)) (not (fp.geq .cse3 .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from false [2022-11-20 09:35:43,957 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (.cse1 (fp.neg .cse4))) (or (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse1) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (not (fp.geq .cse2 (_ +zero 11 53)))))) (not (fp.leq .cse3 .cse4)) (not (fp.geq .cse3 .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from true [2022-11-20 09:36:04,414 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (.cse1 (fp.neg .cse5))) (or (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse1) (not (fp.leq .cse2 .cse3)) (not (fp.geq .cse2 (_ +zero 11 53)))))) (not (fp.leq .cse4 .cse5)) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__D~0#1|) .cse3)) (not (fp.geq .cse4 .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from true [2022-11-20 09:36:26,350 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse3) (not (fp.leq .cse4 .cse5)) (not (fp.geq .cse4 (_ +zero 11 53)))))) (not (fp.geq .cse6 (_ +zero 11 53))) (not (fp.leq .cse6 .cse5)) (not (fp.geq .cse0 .cse3)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))))) is different from false [2022-11-20 09:36:28,384 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse3) (not (fp.leq .cse4 .cse5)) (not (fp.geq .cse4 (_ +zero 11 53)))))) (not (fp.geq .cse6 (_ +zero 11 53))) (not (fp.leq .cse6 .cse5)) (not (fp.geq .cse0 .cse3)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))))) is different from true [2022-11-20 09:38:18,951 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__D~0#1|) |v_ULTIMATE.start_main_~main__D~0#1_14|)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (not (fp.leq .cse1 .cse2)) (not (fp.leq .cse0 .cse2)) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))) is different from false [2022-11-20 09:38:20,976 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__D~0#1|) |v_ULTIMATE.start_main_~main__D~0#1_14|)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (not (fp.leq .cse1 .cse2)) (not (fp.leq .cse0 .cse2)) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))) is different from true [2022-11-20 09:38:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-20 09:38:20,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:38:20,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89179387] [2022-11-20 09:38:20,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89179387] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:38:20,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:38:20,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 24 [2022-11-20 09:38:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390188665] [2022-11-20 09:38:20,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:38:20,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 09:38:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:38:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 09:38:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=32, NotChecked=296, Total=600 [2022-11-20 09:38:20,980 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 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-20 09:38:24,099 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__D~0#1|) |v_ULTIMATE.start_main_~main__D~0#1_14|)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (not (fp.leq .cse1 .cse2)) (not (fp.leq .cse0 .cse2)) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 09:38:26,124 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__D~0#1|) |v_ULTIMATE.start_main_~main__D~0#1_14|)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (not (fp.leq .cse1 .cse2)) (not (fp.leq .cse0 .cse2)) (not (fp.geq .cse1 (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 09:38:28,148 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse3) (not (fp.leq .cse4 .cse5)) (not (fp.geq .cse4 (_ +zero 11 53)))))) (not (fp.geq .cse6 (_ +zero 11 53))) (not (fp.leq .cse6 .cse5)) (not (fp.geq .cse0 .cse3)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))))) (= |c_ULTIMATE.start_main_~main__Y~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 09:38:30,180 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse3) (not (fp.leq .cse4 .cse5)) (not (fp.geq .cse4 (_ +zero 11 53)))))) (not (fp.geq .cse6 (_ +zero 11 53))) (not (fp.leq .cse6 .cse5)) (not (fp.geq .cse0 .cse3)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))))) (= |c_ULTIMATE.start_main_~main__Y~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 09:38:33,182 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__D~0#1|))) (and (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (.cse1 (fp.neg .cse5))) (or (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse1) (not (fp.leq .cse2 .cse3)) (not (fp.geq .cse2 (_ +zero 11 53)))))) (not (fp.leq .cse4 .cse5)) (not (fp.leq .cse6 .cse3)) (not (fp.geq .cse4 .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) (= |c_ULTIMATE.start_main_~main__Y~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.geq .cse6 (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 09:38:36,595 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__D~0#1|))) (and (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (.cse1 (fp.neg .cse5))) (or (forall ((|v_ULTIMATE.start_main_~main__D~0#1_14| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_14|))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__D~0#1_14|)) .cse1) (not (fp.leq .cse2 .cse3)) (not (fp.geq .cse2 (_ +zero 11 53)))))) (not (fp.leq .cse4 .cse5)) (not (fp.geq .cse4 .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) (fp.leq .cse6 .cse3) (= |c_ULTIMATE.start_main_~main__Y~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.geq .cse6 (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 09:39:47,859 WARN L233 SmtUtils]: Spent 51.68s on a formula simplification. DAG size of input: 41 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:39:49,917 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (and (exists ((|v_ULTIMATE.start_main_~main__R~0#1_8| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_12| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_12|)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (and (fp.leq .cse0 .cse1) (fp.leq .cse2 .cse1) (fp.geq .cse2 (_ +zero 11 53)) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~main__D~0#1_12|) |ULTIMATE.start_main_~main__D~0#1|) |c_ULTIMATE.start_main_~main__Y~0#1|) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_8| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_12|)) (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|))))) (exists ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (and (fp.leq .cse4 .cse1) (fp.geq .cse4 (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)) (= |c_ULTIMATE.start_main_~main__Y~0#1| (fp.sub c_currentRoundingMode .cse3 |ULTIMATE.start_main_~main__D~0#1|))))) (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (let ((.cse6 (fp.neg .cse8)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1|))) (or (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (or (not (fp.geq .cse5 (_ +zero 11 53))) (not (fp.leq .cse5 .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|)) .cse6)))) (not (fp.geq .cse7 .cse6)) (not (fp.leq .cse7 .cse8))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-20 09:39:52,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:39:54,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:39:57,678 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (and (exists ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)) (= |c_ULTIMATE.start_main_~main__Y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__D~0#1|))))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (or (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (or (not (fp.geq .cse2 (_ +zero 11 53))) (not (fp.leq .cse2 .cse1)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg .cse3))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1|) .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 09:40:27,782 WARN L233 SmtUtils]: Spent 9.46s 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-20 09:41:01,934 WARN L233 SmtUtils]: Spent 17.94s 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-20 09:41:41,108 WARN L233 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:42:17,976 WARN L233 SmtUtils]: Spent 19.07s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)