./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa --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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:10:00,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:10:00,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:10:00,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:10:00,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:10:00,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:10:00,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:10:00,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:10:00,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:10:00,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:10:00,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:10:00,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:10:00,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:10:00,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:10:00,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:10:00,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:10:00,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:10:00,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:10:00,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:10:00,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:10:00,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:10:00,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:10:00,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:10:00,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:10:00,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:10:00,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:10:00,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:10:00,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:10:00,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:10:00,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:10:00,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:10:00,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:10:00,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:10:00,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:10:00,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:10:00,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:10:00,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:10:00,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:10:00,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:10:00,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:10:00,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:10:00,514 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 01:10:00,536 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:10:00,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:10:00,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:10:00,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:10:00,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:10:00,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:10:00,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:10:00,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:10:00,539 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:10:00,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:10:00,539 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:10:00,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:10:00,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:10:00,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:10:00,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:10:00,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:10:00,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:10:00,541 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:10:00,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:10:00,541 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:10:00,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:10:00,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:10:00,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:10:00,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:10:00,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:10:00,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:10:00,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:10:00,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:10:00,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:10:00,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:10:00,542 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:10:00,542 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:10:00,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:10:00,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:10:00,543 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_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/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_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2021-12-07 01:10:00,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:10:00,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:10:00,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:10:00,769 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:10:00,770 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:10:00,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2021-12-07 01:10:00,819 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/data/8b0887bea/fa6ddb0254274bbea35cc04a35a99a07/FLAGfb7d7c9bb [2021-12-07 01:10:01,206 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:10:01,206 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/sv-benchmarks/c/float-benchs/zonotope_2.c [2021-12-07 01:10:01,210 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/data/8b0887bea/fa6ddb0254274bbea35cc04a35a99a07/FLAGfb7d7c9bb [2021-12-07 01:10:01,220 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/data/8b0887bea/fa6ddb0254274bbea35cc04a35a99a07 [2021-12-07 01:10:01,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:10:01,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:10:01,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:10:01,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:10:01,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:10:01,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486aaf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01, skipping insertion in model container [2021-12-07 01:10:01,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:10:01,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:10:01,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-12-07 01:10:01,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:10:01,364 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:10:01,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-12-07 01:10:01,375 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:10:01,384 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:10:01,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01 WrapperNode [2021-12-07 01:10:01,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:10:01,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:10:01,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:10:01,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:10:01,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,407 INFO L137 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2021-12-07 01:10:01,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:10:01,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:10:01,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:10:01,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:10:01,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:10:01,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:10:01,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:10:01,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:10:01,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (1/1) ... [2021-12-07 01:10:01,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:10:01,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:10:01,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:10:01,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:10:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:10:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:10:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:10:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:10:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-07 01:10:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-07 01:10:01,528 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:10:01,529 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:10:01,591 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:10:01,595 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:10:01,596 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-07 01:10:01,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:10:01 BoogieIcfgContainer [2021-12-07 01:10:01,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:10:01,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:10:01,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:10:01,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:10:01,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:10:01" (1/3) ... [2021-12-07 01:10:01,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659ba362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:10:01, skipping insertion in model container [2021-12-07 01:10:01,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:01" (2/3) ... [2021-12-07 01:10:01,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659ba362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:10:01, skipping insertion in model container [2021-12-07 01:10:01,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:10:01" (3/3) ... [2021-12-07 01:10:01,604 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2021-12-07 01:10:01,608 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:10:01,608 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:10:01,644 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:10:01,650 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 01:10:01,650 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:10:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-07 01:10:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-07 01:10:01,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:10:01,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:10:01,668 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:10:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:10:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2021-12-07 01:10:01,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:10:01,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486264871] [2021-12-07 01:10:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:10:01,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:10:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:10:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:10:01,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:10:01,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486264871] [2021-12-07 01:10:01,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486264871] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:10:01,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:10:01,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:10:01,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666270645] [2021-12-07 01:10:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:10:01,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 01:10:01,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:10:01,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 01:10:01,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:10:01,807 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:10:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:10:01,820 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-12-07 01:10:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 01:10:01,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-07 01:10:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:10:01,828 INFO L225 Difference]: With dead ends: 32 [2021-12-07 01:10:01,828 INFO L226 Difference]: Without dead ends: 13 [2021-12-07 01:10:01,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:10:01,833 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:10:01,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:10:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-12-07 01:10:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-07 01:10:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:10:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-07 01:10:01,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2021-12-07 01:10:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:10:01,861 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-07 01:10:01,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:10:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-12-07 01:10:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-07 01:10:01,862 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:10:01,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:10:01,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:10:01,863 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:10:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:10:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2021-12-07 01:10:01,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:10:01,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348849948] [2021-12-07 01:10:01,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:10:01,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:10:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:10:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:10:01,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:10:01,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348849948] [2021-12-07 01:10:01,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348849948] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:10:01,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:10:01,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:10:01,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129993825] [2021-12-07 01:10:01,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:10:01,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:10:01,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:10:01,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:10:01,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:10:01,898 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:10:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:10:01,910 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-12-07 01:10:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:10:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-07 01:10:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:10:01,912 INFO L225 Difference]: With dead ends: 24 [2021-12-07 01:10:01,912 INFO L226 Difference]: Without dead ends: 17 [2021-12-07 01:10:01,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:10:01,915 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:10:01,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:10:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-07 01:10:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2021-12-07 01:10:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:10:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-07 01:10:01,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2021-12-07 01:10:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:10:01,923 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-07 01:10:01,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:10:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-12-07 01:10:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-07 01:10:01,924 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:10:01,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:10:01,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:10:01,925 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:10:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:10:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2021-12-07 01:10:01,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:10:01,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14099064] [2021-12-07 01:10:01,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:10:01,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:10:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:10:01,946 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 01:10:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:10:01,968 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 01:10:01,968 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 01:10:01,969 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 01:10:01,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:10:01,973 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-12-07 01:10:01,975 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 01:10:01,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:10:01 BoogieIcfgContainer [2021-12-07 01:10:01,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 01:10:01,991 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 01:10:01,991 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 01:10:01,991 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 01:10:01,991 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:10:01" (3/4) ... [2021-12-07 01:10:01,994 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-07 01:10:01,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 01:10:01,994 INFO L158 Benchmark]: Toolchain (without parser) took 771.85ms. Allocated memory is still 163.6MB. Free memory was 125.6MB in the beginning and 94.8MB in the end (delta: 30.8MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2021-12-07 01:10:01,995 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:10:01,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.69ms. Allocated memory is still 163.6MB. Free memory was 125.6MB in the beginning and 135.0MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-07 01:10:01,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.76ms. Allocated memory is still 163.6MB. Free memory was 134.6MB in the beginning and 133.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:10:01,996 INFO L158 Benchmark]: Boogie Preprocessor took 13.60ms. Allocated memory is still 163.6MB. Free memory was 133.3MB in the beginning and 132.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:10:01,997 INFO L158 Benchmark]: RCFGBuilder took 175.04ms. Allocated memory is still 163.6MB. Free memory was 132.1MB in the beginning and 123.3MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-07 01:10:01,997 INFO L158 Benchmark]: TraceAbstraction took 392.25ms. Allocated memory is still 163.6MB. Free memory was 122.9MB in the beginning and 95.2MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-07 01:10:01,997 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 163.6MB. Free memory was 95.2MB in the beginning and 94.8MB in the end (delta: 365.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:10:02,000 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.14ms. Allocated memory is still 88.1MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.69ms. Allocated memory is still 163.6MB. Free memory was 125.6MB in the beginning and 135.0MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.76ms. Allocated memory is still 163.6MB. Free memory was 134.6MB in the beginning and 133.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.60ms. Allocated memory is still 163.6MB. Free memory was 133.3MB in the beginning and 132.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 175.04ms. Allocated memory is still 163.6MB. Free memory was 132.1MB in the beginning and 123.3MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 392.25ms. Allocated memory is still 163.6MB. Free memory was 122.9MB in the beginning and 95.2MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 163.6MB. Free memory was 95.2MB in the beginning and 94.8MB in the end (delta: 365.7kB). 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: 10]: 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 25, overapproximation of someBinaryArithmeticFLOAToperation at line 22. Possible FailurePath: [L14] float x = 12.f; [L15] float x1 = 12.f; [L16] float y = 16.f; [L17] float y1 = 16.f; [L18] int i; [L19] i = 0 VAL [i=0, x=12, x1=12, y=16, y1=16] [L19] COND TRUE i < 100000 [L20] x = x1 [L21] y = y1 [L22] x1 = 3.f * x / 4.f + y / 4.f [L23] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0, x=12, y=16] [L25] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L10] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 14 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-07 01:10:02,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa --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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:10:03,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:10:03,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:10:03,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:10:03,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:10:03,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:10:03,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:10:03,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:10:03,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:10:03,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:10:03,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:10:03,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:10:03,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:10:03,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:10:03,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:10:03,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:10:03,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:10:03,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:10:03,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:10:03,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:10:03,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:10:03,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:10:03,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:10:03,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:10:03,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:10:03,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:10:03,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:10:03,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:10:03,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:10:03,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:10:03,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:10:03,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:10:03,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:10:03,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:10:03,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:10:03,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:10:03,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:10:03,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:10:03,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:10:03,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:10:03,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:10:03,797 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-07 01:10:03,821 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:10:03,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:10:03,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:10:03,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:10:03,822 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:10:03,822 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:10:03,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:10:03,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:10:03,823 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:10:03,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:10:03,824 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:10:03,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:10:03,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:10:03,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:10:03,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:10:03,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:10:03,825 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-07 01:10:03,825 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-07 01:10:03,825 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-07 01:10:03,825 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:10:03,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:10:03,825 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:10:03,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:10:03,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:10:03,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:10:03,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:10:03,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:10:03,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:10:03,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:10:03,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:10:03,826 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-07 01:10:03,827 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-07 01:10:03,827 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:10:03,827 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:10:03,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:10:03,827 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:10:03,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-07 01:10:03,827 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_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/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_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2021-12-07 01:10:04,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:10:04,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:10:04,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:10:04,097 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:10:04,097 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:10:04,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2021-12-07 01:10:04,142 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/data/3343e0ce2/6012d9088c0e4cffb250c3e202b9f2e0/FLAGd8faa0edd [2021-12-07 01:10:04,519 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:10:04,520 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/sv-benchmarks/c/float-benchs/zonotope_2.c [2021-12-07 01:10:04,526 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/data/3343e0ce2/6012d9088c0e4cffb250c3e202b9f2e0/FLAGd8faa0edd [2021-12-07 01:10:04,538 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/data/3343e0ce2/6012d9088c0e4cffb250c3e202b9f2e0 [2021-12-07 01:10:04,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:10:04,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:10:04,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:10:04,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:10:04,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:10:04,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ebcc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04, skipping insertion in model container [2021-12-07 01:10:04,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:10:04,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:10:04,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-12-07 01:10:04,679 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:10:04,688 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:10:04,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-12-07 01:10:04,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:10:04,726 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:10:04,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04 WrapperNode [2021-12-07 01:10:04,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:10:04,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:10:04,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:10:04,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:10:04,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,760 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2021-12-07 01:10:04,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:10:04,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:10:04,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:10:04,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:10:04,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:10:04,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:10:04,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:10:04,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:10:04,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (1/1) ... [2021-12-07 01:10:04,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:10:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:10:04,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:10:04,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:10:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:10:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:10:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:10:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-07 01:10:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-07 01:10:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-07 01:10:04,901 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:10:04,903 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:10:07,022 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:10:07,027 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:10:07,028 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-07 01:10:07,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:10:07 BoogieIcfgContainer [2021-12-07 01:10:07,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:10:07,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:10:07,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:10:07,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:10:07,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:10:04" (1/3) ... [2021-12-07 01:10:07,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7988bd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:10:07, skipping insertion in model container [2021-12-07 01:10:07,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:10:04" (2/3) ... [2021-12-07 01:10:07,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7988bd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:10:07, skipping insertion in model container [2021-12-07 01:10:07,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:10:07" (3/3) ... [2021-12-07 01:10:07,039 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2021-12-07 01:10:07,043 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:10:07,043 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:10:07,077 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:10:07,082 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 01:10:07,082 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:10:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-07 01:10:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-07 01:10:07,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:10:07,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:10:07,097 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:10:07,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:10:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2021-12-07 01:10:07,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:10:07,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547940724] [2021-12-07 01:10:07,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:10:07,111 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:10:07,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:10:07,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:10:07,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-07 01:10:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:10:07,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-07 01:10:07,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:10:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:10:07,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:10:07,229 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:10:07,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547940724] [2021-12-07 01:10:07,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547940724] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:10:07,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:10:07,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:10:07,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959460392] [2021-12-07 01:10:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:10:07,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 01:10:07,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:10:07,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 01:10:07,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:10:07,269 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:10:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:10:07,282 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-12-07 01:10:07,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 01:10:07,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-07 01:10:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:10:07,289 INFO L225 Difference]: With dead ends: 32 [2021-12-07 01:10:07,289 INFO L226 Difference]: Without dead ends: 13 [2021-12-07 01:10:07,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:10:07,294 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:10:07,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:10:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-12-07 01:10:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-07 01:10:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:10:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-07 01:10:07,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2021-12-07 01:10:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:10:07,319 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-07 01:10:07,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:10:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-12-07 01:10:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-07 01:10:07,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:10:07,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:10:07,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:10:07,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:10:07,521 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:10:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:10:07,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2021-12-07 01:10:07,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:10:07,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732648432] [2021-12-07 01:10:07,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:10:07,523 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:10:07,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:10:07,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:10:07,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-07 01:10:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:10:07,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 01:10:07,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:10:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:10:07,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:10:07,620 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:10:07,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732648432] [2021-12-07 01:10:07,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732648432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:10:07,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:10:07,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:10:07,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259849523] [2021-12-07 01:10:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:10:07,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:10:07,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:10:07,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:10:07,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:10:07,624 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:10:09,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:10:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:10:09,770 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2021-12-07 01:10:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:10:09,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-07 01:10:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:10:09,771 INFO L225 Difference]: With dead ends: 21 [2021-12-07 01:10:09,771 INFO L226 Difference]: Without dead ends: 14 [2021-12-07 01:10:09,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:10:09,773 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:10:09,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2021-12-07 01:10:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-07 01:10:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-07 01:10:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-07 01:10:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-07 01:10:09,777 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2021-12-07 01:10:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:10:09,778 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-07 01:10:09,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:10:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-12-07 01:10:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-07 01:10:09,778 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:10:09,778 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:10:09,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-07 01:10:09,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:10:09,980 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:10:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:10:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2021-12-07 01:10:09,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:10:09,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280346493] [2021-12-07 01:10:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:10:09,985 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:10:09,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:10:09,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:10:09,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-07 01:10:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:10:10,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-07 01:10:10,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:10:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:10:10,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:10:10,371 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:10:10,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280346493] [2021-12-07 01:10:10,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280346493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:10:10,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:10:10,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:10:10,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116834994] [2021-12-07 01:10:10,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:10:10,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:10:10,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:10:10,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:10:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:10:10,373 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:10:13,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:10:15,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:10:18,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:10:20,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:10:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:10:20,044 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2021-12-07 01:10:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:10:20,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-07 01:10:20,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:10:20,078 INFO L225 Difference]: With dead ends: 31 [2021-12-07 01:10:20,079 INFO L226 Difference]: Without dead ends: 29 [2021-12-07 01:10:20,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:10:20,080 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2021-12-07 01:10:20,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 50 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 3 Unknown, 0 Unchecked, 9.6s Time] [2021-12-07 01:10:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-07 01:10:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-07 01:10:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-07 01:10:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-07 01:10:20,088 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 7 [2021-12-07 01:10:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:10:20,089 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-07 01:10:20,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:10:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-07 01:10:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-07 01:10:20,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:10:20,090 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:10:20,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-07 01:10:20,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:10:20,292 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:10:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:10:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1269539930, now seen corresponding path program 1 times [2021-12-07 01:10:20,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:10:20,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070368857] [2021-12-07 01:10:20,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:10:20,297 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:10:20,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:10:20,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:10:20,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-07 01:10:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:10:20,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-07 01:10:20,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:10:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:10:20,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:10:30,583 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-07 01:10:32,602 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-07 01:10:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:10:32,614 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:10:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070368857] [2021-12-07 01:10:32,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070368857] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-07 01:10:32,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:10:32,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2021-12-07 01:10:32,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670490708] [2021-12-07 01:10:32,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:10:32,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:10:32,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:10:32,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:10:32,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=67, Unknown=2, NotChecked=16, Total=110 [2021-12-07 01:10:32,615 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 01:10:34,642 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0) (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)))) is different from false [2021-12-07 01:10:36,662 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0) (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)))) is different from true [2021-12-07 01:10:38,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:10:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:10:38,919 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2021-12-07 01:10:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:10:38,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-12-07 01:10:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:10:38,920 INFO L225 Difference]: With dead ends: 33 [2021-12-07 01:10:38,920 INFO L226 Difference]: Without dead ends: 29 [2021-12-07 01:10:38,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2021-12-07 01:10:38,921 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:10:38,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 48 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 23 Unchecked, 2.2s Time] [2021-12-07 01:10:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-07 01:10:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-07 01:10:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-07 01:10:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2021-12-07 01:10:38,926 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2021-12-07 01:10:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:10:38,927 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2021-12-07 01:10:38,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 01:10:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2021-12-07 01:10:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:10:38,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:10:38,927 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:10:38,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-07 01:10:39,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:10:39,130 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:10:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:10:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1102679400, now seen corresponding path program 1 times [2021-12-07 01:10:39,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:10:39,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988676169] [2021-12-07 01:10:39,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:10:39,133 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:10:39,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:10:39,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:10:39,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-07 01:10:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:10:39,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:10:39,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:10:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:10:39,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:10:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:10:39,458 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:10:39,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988676169] [2021-12-07 01:10:39,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988676169] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:10:39,458 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:10:39,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-07 01:10:39,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132375379] [2021-12-07 01:10:39,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:10:39,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:10:39,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:10:39,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:10:39,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:10:39,459 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:10:41,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:10:43,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:10:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:10:43,740 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2021-12-07 01:10:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:10:43,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2021-12-07 01:10:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:10:43,741 INFO L225 Difference]: With dead ends: 40 [2021-12-07 01:10:43,741 INFO L226 Difference]: Without dead ends: 30 [2021-12-07 01:10:43,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:10:43,743 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:10:43,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2021-12-07 01:10:43,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-07 01:10:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-07 01:10:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-07 01:10:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-07 01:10:43,748 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2021-12-07 01:10:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:10:43,748 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-07 01:10:43,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:10:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-07 01:10:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:10:43,749 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:10:43,749 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:10:43,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-07 01:10:43,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:10:43,950 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:10:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:10:43,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1100951522, now seen corresponding path program 1 times [2021-12-07 01:10:43,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:10:43,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335498296] [2021-12-07 01:10:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:10:43,954 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:10:43,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:10:43,956 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:10:43,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-07 01:10:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:10:44,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-07 01:10:44,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:10:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:10:45,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:10:55,483 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-07 01:11:29,165 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-07 01:11:31,221 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-07 01:11:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2021-12-07 01:11:31,244 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:11:31,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335498296] [2021-12-07 01:11:31,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335498296] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:11:31,244 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:11:31,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-12-07 01:11:31,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55792766] [2021-12-07 01:11:31,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:11:31,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-07 01:11:31,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:11:31,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-07 01:11:31,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=84, Unknown=3, NotChecked=38, Total=156 [2021-12-07 01:11:31,245 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:11:33,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:11:35,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:11:37,493 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from false [2021-12-07 01:11:39,556 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from true [2021-12-07 01:11:46,447 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-07 01:11:48,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:11:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:11:48,786 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2021-12-07 01:11:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:11:48,790 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2021-12-07 01:11:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:11:48,791 INFO L225 Difference]: With dead ends: 42 [2021-12-07 01:11:48,791 INFO L226 Difference]: Without dead ends: 40 [2021-12-07 01:11:48,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=53, Invalid=139, Unknown=6, NotChecked=108, Total=306 [2021-12-07 01:11:48,792 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:11:48,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 78 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 41 Invalid, 3 Unknown, 42 Unchecked, 6.5s Time] [2021-12-07 01:11:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-07 01:11:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2021-12-07 01:11:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-07 01:11:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-12-07 01:11:48,798 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2021-12-07 01:11:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:11:48,798 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-12-07 01:11:48,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:11:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2021-12-07 01:11:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-07 01:11:48,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:11:48,799 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-07 01:11:48,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-07 01:11:49,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:11:49,001 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:11:49,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:11:49,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1943528346, now seen corresponding path program 2 times [2021-12-07 01:11:49,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:11:49,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132959556] [2021-12-07 01:11:49,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:11:49,004 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:11:49,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:11:49,007 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:11:49,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-07 01:11:49,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:11:49,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:11:49,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-07 01:11:49,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:11:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-07 01:11:51,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:12:01,478 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-07 01:12:03,500 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-07 01:12:36,552 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-07 01:12:38,613 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-07 01:12:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2021-12-07 01:12:38,633 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:12:38,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132959556] [2021-12-07 01:12:38,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132959556] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:12:38,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:12:38,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-12-07 01:12:38,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239668096] [2021-12-07 01:12:38,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:12:38,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-07 01:12:38,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:12:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-07 01:12:38,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2021-12-07 01:12:38,635 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:12:40,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:12:42,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:12:44,893 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from false [2021-12-07 01:12:46,957 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from true [2021-12-07 01:12:49,508 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-07 01:12:51,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:12:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:12:51,951 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2021-12-07 01:12:51,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:12:51,955 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2021-12-07 01:12:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:12:51,956 INFO L225 Difference]: With dead ends: 40 [2021-12-07 01:12:51,956 INFO L226 Difference]: Without dead ends: 38 [2021-12-07 01:12:51,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=53, Invalid=138, Unknown=7, NotChecked=108, Total=306 [2021-12-07 01:12:51,957 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:12:51,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 93 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 3 Unknown, 59 Unchecked, 6.5s Time] [2021-12-07 01:12:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-07 01:12:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-07 01:12:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-07 01:12:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2021-12-07 01:12:51,963 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 24 [2021-12-07 01:12:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:12:51,963 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2021-12-07 01:12:51,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:12:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2021-12-07 01:12:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:12:51,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:12:51,964 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2021-12-07 01:12:51,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-07 01:12:52,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:12:52,166 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:12:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:12:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1358239522, now seen corresponding path program 3 times [2021-12-07 01:12:52,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:12:52,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676451767] [2021-12-07 01:12:52,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-07 01:12:52,169 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:12:52,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:12:52,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:12:52,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-07 01:12:52,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-07 01:12:52,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:12:52,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-07 01:12:52,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:12:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-07 01:12:58,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:13:07,968 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-07 01:13:09,993 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-07 01:13:42,971 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-07 01:13:45,038 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-07 01:14:21,131 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-07 01:14:23,239 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-07 01:14:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 8 not checked. [2021-12-07 01:14:23,268 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:14:23,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676451767] [2021-12-07 01:14:23,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676451767] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:14:23,268 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:14:23,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-12-07 01:14:23,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925374358] [2021-12-07 01:14:23,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:14:23,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-07 01:14:23,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:14:23,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-07 01:14:23,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=99, Unknown=8, NotChecked=66, Total=210 [2021-12-07 01:14:23,270 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-07 01:14:25,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:14:27,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:14:29,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:14:31,841 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from false [2021-12-07 01:14:33,954 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from true [2021-12-07 01:14:36,038 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-07 01:14:52,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:14:54,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:14:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:14:54,967 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2021-12-07 01:14:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:14:54,968 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2021-12-07 01:14:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:14:54,969 INFO L225 Difference]: With dead ends: 55 [2021-12-07 01:14:54,969 INFO L226 Difference]: Without dead ends: 53 [2021-12-07 01:14:54,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=59, Invalid=160, Unknown=11, NotChecked=150, Total=380 [2021-12-07 01:14:54,970 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:14:54,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 106 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 5 Unknown, 119 Unchecked, 11.3s Time] [2021-12-07 01:14:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-07 01:14:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-12-07 01:14:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-07 01:14:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-12-07 01:14:54,977 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 31 [2021-12-07 01:14:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:14:54,977 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-12-07 01:14:54,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-07 01:14:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-12-07 01:14:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 01:14:54,979 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:14:54,979 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-12-07 01:14:54,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-07 01:14:55,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:14:55,180 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:14:55,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:14:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1721810214, now seen corresponding path program 4 times [2021-12-07 01:14:55,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:14:55,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568445339] [2021-12-07 01:14:55,182 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-07 01:14:55,182 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:14:55,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:14:55,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:14:55,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-07 01:14:55,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-07 01:14:55,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:14:55,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-07 01:14:55,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:15:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-07 01:15:02,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:15:12,683 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-07 01:15:14,710 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-07 01:15:48,456 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-07 01:15:50,526 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-07 01:16:26,636 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-07 01:16:28,762 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-07 01:16:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2021-12-07 01:16:28,794 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:16:28,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568445339] [2021-12-07 01:16:28,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568445339] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:16:28,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:16:28,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-12-07 01:16:28,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710044251] [2021-12-07 01:16:28,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:28,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-07 01:16:28,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:16:28,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-07 01:16:28,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=99, Unknown=8, NotChecked=66, Total=210 [2021-12-07 01:16:28,797 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-07 01:16:30,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:16:33,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:16:35,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:16:37,406 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from true [2021-12-07 01:16:39,488 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-07 01:16:42,506 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse5) .cse3) (fp.div c_currentRoundingMode .cse6 .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse6) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)))))) is different from true [2021-12-07 01:16:44,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:16:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:45,098 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-12-07 01:16:45,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:16:45,099 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 36 [2021-12-07 01:16:45,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:45,100 INFO L225 Difference]: With dead ends: 59 [2021-12-07 01:16:45,100 INFO L226 Difference]: Without dead ends: 55 [2021-12-07 01:16:45,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=61, Invalid=162, Unknown=11, NotChecked=186, Total=420 [2021-12-07 01:16:45,101 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:45,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 4 Unknown, 102 Unchecked, 8.8s Time] [2021-12-07 01:16:45,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-07 01:16:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2021-12-07 01:16:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-07 01:16:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2021-12-07 01:16:45,108 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 36 [2021-12-07 01:16:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:45,108 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2021-12-07 01:16:45,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-07 01:16:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2021-12-07 01:16:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-07 01:16:45,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:45,109 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:45,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-07 01:16:45,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:16:45,311 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:45,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:45,313 INFO L85 PathProgramCache]: Analyzing trace with hash 461079576, now seen corresponding path program 2 times [2021-12-07 01:16:45,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:16:45,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462215010] [2021-12-07 01:16:45,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 01:16:45,314 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:16:45,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:16:45,316 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:16:45,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-07 01:16:45,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 01:16:45,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:16:45,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:16:45,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-07 01:16:46,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-07 01:16:46,473 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:16:46,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462215010] [2021-12-07 01:16:46,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462215010] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:16:46,474 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:16:46,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-07 01:16:46,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167581149] [2021-12-07 01:16:46,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:46,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:16:46,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:16:46,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:16:46,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:16:46,475 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-12-07 01:16:48,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:16:50,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:16:52,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:16:55,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:16:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:55,817 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2021-12-07 01:16:55,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 01:16:55,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 43 [2021-12-07 01:16:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:55,820 INFO L225 Difference]: With dead ends: 72 [2021-12-07 01:16:55,820 INFO L226 Difference]: Without dead ends: 62 [2021-12-07 01:16:55,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:16:55,821 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:55,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 4 Unknown, 0 Unchecked, 8.9s Time] [2021-12-07 01:16:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-07 01:16:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-07 01:16:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-07 01:16:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2021-12-07 01:16:55,831 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 43 [2021-12-07 01:16:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:55,832 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2021-12-07 01:16:55,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-12-07 01:16:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2021-12-07 01:16:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-07 01:16:55,833 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:55,833 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2021-12-07 01:16:55,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-07 01:16:56,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:16:56,035 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 462807454, now seen corresponding path program 5 times [2021-12-07 01:16:56,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:16:56,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973974550] [2021-12-07 01:16:56,038 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-07 01:16:56,038 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:16:56,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:16:56,040 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:16:56,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112a259f-e6a0-4458-9380-f2bfc4fc4625/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-07 01:16:56,761 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-07 01:16:56,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 01:16:56,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-07 01:16:56,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:17:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-07 01:17:09,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:17:20,485 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-07 01:17:55,788 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-12-07 01:17:57,873 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-12-07 01:18:34,125 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-07 01:18:36,248 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-07 01:19:04,713 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4))) (.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse4) (fp.div c_currentRoundingMode .cse5 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse4)) .cse4)))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) is different from false [2021-12-07 01:19:06,839 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4))) (.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse4) (fp.div c_currentRoundingMode .cse5 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse4)) .cse4)))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) is different from true [2021-12-07 01:21:55,128 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ FloatingPoint 8 24))) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.geq (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse2) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse2)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2)) .cse2)))) (_ +zero 8 24))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.leq (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse6) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse6))) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse6)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse6) (fp.div c_currentRoundingMode .cse7 .cse6))) .cse6) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse6)) .cse6)))) ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) (and (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ +zero 8 24)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) is different from true [2021-12-07 01:23:14,829 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ FloatingPoint 8 24))) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.geq (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse2) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse2)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2)) .cse2)))) (_ +zero 8 24))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.leq (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse6) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse6))) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse6)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse6) (fp.div c_currentRoundingMode .cse7 .cse6))) .cse6) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse6)) .cse6)))) ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) (and (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ +zero 8 24)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| ((_ to_fp 8 24) c_currentRoundingMode 100.0))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-12-07 01:24:34,612 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ FloatingPoint 8 24))) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.geq (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse2) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse2)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2)) .cse2)))) (_ +zero 8 24))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.leq (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse6) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse6))) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse6)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse6) (fp.div c_currentRoundingMode .cse7 .cse6))) .cse6) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse6)) .cse6)))) ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) (and (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ +zero 8 24)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| ((_ to_fp 8 24) c_currentRoundingMode 100.0))))) (= c___VERIFIER_assert_~cond (_ bv0 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-12-07 01:25:12,357 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse5) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse5))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.geq .cse0 (_ +zero 8 24))) (let ((.cse1 (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse5) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse5)))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse7) .cse5) (fp.div c_currentRoundingMode .cse0 .cse5))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse5) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) .cse5)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse5) (fp.div c_currentRoundingMode .cse6 .cse5))) .cse5) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse4 .cse5) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse6) .cse5)) .cse5)))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse2))) (not (fp.leq .cse0 .cse2))))) is different from false [2021-12-07 01:25:14,532 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse5) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse5))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.geq .cse0 (_ +zero 8 24))) (let ((.cse1 (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse5) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse5)))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse7) .cse5) (fp.div c_currentRoundingMode .cse0 .cse5))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse5) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) .cse5)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse5) (fp.div c_currentRoundingMode .cse6 .cse5))) .cse5) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse4 .cse5) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse6) .cse5)) .cse5)))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse2))) (not (fp.leq .cse0 .cse2))))) is different from true [2021-12-07 01:25:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 14 proven. 0 refuted. 12 times theorem prover too weak. 45 trivial. 19 not checked. [2021-12-07 01:25:14,556 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:25:14,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973974550] [2021-12-07 01:25:14,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973974550] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:25:14,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:25:14,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2021-12-07 01:25:14,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587662136] [2021-12-07 01:25:14,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:25:14,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-07 01:25:14,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:25:14,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-07 01:25:14,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=167, Unknown=17, NotChecked=264, Total=506 [2021-12-07 01:25:14,557 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 21 states have internal predecessors, (35), 8 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2021-12-07 01:25:16,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:25:18,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:25:20,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:25:22,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:25:24,959 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse5) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse5))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.geq .cse0 (_ +zero 8 24))) (let ((.cse1 (let ((.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse5) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse5)))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse7) .cse5) (fp.div c_currentRoundingMode .cse0 .cse5))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse7 .cse5) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse0) .cse5)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse5) (fp.div c_currentRoundingMode .cse6 .cse5))) .cse5) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse4 .cse5) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse6) .cse5)) .cse5)))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse2))) (not (fp.leq .cse0 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0))) is different from true [2021-12-07 01:25:27,097 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (let ((.cse4 (let ((.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse6) .cse2) (fp.div c_currentRoundingMode .cse7 .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse6 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse7) .cse2)) .cse2))))) (and (fp.leq .cse4 .cse5) (fp.geq .cse4 (_ +zero 8 24)))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse5)))) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-07 01:25:29,344 WARN L860 $PredicateComparison]: unable to prove that (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ FloatingPoint 8 24))) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.geq (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse2) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse2)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2)) .cse2)))) (_ +zero 8 24))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.leq (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse6) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse6))) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse6)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse6) (fp.div c_currentRoundingMode .cse7 .cse6))) .cse6) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse6)) .cse6)))) ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) (and (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ +zero 8 24)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| ((_ to_fp 8 24) c_currentRoundingMode 100.0))))) (= c___VERIFIER_assert_~cond (_ bv0 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-12-07 01:25:31,558 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ FloatingPoint 8 24))) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.geq (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse2) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse2)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2)) .cse2)))) (_ +zero 8 24))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.leq (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse6) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse6))) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse6)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse6) (fp.div c_currentRoundingMode .cse7 .cse6))) .cse6) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse6)) .cse6)))) ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) (and (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ +zero 8 24)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| ((_ to_fp 8 24) c_currentRoundingMode 100.0))))) .cse8) .cse8 (= c_currentRoundingMode roundNearestTiesToEven))) is different from true