./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:48:15,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:48:15,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:48:15,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:48:15,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:48:15,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:48:15,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:48:15,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:48:15,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:48:15,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:48:15,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:48:15,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:48:15,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:48:15,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:48:15,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:48:15,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:48:15,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:48:15,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:48:15,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:48:15,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:48:15,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:48:15,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:48:15,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:48:15,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:48:15,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:48:15,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:48:15,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:48:15,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:48:15,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:48:15,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:48:15,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:48:15,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:48:15,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:48:15,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:48:15,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:48:15,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:48:15,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:48:15,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:48:15,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:48:15,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:48:15,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:48:15,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 07:48:15,523 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:48:15,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:48:15,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:48:15,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:48:15,524 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:48:15,525 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:48:15,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:48:15,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:48:15,525 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:48:15,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:48:15,526 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:48:15,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 07:48:15,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:48:15,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:48:15,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:48:15,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:48:15,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:48:15,527 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:48:15,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:48:15,528 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:48:15,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:48:15,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:48:15,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:48:15,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:48:15,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:48:15,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:48:15,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:48:15,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:48:15,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 07:48:15,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 07:48:15,530 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:48:15,530 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:48:15,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:48:15,531 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:48:15,531 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 [2021-12-17 07:48:15,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:48:15,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:48:15,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:48:15,718 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:48:15,718 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:48:15,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2021-12-17 07:48:15,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0f99399/c263a9176ab34fb59c02564290946ef7/FLAGbf6c2db96 [2021-12-17 07:48:16,140 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:48:16,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2021-12-17 07:48:16,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0f99399/c263a9176ab34fb59c02564290946ef7/FLAGbf6c2db96 [2021-12-17 07:48:16,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0f99399/c263a9176ab34fb59c02564290946ef7 [2021-12-17 07:48:16,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:48:16,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:48:16,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:48:16,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:48:16,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:48:16,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b16b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16, skipping insertion in model container [2021-12-17 07:48:16,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:48:16,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:48:16,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c[5556,5569] [2021-12-17 07:48:16,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:48:16,395 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:48:16,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c[5556,5569] [2021-12-17 07:48:16,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:48:16,473 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:48:16,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16 WrapperNode [2021-12-17 07:48:16,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:48:16,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:48:16,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:48:16,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:48:16,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,516 INFO L137 Inliner]: procedures = 20, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 238 [2021-12-17 07:48:16,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:48:16,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:48:16,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:48:16,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:48:16,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:48:16,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:48:16,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:48:16,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:48:16,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (1/1) ... [2021-12-17 07:48:16,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:48:16,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:48:16,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 07:48:16,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 07:48:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:48:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 07:48:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 07:48:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-12-17 07:48:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 07:48:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-12-17 07:48:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2021-12-17 07:48:16,623 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2021-12-17 07:48:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:48:16,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:48:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 07:48:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-12-17 07:48:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2021-12-17 07:48:16,623 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2021-12-17 07:48:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 07:48:16,696 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:48:16,698 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:48:16,966 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:48:16,971 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:48:16,971 INFO L301 CfgBuilder]: Removed 16 assume(true) statements. [2021-12-17 07:48:16,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:48:16 BoogieIcfgContainer [2021-12-17 07:48:16,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:48:16,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:48:16,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:48:16,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:48:16,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:48:16" (1/3) ... [2021-12-17 07:48:16,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fac4bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:48:16, skipping insertion in model container [2021-12-17 07:48:16,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:16" (2/3) ... [2021-12-17 07:48:16,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fac4bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:48:16, skipping insertion in model container [2021-12-17 07:48:16,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:48:16" (3/3) ... [2021-12-17 07:48:16,980 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684b.c [2021-12-17 07:48:16,985 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:48:16,985 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:48:17,017 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:48:17,022 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-17 07:48:17,022 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:48:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:48:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 07:48:17,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:48:17,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:48:17,046 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:48:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:48:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash -540288573, now seen corresponding path program 1 times [2021-12-17 07:48:17,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:48:17,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782327302] [2021-12-17 07:48:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:48:17,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:48:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:48:17,191 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-17 07:48:17,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 07:48:17,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782327302] [2021-12-17 07:48:17,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782327302] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:48:17,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:48:17,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:48:17,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40133572] [2021-12-17 07:48:17,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:48:17,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:48:17,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 07:48:17,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:48:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:48:17,224 INFO L87 Difference]: Start difference. First operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:48:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:48:17,247 INFO L93 Difference]: Finished difference Result 190 states and 308 transitions. [2021-12-17 07:48:17,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:48:17,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-17 07:48:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:48:17,255 INFO L225 Difference]: With dead ends: 190 [2021-12-17 07:48:17,255 INFO L226 Difference]: Without dead ends: 92 [2021-12-17 07:48:17,257 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-17 07:48:17,260 INFO L933 BasicCegarLoop]: 136 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, 136 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-17 07:48:17,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:48:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-17 07:48:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-17 07:48:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:48:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2021-12-17 07:48:17,291 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 14 [2021-12-17 07:48:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:48:17,291 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2021-12-17 07:48:17,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:48:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2021-12-17 07:48:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 07:48:17,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:48:17,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:48:17,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 07:48:17,293 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:48:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:48:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1209401097, now seen corresponding path program 1 times [2021-12-17 07:48:17,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:48:17,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027367837] [2021-12-17 07:48:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:48:17,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:48:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:48:17,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 07:48:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:48:17,451 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 07:48:17,451 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 07:48:17,453 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:48:17,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 07:48:17,457 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-17 07:48:17,459 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:48:17,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:48:17 BoogieIcfgContainer [2021-12-17 07:48:17,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:48:17,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:48:17,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:48:17,511 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:48:17,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:48:16" (3/4) ... [2021-12-17 07:48:17,513 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 07:48:17,514 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:48:17,515 INFO L158 Benchmark]: Toolchain (without parser) took 1341.83ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 82.6MB in the beginning and 84.3MB in the end (delta: -1.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2021-12-17 07:48:17,515 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:48:17,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.65ms. Allocated memory is still 113.2MB. Free memory was 82.4MB in the beginning and 83.5MB in the end (delta: -1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 07:48:17,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.33ms. Allocated memory is still 113.2MB. Free memory was 83.5MB in the beginning and 81.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:48:17,519 INFO L158 Benchmark]: Boogie Preprocessor took 36.62ms. Allocated memory is still 113.2MB. Free memory was 81.0MB in the beginning and 78.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:48:17,520 INFO L158 Benchmark]: RCFGBuilder took 418.81ms. Allocated memory is still 113.2MB. Free memory was 78.6MB in the beginning and 58.4MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-17 07:48:17,520 INFO L158 Benchmark]: TraceAbstraction took 535.59ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 58.2MB in the beginning and 84.3MB in the end (delta: -26.1MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2021-12-17 07:48:17,521 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 140.5MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:48:17,526 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.65ms. Allocated memory is still 113.2MB. Free memory was 82.4MB in the beginning and 83.5MB in the end (delta: -1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.33ms. Allocated memory is still 113.2MB. Free memory was 83.5MB in the beginning and 81.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.62ms. Allocated memory is still 113.2MB. Free memory was 81.0MB in the beginning and 78.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.81ms. Allocated memory is still 113.2MB. Free memory was 78.6MB in the beginning and 58.4MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 535.59ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 58.2MB in the beginning and 84.3MB in the end (delta: -26.1MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 140.5MB. Free memory is still 84.3MB. 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: 245]: 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 244, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of bitwiseAnd at line 135, overapproximation of someBinaryArithmeticFLOAToperation at line 137. Possible FailurePath: [L29-L34] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L36-L41] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L43-L47] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L49-L51] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L117-L118] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L236] float x = __VERIFIER_nondet_float(); [L237] float y = -1.0f / 0.0f; [L239] CALL isfinite_float(x) [L219] __int32_t ix; VAL [\old(x)=1000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, zero_atan2=0] [L221] ieee_float_shape_type gf_u; [L222] gf_u.value = (x) [L223] EXPR gf_u.word [L223] (ix) = gf_u.word [L225] ix &= 0x7fffffff [L226] return (((ix) < 0x7f800000L)); VAL [\old(x)=1000000000000000000000000000002, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, zero_atan2=0] [L239] RET isfinite_float(x) [L239] COND TRUE isfinite_float(x) [L241] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L125] ieee_float_shape_type gf_u; [L126] gf_u.value = (x) [L127] EXPR gf_u.word [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L131] ieee_float_shape_type gf_u; [L132] gf_u.value = (y) [L133] EXPR gf_u.word [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=-1, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=-1, ix=2139095041, iy=2139095041, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L241] RET, EXPR __ieee754_atan2f(y, x) [L241] float res = __ieee754_atan2f(y, x); [L244] COND TRUE res != -pi_o_2 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000003, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L245] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000003, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, 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, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 136 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 13 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-17 07:48:17,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:48:19,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:48:19,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:48:19,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:48:19,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:48:19,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:48:19,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:48:19,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:48:19,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:48:19,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:48:19,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:48:19,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:48:19,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:48:19,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:48:19,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:48:19,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:48:19,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:48:19,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:48:19,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:48:19,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:48:19,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:48:19,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:48:19,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:48:19,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:48:19,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:48:19,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:48:19,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:48:19,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:48:19,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:48:19,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:48:19,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:48:19,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:48:19,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:48:19,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:48:19,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:48:19,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:48:19,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:48:19,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:48:19,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:48:19,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:48:19,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:48:19,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 07:48:19,352 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:48:19,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:48:19,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:48:19,353 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:48:19,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:48:19,354 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:48:19,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:48:19,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:48:19,356 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:48:19,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:48:19,356 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:48:19,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:48:19,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:48:19,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:48:19,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:48:19,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:48:19,357 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 07:48:19,357 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 07:48:19,357 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 07:48:19,358 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:48:19,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:48:19,358 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:48:19,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:48:19,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:48:19,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:48:19,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:48:19,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:48:19,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:48:19,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:48:19,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:48:19,359 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 07:48:19,359 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 07:48:19,360 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:48:19,360 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:48:19,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:48:19,360 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:48:19,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 07:48:19,360 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 [2021-12-17 07:48:19,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:48:19,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:48:19,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:48:19,629 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:48:19,630 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:48:19,631 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2021-12-17 07:48:19,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2728c5b1/704e9710bd9440da8af6dd207fd61a02/FLAGb5a078d15 [2021-12-17 07:48:20,078 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:48:20,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2021-12-17 07:48:20,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2728c5b1/704e9710bd9440da8af6dd207fd61a02/FLAGb5a078d15 [2021-12-17 07:48:20,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2728c5b1/704e9710bd9440da8af6dd207fd61a02 [2021-12-17 07:48:20,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:48:20,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:48:20,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:48:20,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:48:20,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:48:20,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24534f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20, skipping insertion in model container [2021-12-17 07:48:20,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:48:20,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:48:20,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c[5556,5569] [2021-12-17 07:48:20,320 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:48:20,342 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:48:20,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c[5556,5569] [2021-12-17 07:48:20,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:48:20,425 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:48:20,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20 WrapperNode [2021-12-17 07:48:20,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:48:20,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:48:20,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:48:20,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:48:20,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,485 INFO L137 Inliner]: procedures = 23, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 238 [2021-12-17 07:48:20,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:48:20,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:48:20,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:48:20,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:48:20,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:48:20,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:48:20,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:48:20,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:48:20,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (1/1) ... [2021-12-17 07:48:20,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:48:20,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:48:20,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 07:48:20,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 07:48:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:48:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-12-17 07:48:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 07:48:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 07:48:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-12-17 07:48:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2021-12-17 07:48:20,603 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2021-12-17 07:48:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-17 07:48:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:48:20,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:48:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2021-12-17 07:48:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2021-12-17 07:48:20,603 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2021-12-17 07:48:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-17 07:48:20,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 07:48:20,726 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:48:20,728 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:48:29,980 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:48:29,985 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:48:29,985 INFO L301 CfgBuilder]: Removed 16 assume(true) statements. [2021-12-17 07:48:29,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:48:29 BoogieIcfgContainer [2021-12-17 07:48:29,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:48:29,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:48:29,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:48:29,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:48:29,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:48:20" (1/3) ... [2021-12-17 07:48:29,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699ff5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:48:29, skipping insertion in model container [2021-12-17 07:48:29,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:48:20" (2/3) ... [2021-12-17 07:48:29,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699ff5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:48:29, skipping insertion in model container [2021-12-17 07:48:29,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:48:29" (3/3) ... [2021-12-17 07:48:29,994 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684b.c [2021-12-17 07:48:29,998 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:48:29,998 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:48:30,047 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:48:30,059 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-17 07:48:30,060 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:48:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:48:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 07:48:30,081 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:48:30,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:48:30,082 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:48:30,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:48:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash -540288573, now seen corresponding path program 1 times [2021-12-17 07:48:30,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:48:30,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82930194] [2021-12-17 07:48:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:48:30,100 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:48:30,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:48:30,102 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:48:30,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 07:48:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:48:30,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 07:48:31,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:48:31,120 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-17 07:48:31,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:48:31,121 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:48:31,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82930194] [2021-12-17 07:48:31,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82930194] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:48:31,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:48:31,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:48:31,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468992418] [2021-12-17 07:48:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:48:31,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:48:31,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:48:31,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:48:31,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:48:31,149 INFO L87 Difference]: Start difference. First operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:48:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:48:31,170 INFO L93 Difference]: Finished difference Result 190 states and 308 transitions. [2021-12-17 07:48:31,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:48:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-17 07:48:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:48:31,177 INFO L225 Difference]: With dead ends: 190 [2021-12-17 07:48:31,178 INFO L226 Difference]: Without dead ends: 92 [2021-12-17 07:48:31,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-17 07:48:31,183 INFO L933 BasicCegarLoop]: 136 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, 136 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-17 07:48:31,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:48:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-17 07:48:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-17 07:48:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:48:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2021-12-17 07:48:31,215 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 14 [2021-12-17 07:48:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:48:31,216 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2021-12-17 07:48:31,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:48:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2021-12-17 07:48:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 07:48:31,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:48:31,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:48:31,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-17 07:48:31,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:48:31,432 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:48:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:48:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1209401097, now seen corresponding path program 1 times [2021-12-17 07:48:31,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:48:31,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838466563] [2021-12-17 07:48:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:48:31,433 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:48:31,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:48:31,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:48:31,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 07:48:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:48:32,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-17 07:48:32,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:48:32,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 07:48:33,879 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 07:48:33,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2021-12-17 07:48:34,839 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 07:48:34,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 26 [2021-12-17 07:48:36,018 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-17 07:48:36,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:48:36,018 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:48:36,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838466563] [2021-12-17 07:48:36,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838466563] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:48:36,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:48:36,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 07:48:36,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135598946] [2021-12-17 07:48:36,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:48:36,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 07:48:36,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:48:36,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 07:48:36,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-17 07:48:36,021 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:48:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:48:36,047 INFO L93 Difference]: Finished difference Result 96 states and 134 transitions. [2021-12-17 07:48:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 07:48:36,048 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-17 07:48:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:48:36,049 INFO L225 Difference]: With dead ends: 96 [2021-12-17 07:48:36,049 INFO L226 Difference]: Without dead ends: 92 [2021-12-17 07:48:36,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-17 07:48:36,050 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:48:36,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1111 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 104 Unchecked, 0.0s Time] [2021-12-17 07:48:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-17 07:48:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-17 07:48:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:48:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2021-12-17 07:48:36,058 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 17 [2021-12-17 07:48:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:48:36,058 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2021-12-17 07:48:36,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:48:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2021-12-17 07:48:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 07:48:36,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:48:36,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:48:36,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 07:48:36,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:48:36,265 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:48:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:48:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1450439137, now seen corresponding path program 1 times [2021-12-17 07:48:36,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:48:36,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184648434] [2021-12-17 07:48:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:48:36,267 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:48:36,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:48:36,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:48:36,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 07:48:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:48:37,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 07:48:37,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:48:38,963 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-17 07:48:38,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:48:38,963 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:48:38,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184648434] [2021-12-17 07:48:38,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184648434] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:48:38,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:48:38,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 07:48:38,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524149150] [2021-12-17 07:48:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:48:38,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 07:48:38,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:48:38,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 07:48:38,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:48:38,965 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:48:43,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:48:47,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:48:49,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:48:51,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:48:52,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:48:54,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:48:56,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:48:58,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:00,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:49:01,100 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2021-12-17 07:49:01,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 07:49:01,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-17 07:49:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:49:01,105 INFO L225 Difference]: With dead ends: 100 [2021-12-17 07:49:01,105 INFO L226 Difference]: Without dead ends: 95 [2021-12-17 07:49:01,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-17 07:49:01,106 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:49:01,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 368 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 21.0s Time] [2021-12-17 07:49:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-17 07:49:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2021-12-17 07:49:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.423529411764706) internal successors, (121), 85 states have internal predecessors, (121), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:49:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2021-12-17 07:49:01,113 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 22 [2021-12-17 07:49:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:49:01,114 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2021-12-17 07:49:01,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2021-12-17 07:49:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 07:49:01,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:49:01,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:49:01,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-17 07:49:01,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:49:01,323 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:49:01,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:49:01,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1452286179, now seen corresponding path program 1 times [2021-12-17 07:49:01,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:49:01,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625447424] [2021-12-17 07:49:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:49:01,324 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:49:01,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:49:01,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:49:01,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 07:49:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:49:02,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 07:49:02,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:49:02,665 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-17 07:49:02,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:49:02,666 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:49:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625447424] [2021-12-17 07:49:02,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625447424] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:49:02,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:49:02,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 07:49:02,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348424169] [2021-12-17 07:49:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:49:02,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 07:49:02,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:49:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 07:49:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:49:02,667 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:49:02,671 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2021-12-17 07:49:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 07:49:02,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-17 07:49:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:49:02,673 INFO L225 Difference]: With dead ends: 100 [2021-12-17 07:49:02,673 INFO L226 Difference]: Without dead ends: 94 [2021-12-17 07:49:02,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:49:02,674 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 61 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:49:02,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 410 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2021-12-17 07:49:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-17 07:49:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2021-12-17 07:49:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:49:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2021-12-17 07:49:02,680 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 22 [2021-12-17 07:49:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:49:02,680 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2021-12-17 07:49:02,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2021-12-17 07:49:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 07:49:02,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:49:02,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:49:02,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 07:49:02,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:49:02,883 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:49:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:49:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash -947623069, now seen corresponding path program 1 times [2021-12-17 07:49:02,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:49:02,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323620626] [2021-12-17 07:49:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:49:02,884 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:49:02,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:49:02,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:49:02,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 07:49:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:49:03,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 07:49:03,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:49:04,348 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-17 07:49:04,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:49:04,348 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:49:04,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323620626] [2021-12-17 07:49:04,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323620626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:49:04,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:49:04,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 07:49:04,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794148988] [2021-12-17 07:49:04,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:49:04,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 07:49:04,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:49:04,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 07:49:04,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:49:04,350 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:49:04,354 INFO L93 Difference]: Finished difference Result 160 states and 224 transitions. [2021-12-17 07:49:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 07:49:04,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-17 07:49:04,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:49:04,355 INFO L225 Difference]: With dead ends: 160 [2021-12-17 07:49:04,355 INFO L226 Difference]: Without dead ends: 88 [2021-12-17 07:49:04,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:49:04,358 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 5 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:49:04,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 542 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2021-12-17 07:49:04,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-17 07:49:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2021-12-17 07:49:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:49:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 115 transitions. [2021-12-17 07:49:04,364 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 115 transitions. Word has length 22 [2021-12-17 07:49:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:49:04,364 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 115 transitions. [2021-12-17 07:49:04,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2021-12-17 07:49:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 07:49:04,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:49:04,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:49:04,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 07:49:04,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:49:04,576 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:49:04,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:49:04,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1672952196, now seen corresponding path program 1 times [2021-12-17 07:49:04,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:49:04,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166601058] [2021-12-17 07:49:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:49:04,577 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:49:04,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:49:04,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:49:04,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 07:49:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:49:05,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-17 07:49:05,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:49:05,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 07:49:06,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2021-12-17 07:49:08,185 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-17 07:49:08,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:49:08,185 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:49:08,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166601058] [2021-12-17 07:49:08,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166601058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:49:08,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:49:08,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 07:49:08,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461043573] [2021-12-17 07:49:08,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:49:08,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 07:49:08,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:49:08,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 07:49:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-17 07:49:08,187 INFO L87 Difference]: Start difference. First operand 84 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:49:08,424 INFO L93 Difference]: Finished difference Result 141 states and 190 transitions. [2021-12-17 07:49:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 07:49:08,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-17 07:49:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:49:08,425 INFO L225 Difference]: With dead ends: 141 [2021-12-17 07:49:08,425 INFO L226 Difference]: Without dead ends: 77 [2021-12-17 07:49:08,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:49:08,427 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:49:08,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 637 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 65 Unchecked, 0.0s Time] [2021-12-17 07:49:08,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-17 07:49:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2021-12-17 07:49:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:49:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2021-12-17 07:49:08,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 23 [2021-12-17 07:49:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:49:08,442 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2021-12-17 07:49:08,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2021-12-17 07:49:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 07:49:08,445 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:49:08,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:49:08,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-17 07:49:08,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:49:08,658 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:49:08,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:49:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash 791814228, now seen corresponding path program 1 times [2021-12-17 07:49:08,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:49:08,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263244880] [2021-12-17 07:49:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:49:08,658 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:49:08,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:49:08,663 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:49:08,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 07:49:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:49:09,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 07:49:09,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:49:11,369 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-17 07:49:11,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:49:11,370 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:49:11,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263244880] [2021-12-17 07:49:11,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263244880] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:49:11,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:49:11,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 07:49:11,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491826436] [2021-12-17 07:49:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:49:11,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 07:49:11,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:49:11,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 07:49:11,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:49:11,374 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:17,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:20,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:21,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:25,663 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-17 07:49:28,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:30,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:49:30,386 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2021-12-17 07:49:30,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 07:49:30,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-17 07:49:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:49:30,388 INFO L225 Difference]: With dead ends: 81 [2021-12-17 07:49:30,388 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 07:49:30,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-17 07:49:30,389 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 68 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2021-12-17 07:49:30,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 268 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 17.7s Time] [2021-12-17 07:49:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 07:49:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-12-17 07:49:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:49:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2021-12-17 07:49:30,395 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 24 [2021-12-17 07:49:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:49:30,396 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2021-12-17 07:49:30,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2021-12-17 07:49:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 07:49:30,396 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:49:30,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:49:30,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-17 07:49:30,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:49:30,604 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:49:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:49:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash 793661270, now seen corresponding path program 1 times [2021-12-17 07:49:30,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:49:30,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567070353] [2021-12-17 07:49:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:49:30,605 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:49:30,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:49:30,606 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:49:30,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-17 07:49:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:49:31,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 07:49:31,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:49:31,959 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-17 07:49:31,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:49:31,959 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:49:31,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567070353] [2021-12-17 07:49:31,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567070353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:49:31,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:49:31,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 07:49:31,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904198226] [2021-12-17 07:49:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:49:31,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 07:49:31,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:49:31,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 07:49:31,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:49:31,960 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:49:31,963 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2021-12-17 07:49:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 07:49:31,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-17 07:49:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:49:31,964 INFO L225 Difference]: With dead ends: 77 [2021-12-17 07:49:31,964 INFO L226 Difference]: Without dead ends: 71 [2021-12-17 07:49:31,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:49:31,965 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 26 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:49:31,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 305 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2021-12-17 07:49:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-17 07:49:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-17 07:49:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 07:49:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2021-12-17 07:49:31,969 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 24 [2021-12-17 07:49:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:49:31,970 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2021-12-17 07:49:31,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2021-12-17 07:49:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 07:49:31,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:49:31,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:49:32,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-17 07:49:32,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:49:32,183 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:49:32,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:49:32,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1553945203, now seen corresponding path program 1 times [2021-12-17 07:49:32,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:49:32,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022948022] [2021-12-17 07:49:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:49:32,184 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:49:32,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:49:32,185 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:49:32,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-17 07:49:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:49:32,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 07:49:32,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:49:33,905 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-17 07:49:33,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:49:33,906 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:49:33,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022948022] [2021-12-17 07:49:33,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022948022] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:49:33,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:49:33,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 07:49:33,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186634180] [2021-12-17 07:49:33,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:49:33,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 07:49:33,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:49:33,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 07:49:33,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:49:33,907 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:49:33,910 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2021-12-17 07:49:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 07:49:33,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-17 07:49:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:49:33,910 INFO L225 Difference]: With dead ends: 105 [2021-12-17 07:49:33,910 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 07:49:33,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:49:33,911 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:49:33,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 281 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2021-12-17 07:49:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 07:49:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-17 07:49:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:49:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2021-12-17 07:49:33,914 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 25 [2021-12-17 07:49:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:49:33,914 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2021-12-17 07:49:33,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:49:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2021-12-17 07:49:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 07:49:33,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:49:33,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:49:33,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-17 07:49:34,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:49:34,127 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:49:34,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:49:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1512113405, now seen corresponding path program 1 times [2021-12-17 07:49:34,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:49:34,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399500386] [2021-12-17 07:49:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:49:34,128 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:49:34,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:49:34,129 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:49:34,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-17 07:49:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:49:34,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 07:49:34,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:49:35,955 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-17 07:49:35,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:49:35,955 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:49:35,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399500386] [2021-12-17 07:49:35,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399500386] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:49:35,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:49:35,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 07:49:35,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986603023] [2021-12-17 07:49:35,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:49:35,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 07:49:35,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:49:35,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 07:49:35,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 07:49:35,957 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 07:49:39,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:41,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:43,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:45,651 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-17 07:49:48,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:50,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:49:50,289 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2021-12-17 07:49:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 07:49:50,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-12-17 07:49:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:49:50,338 INFO L225 Difference]: With dead ends: 58 [2021-12-17 07:49:50,338 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 07:49:50,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:49:50,339 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 8 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2021-12-17 07:49:50,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 320 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 6 Unknown, 29 Unchecked, 13.8s Time] [2021-12-17 07:49:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 07:49:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-17 07:49:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:49:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2021-12-17 07:49:50,342 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 28 [2021-12-17 07:49:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:49:50,342 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2021-12-17 07:49:50,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 07:49:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2021-12-17 07:49:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 07:49:50,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:49:50,342 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:49:50,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-17 07:49:50,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:49:50,543 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:49:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:49:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash 868682631, now seen corresponding path program 1 times [2021-12-17 07:49:50,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:49:50,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797046878] [2021-12-17 07:49:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:49:50,544 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:49:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:49:50,545 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:49:50,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-17 07:49:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:49:51,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 07:49:51,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:49:52,215 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-17 07:49:52,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:49:52,215 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:49:52,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797046878] [2021-12-17 07:49:52,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797046878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:49:52,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:49:52,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 07:49:52,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74494267] [2021-12-17 07:49:52,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:49:52,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 07:49:52,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:49:52,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 07:49:52,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 07:49:52,216 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 07:49:56,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:57,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:49:59,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:02,063 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-17 07:50:03,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:05,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:07,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:50:07,792 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-12-17 07:50:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 07:50:07,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-12-17 07:50:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:50:07,846 INFO L225 Difference]: With dead ends: 61 [2021-12-17 07:50:07,846 INFO L226 Difference]: Without dead ends: 54 [2021-12-17 07:50:07,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 07:50:07,847 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 36 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:50:07,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 245 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 4 Unknown, 25 Unchecked, 15.0s Time] [2021-12-17 07:50:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-17 07:50:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2021-12-17 07:50:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:50:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2021-12-17 07:50:07,851 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 29 [2021-12-17 07:50:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:50:07,852 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2021-12-17 07:50:07,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 07:50:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2021-12-17 07:50:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 07:50:07,854 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:50:07,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:50:07,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-17 07:50:08,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:50:08,059 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:50:08,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:50:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1756186312, now seen corresponding path program 1 times [2021-12-17 07:50:08,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:50:08,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840083431] [2021-12-17 07:50:08,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:50:08,060 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:50:08,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:50:08,061 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:50:08,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-17 07:50:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:50:09,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-17 07:50:09,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:50:10,494 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 07:50:10,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2021-12-17 07:50:10,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2021-12-17 07:50:11,778 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 07:50:11,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2021-12-17 07:50:11,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2021-12-17 07:50:12,687 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 07:50:12,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2021-12-17 07:50:12,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2021-12-17 07:50:13,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 27 [2021-12-17 07:50:17,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 07:50:17,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 07:50:17,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 46 [2021-12-17 07:50:20,070 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-17 07:50:20,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:50:20,070 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:50:20,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840083431] [2021-12-17 07:50:20,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840083431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:50:20,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:50:20,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 07:50:20,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233065317] [2021-12-17 07:50:20,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:50:20,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 07:50:20,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:50:20,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 07:50:20,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 07:50:20,072 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 07:50:22,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:24,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:27,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:29,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:32,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:34,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:35,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:50:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:50:35,644 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2021-12-17 07:50:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 07:50:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-12-17 07:50:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:50:35,697 INFO L225 Difference]: With dead ends: 60 [2021-12-17 07:50:35,697 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 07:50:35,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-17 07:50:35,698 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:50:35,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 276 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 4 Unknown, 79 Unchecked, 15.0s Time] [2021-12-17 07:50:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 07:50:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2021-12-17 07:50:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:50:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2021-12-17 07:50:35,702 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 29 [2021-12-17 07:50:35,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:50:35,702 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2021-12-17 07:50:35,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 07:50:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2021-12-17 07:50:35,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-17 07:50:35,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:50:35,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:50:35,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-17 07:50:35,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:50:35,909 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:50:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:50:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1197063290, now seen corresponding path program 1 times [2021-12-17 07:50:35,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:50:35,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789653310] [2021-12-17 07:50:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:50:35,910 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:50:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:50:35,911 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:50:35,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-17 07:50:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:50:36,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 07:50:36,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:50:38,019 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-17 07:50:38,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:50:38,019 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:50:38,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789653310] [2021-12-17 07:50:38,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789653310] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:50:38,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:50:38,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 07:50:38,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409883010] [2021-12-17 07:50:38,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:50:38,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 07:50:38,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:50:38,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 07:50:38,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 07:50:38,021 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 07:50:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:50:38,650 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2021-12-17 07:50:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 07:50:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-12-17 07:50:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:50:38,651 INFO L225 Difference]: With dead ends: 49 [2021-12-17 07:50:38,651 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 07:50:38,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:50:38,652 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 21 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 07:50:38,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 253 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 41 Unchecked, 0.3s Time] [2021-12-17 07:50:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 07:50:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 07:50:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:50:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 07:50:38,653 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-12-17 07:50:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:50:38,653 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 07:50:38,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 07:50:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 07:50:38,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 07:50:38,655 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:50:38,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-17 07:50:38,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:50:38,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 07:50:44,327 INFO L858 garLoopResultBuilder]: For program point fabs_floatFINAL(lines 14 27) no Hoare annotation was computed. [2021-12-17 07:50:44,327 INFO L858 garLoopResultBuilder]: For program point fabs_floatEXIT(lines 14 27) no Hoare annotation was computed. [2021-12-17 07:50:44,327 INFO L861 garLoopResultBuilder]: At program point fabs_floatENTRY(lines 14 27) the Hoare annotation is: true [2021-12-17 07:50:44,327 INFO L858 garLoopResultBuilder]: For program point L21(lines 21 25) no Hoare annotation was computed. [2021-12-17 07:50:44,327 INFO L858 garLoopResultBuilder]: For program point L21-1(lines 14 27) no Hoare annotation was computed. [2021-12-17 07:50:44,327 INFO L858 garLoopResultBuilder]: For program point L21-2(lines 21 25) no Hoare annotation was computed. [2021-12-17 07:50:44,327 INFO L858 garLoopResultBuilder]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2021-12-17 07:50:44,327 INFO L861 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: true [2021-12-17 07:50:44,327 INFO L861 garLoopResultBuilder]: At program point L250(lines 229 251) the Hoare annotation is: true [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L184-2(line 184) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 137) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L854 garLoopResultBuilder]: At program point L120(lines 120 215) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= |ULTIMATE.start___ieee754_atan2f_#res#1| (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_2~0) ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000.0))))) (= currentRoundingMode roundNearestTiesToEven) (= ~pi_o_2~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3141592741.0 2000000000.0))))) [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 207) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 179) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L203-1(lines 196 208) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L203-2(lines 203 207) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L220-1(lines 220 224) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 192) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L854 garLoopResultBuilder]: At program point L220-2(lines 220 224) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_main_~y~0#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (= |~#atanhi_atan~0.base| (_ bv4 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv4 32)) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv5 32)) (_ bv1 1))) (= (let ((.cse0 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0)))) (= (let ((.cse1 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))))) [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L220-3(lines 220 224) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L171(line 171) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 139) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2021-12-17 07:50:44,328 INFO L858 garLoopResultBuilder]: For program point L155-2(line 155) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L854 garLoopResultBuilder]: At program point L139(line 139) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv4 32)) (_ bv1 1))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_atan2f_~y#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hx~1#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|)) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_4) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))))))) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= |~#atanhi_atan~0.base| (_ bv4 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv5 32)) (_ bv1 1))) (= (let ((.cse0 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0)))) (= (let ((.cse1 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))))) [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L139-1(line 139) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L189(lines 189 192) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L189-2(lines 187 192) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 248) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L239-2(lines 239 248) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 181) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L157-1(lines 120 215) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L124-1(lines 124 128) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L854 garLoopResultBuilder]: At program point L124-2(lines 124 128) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= currentRoundingMode roundNearestTiesToEven) (= |~#atanhi_atan~0.base| (_ bv4 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv4 32)) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv5 32)) (_ bv1 1))) (= (let ((.cse0 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0)))) (= (let ((.cse1 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0)))) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11| (_ BitVec 32))) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11|) (_ bv0 32)))) (and (bvslt (bvand (_ bv2147483647 32) .cse2) (_ bv2139095040 32)) (= |ULTIMATE.start___ieee754_atan2f_~x#1| (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_atan2f_~y#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L124-3(lines 124 128) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 180) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 152) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L142-2(lines 120 215) no Hoare annotation was computed. [2021-12-17 07:50:44,329 INFO L854 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2021-12-17 07:50:44,329 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 168) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L854 garLoopResultBuilder]: At program point L192-1(line 192) the Hoare annotation is: false [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L192-2(line 192) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 151) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L854 garLoopResultBuilder]: At program point L226(lines 218 227) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_main_~y~0#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= currentRoundingMode roundNearestTiesToEven) (= |~#atanhi_atan~0.base| (_ bv4 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv4 32)) (_ bv1 1))) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11|) (_ bv0 32)))) (and (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) |ULTIMATE.start_main_~x~0#1|) (let ((.cse1 (bvslt (bvand (_ bv2147483647 32) .cse0) (_ bv2139095040 32)))) (or (and .cse1 (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32))) (and (not .cse1) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32)))))))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv5 32)) (_ bv1 1))) (= (let ((.cse2 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0)))) (= (let ((.cse3 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))))) [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 214) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L210(line 210) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L144-2(line 144) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L244(lines 244 247) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L162(line 162) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L245(line 245) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2021-12-17 07:50:44,330 INFO L858 garLoopResultBuilder]: For program point L130-1(lines 130 134) no Hoare annotation was computed. [2021-12-17 07:50:44,331 INFO L854 garLoopResultBuilder]: At program point L130-2(lines 130 134) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (and (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (bvslt (bvand (_ bv2147483647 32) .cse1) (_ bv2139095040 32)) (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) .cse0))))) (= |~#atanhi_atan~0.base| (_ bv4 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv4 32)) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv5 32)) (_ bv1 1))) (= (let ((.cse2 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0)))) (= (let ((.cse3 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_atan2f_~y#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) [2021-12-17 07:50:44,331 INFO L858 garLoopResultBuilder]: For program point L130-3(lines 130 134) no Hoare annotation was computed. [2021-12-17 07:50:44,331 INFO L858 garLoopResultBuilder]: For program point L147(line 147) no Hoare annotation was computed. [2021-12-17 07:50:44,331 INFO L858 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2021-12-17 07:50:44,331 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 07:50:44,331 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2021-12-17 07:50:44,333 INFO L858 garLoopResultBuilder]: For program point L198-1(lines 198 202) no Hoare annotation was computed. [2021-12-17 07:50:44,333 INFO L854 garLoopResultBuilder]: At program point L198-2(lines 198 202) the Hoare annotation is: false [2021-12-17 07:50:44,333 INFO L858 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2021-12-17 07:50:44,333 INFO L858 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2021-12-17 07:50:44,333 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2021-12-17 07:50:44,334 INFO L854 garLoopResultBuilder]: At program point atan_floatENTRY(lines 53 115) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|)) (not (= currentRoundingMode roundNearestTiesToEven)) (not (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0))))) (not (= |~#atanhi_atan~0.base| (_ bv4 32))) (not (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0))))) (not (= (_ bv0 1) (bvadd (select |old(#valid)| (_ bv5 32)) (_ bv1 1)))) (not (= |~#atanlo_atan~0.base| (_ bv5 32))) (not (= (let ((.cse0 (select (select |old(#memory_int)| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))))) (not (= (_ bv0 1) (bvadd (select |old(#valid)| (_ bv4 32)) (_ bv1 1)))) (not (= (let ((.cse1 (select (select |old(#memory_int)| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0)))))) [2021-12-17 07:50:44,334 INFO L858 garLoopResultBuilder]: For program point atan_floatFINAL(lines 53 115) no Hoare annotation was computed. [2021-12-17 07:50:44,334 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 74) no Hoare annotation was computed. [2021-12-17 07:50:44,334 INFO L858 garLoopResultBuilder]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2021-12-17 07:50:44,334 INFO L854 garLoopResultBuilder]: At program point L57-2(lines 57 61) the Hoare annotation is: (or (not (= currentRoundingMode roundNearestTiesToEven)) (not (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0))))) (not (= |~#atanhi_atan~0.base| (_ bv4 32))) (not (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0))))) (not (= (_ bv0 1) (bvadd (select |old(#valid)| (_ bv5 32)) (_ bv1 1)))) (not (= |~#atanlo_atan~0.base| (_ bv5 32))) (and (= atan_float_~x |atan_float_#in~x|) (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|)) (not (= (let ((.cse0 (select (select |old(#memory_int)| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))))) (not (= (_ bv0 1) (bvadd (select |old(#valid)| (_ bv4 32)) (_ bv1 1)))) (not (= (let ((.cse1 (select (select |old(#memory_int)| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0)))))) [2021-12-17 07:50:44,334 INFO L858 garLoopResultBuilder]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2021-12-17 07:50:44,334 INFO L854 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (or (and (= (fp ((_ extract 31 31) atan_float_~hx~0) ((_ extract 30 23) atan_float_~hx~0) ((_ extract 22 0) atan_float_~hx~0)) |atan_float_#in~x|) (exists ((v_ArrVal_173 (Array (_ BitVec 32) (_ BitVec 32))) (|v_atan_float_~#gf_u~1.base_9| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |v_atan_float_~#gf_u~1.base_9|)) (= |#memory_int| (store |old(#memory_int)| |v_atan_float_~#gf_u~1.base_9| v_ArrVal_173)))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv4 32)) (_ bv1 1))) (= atan_float_~x |atan_float_#in~x|) (= (_ bv0 1) (bvadd (select |#valid| (_ bv5 32)) (_ bv1 1))) (exists ((atan_float_~hx~0 (_ BitVec 32))) (and (not (bvsge (bvand (_ bv2147483647 32) atan_float_~hx~0) (_ bv1350565888 32))) (= (fp ((_ extract 31 31) atan_float_~hx~0) ((_ extract 30 23) atan_float_~hx~0) ((_ extract 22 0) atan_float_~hx~0)) |atan_float_#in~x|)))) (not (= currentRoundingMode roundNearestTiesToEven)) (not (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0))))) (not (= |~#atanhi_atan~0.base| (_ bv4 32))) (not (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0))))) (not (= (_ bv0 1) (bvadd (select |old(#valid)| (_ bv5 32)) (_ bv1 1)))) (not (= |~#atanlo_atan~0.base| (_ bv5 32))) (not (= (let ((.cse0 (select (select |old(#memory_int)| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))))) (not (= (_ bv0 1) (bvadd (select |old(#valid)| (_ bv4 32)) (_ bv1 1)))) (not (= (let ((.cse1 (select (select |old(#memory_int)| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0)))))) [2021-12-17 07:50:44,334 INFO L858 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2021-12-17 07:50:44,334 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L79(lines 79 95) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L71(lines 71 96) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point atan_floatEXIT(lines 53 115) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 70) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 94) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L88-2(lines 71 96) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 86) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L113-2(line 113) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 114) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 75) no Hoare annotation was computed. [2021-12-17 07:50:44,335 INFO L858 garLoopResultBuilder]: For program point L72-2(lines 72 75) no Hoare annotation was computed. [2021-12-17 07:50:44,338 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:50:44,339 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:50:44,345 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,347 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,351 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,351 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,354 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,354 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,354 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,357 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,363 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,363 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,363 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,363 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,363 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,363 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,364 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,364 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,365 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,365 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,365 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,365 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,365 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,365 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,366 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,366 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,366 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,367 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,368 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,368 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:50:44 BoogieIcfgContainer [2021-12-17 07:50:44,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:50:44,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:50:44,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:50:44,369 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:50:44,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:48:29" (3/4) ... [2021-12-17 07:50:44,372 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 07:50:44,376 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_float [2021-12-17 07:50:44,376 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_float [2021-12-17 07:50:44,382 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2021-12-17 07:50:44,382 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-12-17 07:50:44,382 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-17 07:50:44,383 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 07:50:44,398 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && x == x) && atanhi_atan == 4bv32) && 0bv1 == ~bvadd64(\valid[4bv32], 1bv1)) && 0bv1 == ~bvadd64(\valid[5bv32], 1bv1)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000))) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) [2021-12-17 07:50:44,398 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && atanhi_atan == 4bv32) && 0bv1 == ~bvadd64(\valid[4bv32], 1bv1)) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11 : bv32 :: ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][22:0]) == x && ((~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32]), 2139095040bv32) && \result == 1bv32) || (!~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32]), 2139095040bv32) && \result == 0bv32)))) && 0bv1 == ~bvadd64(\valid[5bv32], 1bv1)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000))) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) [2021-12-17 07:50:44,398 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && atanhi_atan == 4bv32) && 0bv1 == ~bvadd64(\valid[4bv32], 1bv1)) && 0bv1 == ~bvadd64(\valid[5bv32], 1bv1)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000))) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000))) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11 : bv32 :: ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32]), 2139095040bv32) && x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][22:0]))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) [2021-12-17 07:50:44,398 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6 : bv32, v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][22:0]) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][22:0]) && ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32]), 2139095040bv32)) && ix == ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32]))) && atanhi_atan == 4bv32) && 0bv1 == ~bvadd64(\valid[4bv32], 1bv1)) && 0bv1 == ~bvadd64(\valid[5bv32], 1bv1)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000))) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) [2021-12-17 07:50:44,399 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && \result == ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000)))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3141592741/2000000000)) [2021-12-17 07:50:44,399 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) || !(pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000)))) || !(atanhi_atan == 4bv32)) || !(tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)))) || !(0bv1 == ~bvadd64(\old(\valid)[5bv32], 1bv1))) || !(atanlo_atan == 5bv32)) || ((x == \old(x) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \valid == \old(\valid))) || !(~fp~LONGDOUBLE(\old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], \old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], \old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)))) || !(0bv1 == ~bvadd64(\old(\valid)[4bv32], 1bv1))) || !(~fp~LONGDOUBLE(\old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], \old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], \old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000))) [2021-12-17 07:50:44,427 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 07:50:44,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:50:44,428 INFO L158 Benchmark]: Toolchain (without parser) took 144327.80ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 43.8MB in the beginning and 24.3MB in the end (delta: 19.4MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2021-12-17 07:50:44,428 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 45.4MB in the beginning and 45.4MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:50:44,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.74ms. Allocated memory is still 62.9MB. Free memory was 43.6MB in the beginning and 41.3MB in the end (delta: 2.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 07:50:44,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.93ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 38.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 07:50:44,431 INFO L158 Benchmark]: Boogie Preprocessor took 60.84ms. Allocated memory is still 62.9MB. Free memory was 38.7MB in the beginning and 36.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:50:44,431 INFO L158 Benchmark]: RCFGBuilder took 9439.73ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 36.0MB in the beginning and 46.5MB in the end (delta: -10.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2021-12-17 07:50:44,431 INFO L158 Benchmark]: TraceAbstraction took 134380.12ms. Allocated memory is still 81.8MB. Free memory was 46.2MB in the beginning and 32.0MB in the end (delta: 14.2MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2021-12-17 07:50:44,431 INFO L158 Benchmark]: Witness Printer took 58.44ms. Allocated memory is still 81.8MB. Free memory was 32.0MB in the beginning and 24.3MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-17 07:50:44,435 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 45.4MB in the beginning and 45.4MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.74ms. Allocated memory is still 62.9MB. Free memory was 43.6MB in the beginning and 41.3MB in the end (delta: 2.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.93ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 38.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.84ms. Allocated memory is still 62.9MB. Free memory was 38.7MB in the beginning and 36.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 9439.73ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 36.0MB in the beginning and 46.5MB in the end (delta: -10.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 134380.12ms. Allocated memory is still 81.8MB. Free memory was 46.2MB in the beginning and 32.0MB in the end (delta: 14.2MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Witness Printer took 58.44ms. Allocated memory is still 81.8MB. Free memory was 32.0MB in the beginning and 24.3MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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 - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 134.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 87.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 23 mSolverCounterUnknown, 378 SdHoareTripleChecker+Valid, 82.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 5152 SdHoareTripleChecker+Invalid, 80.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 372 IncrementalHoareTripleChecker+Unchecked, 4056 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 293 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1096 mSDtfsCounter, 293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 231 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 23 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 46 PreInvPairs, 58 NumberOfFragments, 1199 HoareAnnotationTreeSize, 46 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1202 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 9.6s SatisfiabilityAnalysisTime, 27.8s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 296 ConstructedInterpolants, 156 QuantifiedInterpolants, 5426 SizeOfPredicates, 94 NumberOfNonLiveVariables, 1835 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 218]: Loop Invariant [2021-12-17 07:50:44,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,456 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] Derived loop invariant: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && atanhi_atan == 4bv32) && 0bv1 == ~bvadd64(\valid[4bv32], 1bv1)) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11 : bv32 :: ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][22:0]) == x && ((~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32]), 2139095040bv32) && \result == 1bv32) || (!~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32]), 2139095040bv32) && \result == 0bv32)))) && 0bv1 == ~bvadd64(\valid[5bv32], 1bv1)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000))) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) - InvariantResult [Line: 124]: Loop Invariant [2021-12-17 07:50:44,459 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,459 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,459 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,459 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,466 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,466 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,466 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,467 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11,QUANTIFIED] [2021-12-17 07:50:44,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && atanhi_atan == 4bv32) && 0bv1 == ~bvadd64(\valid[4bv32], 1bv1)) && 0bv1 == ~bvadd64(\valid[5bv32], 1bv1)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000))) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000))) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11 : bv32 :: ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32]), 2139095040bv32) && x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_11][0bv32][22:0]))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 120]: Loop Invariant [2021-12-17 07:50:44,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && \result == ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000)))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3141592741/2000000000)) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant [2021-12-17 07:50:44,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((!(unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) || !(pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000)))) || !(atanhi_atan == 4bv32)) || !(tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)))) || !(0bv1 == ~bvadd64(\old(\valid)[5bv32], 1bv1))) || !(atanlo_atan == 5bv32)) || ((x == \old(x) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \valid == \old(\valid))) || !(~fp~LONGDOUBLE(\old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], \old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], \old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)))) || !(0bv1 == ~bvadd64(\old(\valid)[4bv32], 1bv1))) || !(~fp~LONGDOUBLE(\old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], \old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], \old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000))) - InvariantResult [Line: 130]: Loop Invariant [2021-12-17 07:50:44,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,481 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,481 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6 : bv32, v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][22:0]) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][22:0]) && ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32]), 2139095040bv32)) && ix == ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32]))) && atanhi_atan == 4bv32) && 0bv1 == ~bvadd64(\valid[4bv32], 1bv1)) && 0bv1 == ~bvadd64(\valid[5bv32], 1bv1)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000))) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 220]: Loop Invariant [2021-12-17 07:50:44,484 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,484 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:50:44,484 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,484 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-17 07:50:44,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && x == x) && atanhi_atan == 4bv32) && 0bv1 == ~bvadd64(\valid[4bv32], 1bv1)) && 0bv1 == ~bvadd64(\valid[5bv32], 1bv1)) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000))) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) RESULT: Ultimate proved your program to be correct! [2021-12-17 07:50:44,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Writing output log to file Ultimate.log Result: TRUE