./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0683a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/double_req_bl_0683a.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 ded13d718947e0cef3a9581cc7bfa480a12833eb2a7beb86b46438a532a4bf69 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:54:56,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:54:56,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:54:56,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:54:56,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:54:56,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:54:56,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:54:56,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:54:56,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:54:56,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:54:56,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:54:56,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:54:56,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:54:56,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:54:56,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:54:56,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:54:56,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:54:56,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:54:56,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:54:56,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:54:56,422 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:54:56,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:54:56,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:54:56,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:54:56,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:54:56,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:54:56,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:54:56,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:54:56,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:54:56,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:54:56,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:54:56,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:54:56,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:54:56,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:54:56,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:54:56,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:54:56,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:54:56,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:54:56,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:54:56,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:54:56,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:54:56,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:54:56,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 02:54:56,467 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:54:56,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:54:56,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:54:56,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:54:56,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:54:56,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:54:56,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:54:56,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:54:56,470 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:54:56,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:54:56,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:54:56,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 02:54:56,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:54:56,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:54:56,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:54:56,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:54:56,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:54:56,473 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:54:56,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:54:56,473 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:54:56,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:54:56,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:54:56,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:54:56,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:54:56,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:54:56,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:54:56,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:54:56,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:54:56,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 02:54:56,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 02:54:56,476 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:54:56,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:54:56,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:54:56,476 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 -> ded13d718947e0cef3a9581cc7bfa480a12833eb2a7beb86b46438a532a4bf69 [2022-07-12 02:54:56,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:54:56,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:54:56,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:54:56,726 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:54:56,726 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:54:56,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0683a.c [2022-07-12 02:54:56,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563afe609/e63055eaecb74531982ff4a20a7700b9/FLAG8d927ab11 [2022-07-12 02:54:57,217 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:54:57,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0683a.c [2022-07-12 02:54:57,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563afe609/e63055eaecb74531982ff4a20a7700b9/FLAG8d927ab11 [2022-07-12 02:54:57,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563afe609/e63055eaecb74531982ff4a20a7700b9 [2022-07-12 02:54:57,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:54:57,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:54:57,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:54:57,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:54:57,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:54:57,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57, skipping insertion in model container [2022-07-12 02:54:57,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:54:57,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:54:57,455 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/double_req_bl_0683a.c[7147,7160] [2022-07-12 02:54:57,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:54:57,482 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:54:57,534 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/double_req_bl_0683a.c[7147,7160] [2022-07-12 02:54:57,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:54:57,554 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:54:57,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57 WrapperNode [2022-07-12 02:54:57,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:54:57,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:54:57,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:54:57,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:54:57,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,616 INFO L137 Inliner]: procedures = 22, calls = 103, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 337 [2022-07-12 02:54:57,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:54:57,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:54:57,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:54:57,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:54:57,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:54:57,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:54:57,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:54:57,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:54:57,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (1/1) ... [2022-07-12 02:54:57,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:54:57,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:54:57,710 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) [2022-07-12 02:54:57,729 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 [2022-07-12 02:54:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:54:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 02:54:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:54:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 02:54:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 02:54:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-12 02:54:57,750 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-12 02:54:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 02:54:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-12 02:54:57,751 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-12 02:54:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:54:57,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:54:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 02:54:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-12 02:54:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:54:57,821 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:54:57,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:54:58,337 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:54:58,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:54:58,346 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2022-07-12 02:54:58,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:54:58 BoogieIcfgContainer [2022-07-12 02:54:58,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:54:58,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:54:58,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:54:58,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:54:58,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:54:57" (1/3) ... [2022-07-12 02:54:58,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a22e1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:54:58, skipping insertion in model container [2022-07-12 02:54:58,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:57" (2/3) ... [2022-07-12 02:54:58,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a22e1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:54:58, skipping insertion in model container [2022-07-12 02:54:58,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:54:58" (3/3) ... [2022-07-12 02:54:58,355 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0683a.c [2022-07-12 02:54:58,365 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:54:58,366 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:54:58,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:54:58,415 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6538382f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4cd75a3f [2022-07-12 02:54:58,419 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:54:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 113 states have (on average 1.7168141592920354) internal successors, (194), 114 states have internal predecessors, (194), 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) [2022-07-12 02:54:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 02:54:58,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:54:58,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:54:58,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:54:58,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:54:58,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1776576330, now seen corresponding path program 1 times [2022-07-12 02:54:58,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:54:58,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479381124] [2022-07-12 02:54:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:54:58,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:54:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:54:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:54:58,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:54:58,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479381124] [2022-07-12 02:54:58,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479381124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:54:58,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:54:58,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:54:58,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608988188] [2022-07-12 02:54:58,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:54:58,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:54:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:54:58,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:54:58,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:54:58,644 INFO L87 Difference]: Start difference. First operand has 121 states, 113 states have (on average 1.7168141592920354) internal successors, (194), 114 states have internal predecessors, (194), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:54:58,695 INFO L93 Difference]: Finished difference Result 240 states and 406 transitions. [2022-07-12 02:54:58,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:54:58,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 02:54:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:54:58,705 INFO L225 Difference]: With dead ends: 240 [2022-07-12 02:54:58,706 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 02:54:58,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:54:58,713 INFO L413 NwaCegarLoop]: 173 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, 173 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:54:58,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:54:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 02:54:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-12 02:54:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 110 states have internal predecessors, (160), 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) [2022-07-12 02:54:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 168 transitions. [2022-07-12 02:54:58,769 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 168 transitions. Word has length 16 [2022-07-12 02:54:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:54:58,769 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 168 transitions. [2022-07-12 02:54:58,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 168 transitions. [2022-07-12 02:54:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 02:54:58,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:54:58,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:54:58,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 02:54:58,777 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:54:58,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:54:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash 220589561, now seen corresponding path program 1 times [2022-07-12 02:54:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:54:58,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831869939] [2022-07-12 02:54:58,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:54:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:54:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:54:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:54:58,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:54:58,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831869939] [2022-07-12 02:54:58,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831869939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:54:58,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:54:58,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:54:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532767845] [2022-07-12 02:54:58,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:54:58,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:54:58,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:54:58,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:54:58,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:54:58,977 INFO L87 Difference]: Start difference. First operand 117 states and 168 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:54:59,022 INFO L93 Difference]: Finished difference Result 223 states and 324 transitions. [2022-07-12 02:54:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:54:59,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 02:54:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:54:59,024 INFO L225 Difference]: With dead ends: 223 [2022-07-12 02:54:59,024 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 02:54:59,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:54:59,026 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:54:59,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:54:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 02:54:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-12 02:54:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 110 states have (on average 1.4454545454545455) internal successors, (159), 110 states have internal predecessors, (159), 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) [2022-07-12 02:54:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2022-07-12 02:54:59,041 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 19 [2022-07-12 02:54:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:54:59,042 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2022-07-12 02:54:59,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2022-07-12 02:54:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 02:54:59,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:54:59,044 INFO L195 NwaCegarLoop]: 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] [2022-07-12 02:54:59,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 02:54:59,044 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:54:59,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:54:59,045 INFO L85 PathProgramCache]: Analyzing trace with hash 890818062, now seen corresponding path program 1 times [2022-07-12 02:54:59,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:54:59,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763548289] [2022-07-12 02:54:59,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:54:59,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:54:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:54:59,528 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 02:54:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:54:59,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 02:54:59,876 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 02:54:59,877 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:54:59,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 02:54:59,881 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-12 02:54:59,883 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:54:59,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:54:59 BoogieIcfgContainer [2022-07-12 02:54:59,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:54:59,939 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:54:59,939 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:54:59,940 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:54:59,940 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:54:58" (3/4) ... [2022-07-12 02:54:59,942 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 02:54:59,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:54:59,944 INFO L158 Benchmark]: Toolchain (without parser) took 2700.19ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 89.3MB in the beginning and 106.8MB in the end (delta: -17.5MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-07-12 02:54:59,944 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:54:59,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.19ms. Allocated memory is still 117.4MB. Free memory was 89.2MB in the beginning and 86.0MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 02:54:59,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.80ms. Allocated memory is still 117.4MB. Free memory was 86.0MB in the beginning and 80.9MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:54:59,949 INFO L158 Benchmark]: Boogie Preprocessor took 53.88ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 76.5MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:54:59,951 INFO L158 Benchmark]: RCFGBuilder took 676.35ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 76.5MB in the beginning and 130.5MB in the end (delta: -54.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2022-07-12 02:54:59,951 INFO L158 Benchmark]: TraceAbstraction took 1588.23ms. Allocated memory is still 176.2MB. Free memory was 130.5MB in the beginning and 106.8MB in the end (delta: 23.7MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2022-07-12 02:54:59,952 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 176.2MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:54:59,953 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.18ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.19ms. Allocated memory is still 117.4MB. Free memory was 89.2MB in the beginning and 86.0MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.80ms. Allocated memory is still 117.4MB. Free memory was 86.0MB in the beginning and 80.9MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.88ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 76.5MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 676.35ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 76.5MB in the beginning and 130.5MB in the end (delta: -54.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1588.23ms. Allocated memory is still 176.2MB. Free memory was 130.5MB in the beginning and 106.8MB in the end (delta: 23.7MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 176.2MB. Free memory is still 106.8MB. 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: 300]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 164, overapproximation of someUnaryDOUBLEoperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 165, overapproximation of bitwiseAnd at line 268, overapproximation of someBinaryDOUBLEComparisonOperation at line 299. Possible FailurePath: [L39-L44] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L46-L51] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L53-L60] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L62-L64] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L141-L142] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L291] double x = 1.0 / 0.0; [L292] double y = __VERIFIER_nondet_double(); [L294] CALL, EXPR isinf_double(x) [L248] __int32_t hx, lx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L250] ieee_double_shape_type ew_u; [L251] ew_u.value = (x) [L252] EXPR ew_u.parts.msw [L252] (hx) = ew_u.parts.msw [L253] EXPR ew_u.parts.lsw [L253] (lx) = ew_u.parts.lsw [L255] hx &= 0x7fffffff [L256] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L257] hx = 0x7ff00000 - hx [L258] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=4293918720, lx=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L294] RET, EXPR isinf_double(x) [L294] EXPR isinf_double(x) && isfinite_double(y) [L294] CALL, EXPR isfinite_double(y) [L262] __int32_t hx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L264] ieee_double_shape_type gh_u; [L265] gh_u.value = (x) [L266] EXPR gh_u.parts.msw [L266] (hx) = gh_u.parts.msw [L268] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-3, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L294] RET, EXPR isfinite_double(y) [L294] EXPR isinf_double(x) && isfinite_double(y) VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isfinite_double(y)=1, isinf_double(x)=1, isinf_double(x) && isfinite_double(y)=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L294] COND TRUE isinf_double(x) && isfinite_double(y) && y < 0.0 [L296] CALL, EXPR __ieee754_atan2(y, x) [L145] double z; [L146] __int32_t k, m, hx, hy, ix, iy; [L147] __uint32_t lx, ly; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L150] ieee_double_shape_type ew_u; [L151] ew_u.value = (x) [L152] EXPR ew_u.parts.msw [L152] (hx) = ew_u.parts.msw [L153] EXPR ew_u.parts.lsw [L153] (lx) = ew_u.parts.lsw [L155] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=-1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L157] ieee_double_shape_type ew_u; [L158] ew_u.value = (y) [L159] EXPR ew_u.parts.msw [L159] (hy) = ew_u.parts.msw [L160] EXPR ew_u.parts.lsw [L160] (ly) = ew_u.parts.lsw [L162] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=-1, ly=13, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L163-L164] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L165] return x + y; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=-1, ly=13, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L296] RET, EXPR __ieee754_atan2(y, x) [L296] double res = __ieee754_atan2(y, x); [L299] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004, res == -0.0 && __signbit_double(res) == 1=0, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L299] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L300] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 503 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 341 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 02:54:59,993 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/double_req_bl_0683a.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 ded13d718947e0cef3a9581cc7bfa480a12833eb2a7beb86b46438a532a4bf69 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:55:01,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:55:01,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:55:01,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:55:01,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:55:01,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:55:02,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:55:02,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:55:02,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:55:02,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:55:02,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:55:02,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:55:02,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:55:02,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:55:02,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:55:02,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:55:02,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:55:02,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:55:02,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:55:02,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:55:02,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:55:02,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:55:02,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:55:02,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:55:02,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:55:02,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:55:02,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:55:02,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:55:02,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:55:02,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:55:02,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:55:02,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:55:02,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:55:02,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:55:02,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:55:02,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:55:02,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:55:02,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:55:02,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:55:02,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:55:02,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:55:02,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:55:02,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 02:55:02,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:55:02,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:55:02,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:55:02,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:55:02,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:55:02,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:55:02,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:55:02,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:55:02,096 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:55:02,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:55:02,097 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:55:02,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:55:02,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:55:02,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:55:02,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:55:02,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:55:02,098 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 02:55:02,098 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 02:55:02,098 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 02:55:02,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:55:02,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:55:02,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:55:02,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:55:02,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:55:02,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:55:02,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:55:02,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:55:02,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:55:02,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:55:02,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:55:02,100 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 02:55:02,100 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 02:55:02,100 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:55:02,101 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:55:02,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:55:02,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 02:55:02,101 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 -> ded13d718947e0cef3a9581cc7bfa480a12833eb2a7beb86b46438a532a4bf69 [2022-07-12 02:55:02,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:55:02,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:55:02,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:55:02,439 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:55:02,440 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:55:02,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0683a.c [2022-07-12 02:55:02,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f331841b/d092452cb65a4f63abe4b6054ed9801e/FLAG93616844f [2022-07-12 02:55:02,891 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:55:02,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0683a.c [2022-07-12 02:55:02,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f331841b/d092452cb65a4f63abe4b6054ed9801e/FLAG93616844f [2022-07-12 02:55:03,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f331841b/d092452cb65a4f63abe4b6054ed9801e [2022-07-12 02:55:03,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:55:03,296 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:55:03,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:55:03,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:55:03,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:55:03,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376f9095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03, skipping insertion in model container [2022-07-12 02:55:03,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:55:03,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:55:03,527 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/double_req_bl_0683a.c[7147,7160] [2022-07-12 02:55:03,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:55:03,542 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:55:03,601 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/double_req_bl_0683a.c[7147,7160] [2022-07-12 02:55:03,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:55:03,621 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:55:03,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03 WrapperNode [2022-07-12 02:55:03,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:55:03,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:55:03,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:55:03,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:55:03,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,663 INFO L137 Inliner]: procedures = 25, calls = 103, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 299 [2022-07-12 02:55:03,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:55:03,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:55:03,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:55:03,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:55:03,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:55:03,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:55:03,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:55:03,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:55:03,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (1/1) ... [2022-07-12 02:55:03,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:55:03,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:55:03,762 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) [2022-07-12 02:55:03,781 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 [2022-07-12 02:55:03,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:55:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-12 02:55:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 02:55:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 02:55:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:55:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-12 02:55:03,804 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-12 02:55:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-07-12 02:55:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-12 02:55:03,804 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-12 02:55:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 02:55:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:55:03,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:55:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 02:55:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:55:03,934 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:55:03,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:55:26,460 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:55:26,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:55:26,466 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2022-07-12 02:55:26,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:55:26 BoogieIcfgContainer [2022-07-12 02:55:26,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:55:26,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:55:26,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:55:26,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:55:26,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:55:03" (1/3) ... [2022-07-12 02:55:26,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11218cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:55:26, skipping insertion in model container [2022-07-12 02:55:26,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:55:03" (2/3) ... [2022-07-12 02:55:26,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11218cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:55:26, skipping insertion in model container [2022-07-12 02:55:26,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:55:26" (3/3) ... [2022-07-12 02:55:26,526 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0683a.c [2022-07-12 02:55:26,537 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:55:26,541 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:55:26,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:55:26,618 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@633b7f30, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@defb521 [2022-07-12 02:55:26,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:55:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 100 states have (on average 1.65) internal successors, (165), 101 states have internal predecessors, (165), 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) [2022-07-12 02:55:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 02:55:26,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:26,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:55:26,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:26,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:26,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1361939207, now seen corresponding path program 1 times [2022-07-12 02:55:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:26,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26622179] [2022-07-12 02:55:26,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:26,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:26,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:26,676 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) [2022-07-12 02:55:26,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 02:55:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:27,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 02:55:27,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:27,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:27,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:27,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26622179] [2022-07-12 02:55:27,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26622179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:27,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:27,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:55:27,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392545355] [2022-07-12 02:55:27,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:27,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:55:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:27,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:55:27,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:55:27,117 INFO L87 Difference]: Start difference. First operand has 108 states, 100 states have (on average 1.65) internal successors, (165), 101 states have internal predecessors, (165), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:27,158 INFO L93 Difference]: Finished difference Result 214 states and 348 transitions. [2022-07-12 02:55:27,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:55:27,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 02:55:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:27,171 INFO L225 Difference]: With dead ends: 214 [2022-07-12 02:55:27,172 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 02:55:27,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:55:27,178 INFO L413 NwaCegarLoop]: 150 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, 150 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:27,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:55:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 02:55:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 02:55:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 97 states have internal predecessors, (137), 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) [2022-07-12 02:55:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2022-07-12 02:55:27,232 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 16 [2022-07-12 02:55:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:27,232 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2022-07-12 02:55:27,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2022-07-12 02:55:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 02:55:27,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:27,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:55:27,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 02:55:27,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:27,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash 737645393, now seen corresponding path program 1 times [2022-07-12 02:55:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:27,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979007908] [2022-07-12 02:55:27,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:27,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:27,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:27,457 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) [2022-07-12 02:55:27,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 02:55:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:27,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 02:55:27,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:28,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:28,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:28,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979007908] [2022-07-12 02:55:28,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979007908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:28,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:28,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:55:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482850251] [2022-07-12 02:55:28,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:28,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:55:28,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:28,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:55:28,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:55:28,041 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:28,247 INFO L93 Difference]: Finished difference Result 197 states and 278 transitions. [2022-07-12 02:55:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:55:28,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 02:55:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:28,250 INFO L225 Difference]: With dead ends: 197 [2022-07-12 02:55:28,250 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 02:55:28,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:55:28,251 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:28,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 02:55:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 02:55:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 02:55:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 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) [2022-07-12 02:55:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2022-07-12 02:55:28,259 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 19 [2022-07-12 02:55:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:28,259 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2022-07-12 02:55:28,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:28,260 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2022-07-12 02:55:28,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 02:55:28,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:28,260 INFO L195 NwaCegarLoop]: 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] [2022-07-12 02:55:28,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 02:55:28,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:28,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:28,477 INFO L85 PathProgramCache]: Analyzing trace with hash -251660186, now seen corresponding path program 1 times [2022-07-12 02:55:28,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:28,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164112346] [2022-07-12 02:55:28,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:28,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:28,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:28,496 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) [2022-07-12 02:55:28,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 02:55:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:28,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 02:55:28,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:30,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-12 02:55:35,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 02:55:35,882 INFO L356 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-07-12 02:55:35,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-07-12 02:55:39,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 02:55:39,121 INFO L390 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 1 case distinctions, treesize of input 33 treesize of output 17 [2022-07-12 02:55:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:45,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:45,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:45,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164112346] [2022-07-12 02:55:45,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164112346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:45,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:45,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 02:55:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128857508] [2022-07-12 02:55:45,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:45,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 02:55:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:45,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 02:55:45,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-12 02:55:45,759 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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) [2022-07-12 02:55:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:45,786 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-07-12 02:55:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 02:55:45,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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 [2022-07-12 02:55:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:45,788 INFO L225 Difference]: With dead ends: 113 [2022-07-12 02:55:45,788 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 02:55:45,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-12 02:55:45,789 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 2 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:45,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 975 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 116 Unchecked, 0.0s Time] [2022-07-12 02:55:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 02:55:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 02:55:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 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) [2022-07-12 02:55:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2022-07-12 02:55:45,804 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 23 [2022-07-12 02:55:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:45,805 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2022-07-12 02:55:45,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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) [2022-07-12 02:55:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2022-07-12 02:55:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 02:55:45,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:45,807 INFO L195 NwaCegarLoop]: 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] [2022-07-12 02:55:45,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 02:55:46,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:46,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1496407545, now seen corresponding path program 1 times [2022-07-12 02:55:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:46,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373521678] [2022-07-12 02:55:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:46,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:46,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:46,027 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) [2022-07-12 02:55:46,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 02:55:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:46,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 02:55:46,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:48,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:48,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373521678] [2022-07-12 02:55:48,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373521678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:48,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:48,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 02:55:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072076682] [2022-07-12 02:55:48,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:48,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 02:55:48,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:48,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 02:55:48,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:55:48,756 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:52,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:55:52,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:52,607 INFO L93 Difference]: Finished difference Result 193 states and 267 transitions. [2022-07-12 02:55:52,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 02:55:52,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-07-12 02:55:52,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:52,820 INFO L225 Difference]: With dead ends: 193 [2022-07-12 02:55:52,820 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 02:55:52,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:55:52,821 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 14 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:52,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 782 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 1 Unknown, 38 Unchecked, 3.5s Time] [2022-07-12 02:55:52,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 02:55:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2022-07-12 02:55:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 97 states have internal predecessors, (134), 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) [2022-07-12 02:55:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2022-07-12 02:55:52,831 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 142 transitions. Word has length 28 [2022-07-12 02:55:52,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:52,831 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 142 transitions. [2022-07-12 02:55:52,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions. [2022-07-12 02:55:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 02:55:52,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:52,832 INFO L195 NwaCegarLoop]: 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] [2022-07-12 02:55:52,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 02:55:53,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:53,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:53,050 INFO L85 PathProgramCache]: Analyzing trace with hash 278599817, now seen corresponding path program 1 times [2022-07-12 02:55:53,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:53,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274688969] [2022-07-12 02:55:53,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:53,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:53,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:53,053 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) [2022-07-12 02:55:53,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 02:55:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:53,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 02:55:53,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:57,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:57,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:57,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274688969] [2022-07-12 02:55:57,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274688969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:57,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:57,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:55:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89155419] [2022-07-12 02:55:57,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:57,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:55:57,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:57,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:55:57,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=12, Unknown=1, NotChecked=0, Total=20 [2022-07-12 02:55:57,062 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:01,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:56:01,988 INFO L93 Difference]: Finished difference Result 188 states and 258 transitions. [2022-07-12 02:56:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:56:02,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2022-07-12 02:56:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:56:02,216 INFO L225 Difference]: With dead ends: 188 [2022-07-12 02:56:02,216 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 02:56:02,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=11, Invalid=17, Unknown=2, NotChecked=0, Total=30 [2022-07-12 02:56:02,218 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 13 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 02:56:02,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 503 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 29 Unchecked, 2.6s Time] [2022-07-12 02:56:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 02:56:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2022-07-12 02:56:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 91 states have internal predecessors, (124), 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) [2022-07-12 02:56:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2022-07-12 02:56:02,225 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 28 [2022-07-12 02:56:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:56:02,226 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2022-07-12 02:56:02,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2022-07-12 02:56:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 02:56:02,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:02,227 INFO L195 NwaCegarLoop]: 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] [2022-07-12 02:56:02,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 02:56:02,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:56:02,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash -170923191, now seen corresponding path program 1 times [2022-07-12 02:56:02,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:56:02,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144125668] [2022-07-12 02:56:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:02,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:56:02,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:56:02,449 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) [2022-07-12 02:56:02,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 02:56:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:56:02,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:56:02,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:56:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:56:05,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:56:05,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:56:05,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144125668] [2022-07-12 02:56:05,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144125668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:56:05,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:56:05,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 02:56:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424089358] [2022-07-12 02:56:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:56:05,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 02:56:05,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:56:05,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 02:56:05,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:56:05,517 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:56:05,521 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2022-07-12 02:56:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 02:56:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2022-07-12 02:56:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:56:05,521 INFO L225 Difference]: With dead ends: 116 [2022-07-12 02:56:05,521 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 02:56:05,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:56:05,522 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 11 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:56:05,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 624 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-12 02:56:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 02:56:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2022-07-12 02:56:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 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) [2022-07-12 02:56:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 128 transitions. [2022-07-12 02:56:05,536 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 128 transitions. Word has length 28 [2022-07-12 02:56:05,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:56:05,536 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 128 transitions. [2022-07-12 02:56:05,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 128 transitions. [2022-07-12 02:56:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 02:56:05,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:05,537 INFO L195 NwaCegarLoop]: 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] [2022-07-12 02:56:05,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 02:56:05,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:56:05,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:05,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2019366507, now seen corresponding path program 1 times [2022-07-12 02:56:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:56:05,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011178263] [2022-07-12 02:56:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:05,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:56:05,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:56:05,759 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) [2022-07-12 02:56:05,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 02:56:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:56:06,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 02:56:06,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:56:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:56:11,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:56:11,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:56:11,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011178263] [2022-07-12 02:56:11,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011178263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:56:11,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:56:11,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 02:56:11,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109965909] [2022-07-12 02:56:11,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:56:11,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 02:56:11,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:56:11,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 02:56:11,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:56:11,141 INFO L87 Difference]: Start difference. First operand 96 states and 128 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:14,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:56:15,706 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2022-07-12 02:56:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 02:56:15,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 02:56:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:56:15,708 INFO L225 Difference]: With dead ends: 106 [2022-07-12 02:56:15,708 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 02:56:15,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:56:15,711 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 5 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:56:15,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 552 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 27 Unchecked, 4.0s Time] [2022-07-12 02:56:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 02:56:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-07-12 02:56:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 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) [2022-07-12 02:56:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-07-12 02:56:15,716 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 29 [2022-07-12 02:56:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:56:15,716 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-07-12 02:56:15,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-07-12 02:56:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 02:56:15,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:15,717 INFO L195 NwaCegarLoop]: 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] [2022-07-12 02:56:15,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-12 02:56:15,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:56:15,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1310102379, now seen corresponding path program 1 times [2022-07-12 02:56:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:56:15,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150458573] [2022-07-12 02:56:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:15,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:56:15,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:56:15,922 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) [2022-07-12 02:56:15,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 02:56:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:56:16,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 02:56:16,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:56:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:56:33,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:56:33,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:56:33,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150458573] [2022-07-12 02:56:33,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150458573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:56:33,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:56:33,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 02:56:33,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225113205] [2022-07-12 02:56:33,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:56:33,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 02:56:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:56:33,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 02:56:33,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=55, Unknown=2, NotChecked=0, Total=72 [2022-07-12 02:56:33,239 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:34,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:37,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:56:37,300 INFO L93 Difference]: Finished difference Result 166 states and 218 transitions. [2022-07-12 02:56:37,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 02:56:37,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 02:56:37,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:56:37,301 INFO L225 Difference]: With dead ends: 166 [2022-07-12 02:56:37,301 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 02:56:37,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=19, Invalid=68, Unknown=3, NotChecked=0, Total=90 [2022-07-12 02:56:37,302 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 14 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 02:56:37,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 883 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 28 Unchecked, 1.7s Time] [2022-07-12 02:56:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 02:56:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2022-07-12 02:56:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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) [2022-07-12 02:56:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2022-07-12 02:56:37,336 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 29 [2022-07-12 02:56:37,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:56:37,336 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2022-07-12 02:56:37,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-07-12 02:56:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 02:56:37,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:37,340 INFO L195 NwaCegarLoop]: 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] [2022-07-12 02:56:37,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 02:56:37,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:56:37,559 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash -654903338, now seen corresponding path program 1 times [2022-07-12 02:56:37,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:56:37,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159695577] [2022-07-12 02:56:37,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:37,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:56:37,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:56:37,562 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) [2022-07-12 02:56:37,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 02:56:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:56:37,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:56:37,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:56:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:56:41,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:56:41,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:56:41,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159695577] [2022-07-12 02:56:41,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159695577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:56:41,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:56:41,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 02:56:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648203020] [2022-07-12 02:56:41,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:56:41,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 02:56:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:56:41,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 02:56:41,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:56:41,251 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:56:41,255 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2022-07-12 02:56:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 02:56:41,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 30 [2022-07-12 02:56:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:56:41,256 INFO L225 Difference]: With dead ends: 160 [2022-07-12 02:56:41,256 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 02:56:41,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:56:41,257 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 11 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 561 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 [2022-07-12 02:56:41,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 561 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-07-12 02:56:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 02:56:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2022-07-12 02:56:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 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) [2022-07-12 02:56:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2022-07-12 02:56:41,263 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 30 [2022-07-12 02:56:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:56:41,263 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2022-07-12 02:56:41,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2022-07-12 02:56:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 02:56:41,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:41,264 INFO L195 NwaCegarLoop]: 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] [2022-07-12 02:56:41,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 02:56:41,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:56:41,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:41,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1853376180, now seen corresponding path program 1 times [2022-07-12 02:56:41,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:56:41,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371871448] [2022-07-12 02:56:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:41,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:56:41,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:56:41,486 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) [2022-07-12 02:56:41,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 02:56:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:56:41,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 02:56:41,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:56:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:56:43,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:56:43,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:56:43,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371871448] [2022-07-12 02:56:43,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371871448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:56:43,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:56:43,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 02:56:43,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116213569] [2022-07-12 02:56:43,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:56:43,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:56:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:56:43,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:56:43,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:56:43,979 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:56:47,514 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-07-12 02:56:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 02:56:47,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2022-07-12 02:56:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:56:47,515 INFO L225 Difference]: With dead ends: 103 [2022-07-12 02:56:47,515 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 02:56:47,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:56:47,516 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 112 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 02:56:47,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 327 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-12 02:56:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 02:56:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2022-07-12 02:56:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 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) [2022-07-12 02:56:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-07-12 02:56:47,528 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 30 [2022-07-12 02:56:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:56:47,528 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-07-12 02:56:47,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-07-12 02:56:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 02:56:47,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:47,530 INFO L195 NwaCegarLoop]: 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, 1] [2022-07-12 02:56:47,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-12 02:56:47,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:56:47,735 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:47,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:47,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1644697584, now seen corresponding path program 1 times [2022-07-12 02:56:47,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:56:47,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950449548] [2022-07-12 02:56:47,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:47,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:56:47,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:56:47,739 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) [2022-07-12 02:56:47,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 02:56:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:56:48,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 02:56:48,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:56:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:56:54,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:56:54,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:56:54,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950449548] [2022-07-12 02:56:54,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950449548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:56:54,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:56:54,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 02:56:54,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989294949] [2022-07-12 02:56:54,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:56:54,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 02:56:54,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:56:54,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 02:56:54,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:56:54,209 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:56:54,246 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions. [2022-07-12 02:56:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 02:56:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 02:56:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:56:54,248 INFO L225 Difference]: With dead ends: 141 [2022-07-12 02:56:54,248 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 02:56:54,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:56:54,248 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 9 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:56:54,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 423 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-07-12 02:56:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 02:56:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2022-07-12 02:56:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.196969696969697) internal successors, (79), 66 states have internal predecessors, (79), 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) [2022-07-12 02:56:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-07-12 02:56:54,252 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 31 [2022-07-12 02:56:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:56:54,252 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-07-12 02:56:54,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-07-12 02:56:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 02:56:54,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:54,255 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-07-12 02:56:54,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 02:56:54,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:56:54,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash 148053985, now seen corresponding path program 1 times [2022-07-12 02:56:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:56:54,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500045866] [2022-07-12 02:56:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:54,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:56:54,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:56:54,475 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) [2022-07-12 02:56:54,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 02:56:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:56:54,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 02:56:54,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:56:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:56:59,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:56:59,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:56:59,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500045866] [2022-07-12 02:56:59,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500045866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:56:59,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:56:59,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 02:56:59,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872784722] [2022-07-12 02:56:59,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:56:59,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 02:56:59,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:56:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 02:56:59,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 02:56:59,114 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:02,674 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-07-12 02:57:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 02:57:02,674 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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 34 [2022-07-12 02:57:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:02,675 INFO L225 Difference]: With dead ends: 81 [2022-07-12 02:57:02,675 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 02:57:02,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-07-12 02:57:02,676 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 73 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:02,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 523 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 7 Unchecked, 0.9s Time] [2022-07-12 02:57:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 02:57:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2022-07-12 02:57:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 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) [2022-07-12 02:57:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-07-12 02:57:02,679 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 34 [2022-07-12 02:57:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:02,680 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-07-12 02:57:02,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-07-12 02:57:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 02:57:02,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:02,682 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:02,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-12 02:57:02,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:02,886 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:02,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2113992496, now seen corresponding path program 1 times [2022-07-12 02:57:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:02,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368894600] [2022-07-12 02:57:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:02,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:02,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:02,890 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) [2022-07-12 02:57:02,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 02:57:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:03,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 02:57:03,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:05,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:05,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:05,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368894600] [2022-07-12 02:57:05,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368894600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:05,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:05,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:57:05,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102771715] [2022-07-12 02:57:05,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:05,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:57:05,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:05,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:57:05,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:05,373 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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) [2022-07-12 02:57:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:05,375 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-12 02:57:05,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:57:05,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 36 [2022-07-12 02:57:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:05,375 INFO L225 Difference]: With dead ends: 63 [2022-07-12 02:57:05,375 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 02:57:05,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:05,376 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:05,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 3 Unchecked, 0.0s Time] [2022-07-12 02:57:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 02:57:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 02:57:05,376 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) [2022-07-12 02:57:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 02:57:05,376 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-07-12 02:57:05,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:05,377 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 02:57:05,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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) [2022-07-12 02:57:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 02:57:05,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 02:57:05,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:57:05,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-12 02:57:05,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:05,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 02:57:10,683 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 19 33) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point fabs_doubleEXIT(lines 19 33) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L902 garLoopResultBuilder]: At program point fabs_doubleENTRY(lines 19 33) the Hoare annotation is: true [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L902 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: true [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point fabs_doubleFINAL(lines 19 33) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L902 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: true [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 88) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 114) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 115) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-07-12 02:57:10,684 INFO L902 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: true [2022-07-12 02:57:10,684 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 113) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L902 garLoopResultBuilder]: At program point L70-2(lines 70 74) the Hoare annotation is: true [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 105) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L132-2(line 132) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 94) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point atan_doubleEXIT(lines 66 134) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L902 garLoopResultBuilder]: At program point atan_doubleENTRY(lines 66 134) the Hoare annotation is: true [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 89) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point atan_doubleFINAL(lines 66 134) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 220) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L217-2(lines 215 220) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L300(line 300) no Hoare annotation was computed. [2022-07-12 02:57:10,685 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 209) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L185-1(lines 144 244) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L895 garLoopResultBuilder]: At program point L268(lines 261 269) the Hoare annotation is: (and (= (_ +zero 11 53) ~zero_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64)) (|v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6|) (_ bv4 32)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_35|)) |ULTIMATE.start_main_~y~0#1|) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|) .cse0) (= |ULTIMATE.start_isfinite_double_#res#1| (bvlshr (bvadd (bvand (_ bv2147483647 32) .cse0) (_ bv2148532224 32)) (_ bv31 32)))))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_main_~x~0#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 208) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 180) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 144 244) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 196) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L895 garLoopResultBuilder]: At program point L220-1(line 220) the Hoare annotation is: false [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L220-2(line 220) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 243) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-07-12 02:57:10,686 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L172-2(line 172) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L222(line 222) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 156 161) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L895 garLoopResultBuilder]: At program point L156-2(lines 156 161) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse2 (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7|))) (let ((.cse0 (select .cse2 (_ bv4 32))) (.cse1 (select .cse2 (_ bv0 32)))) (and (= |ULTIMATE.start___ieee754_atan2_~ix~1#1| (bvand .cse0 (_ bv2147483647 32))) (= |ULTIMATE.start___ieee754_atan2_~lx~0#1| .cse1) (= .cse0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= .cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_36|)))))) (= (_ +zero 11 53) ~zero_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_100| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_100|) |ULTIMATE.start___ieee754_atan2_~hx~1#1|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_100|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_100|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_100|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_35|)))) (and (= .cse3 |ULTIMATE.start___ieee754_atan2_~y#1|) (not (= (bvlshr (bvadd (_ bv2148532224 32) (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|))) (_ bv31 32)) (_ bv0 32))) (fp.lt .cse3 (_ +zero 11 53)))))) [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L156-3(lines 156 161) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L902 garLoopResultBuilder]: At program point L305(lines 283 306) the Hoare annotation is: true [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L239(line 239) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L241(line 241) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L274-1(lines 274 278) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L895 garLoopResultBuilder]: At program point L274-2(lines 274 278) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_atan2_#res#1| .cse0) (= (_ +zero 11 53) ~zero_atan2~0) |ULTIMATE.start_main_#t~short52#1| (= .cse0 |ULTIMATE.start___signbit_double_~x#1|) (= |ULTIMATE.start_main_~res~0#1| .cse0))) [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L274-3(lines 274 278) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L895 garLoopResultBuilder]: At program point L258(lines 247 259) the Hoare annotation is: (and (= (_ +zero 11 53) ~zero_atan2~0) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_main_~x~0#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L192(line 192) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 230) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L895 garLoopResultBuilder]: At program point L226-2(lines 226 230) the Hoare annotation is: false [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 02:57:10,687 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L895 garLoopResultBuilder]: At program point L144(lines 144 244) the Hoare annotation is: (and |ULTIMATE.start___ieee754_atan2_#t~switch35#1| (= |ULTIMATE.start___ieee754_atan2_#res#1| (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ~zero_atan2~0)) [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L294(line 294) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L294-2(lines 294 303) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L294-4(lines 294 303) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 165) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L263-1(lines 263 267) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L895 garLoopResultBuilder]: At program point L263-2(lines 263 267) the Hoare annotation is: (and (= (_ +zero 11 53) ~zero_atan2~0) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_main_~x~0#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)))) (= |ULTIMATE.start_isfinite_double_~x#1| |ULTIMATE.start_main_~y~0#1|)) [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L263-3(lines 263 267) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L895 garLoopResultBuilder]: At program point L280(lines 271 281) the Hoare annotation is: (and (= (_ +zero 11 53) ~zero_atan2~0) |ULTIMATE.start_main_#t~short52#1| (= (_ bv1 32) |ULTIMATE.start___signbit_double_#res#1|)) [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 300) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 236) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 207) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L231-1(lines 224 237) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L231-2(lines 231 236) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 220) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L149-1(lines 149 154) no Hoare annotation was computed. [2022-07-12 02:57:10,688 INFO L895 garLoopResultBuilder]: At program point L149-2(lines 149 154) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64)) (|v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6|) (_ bv4 32))) (.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_35|)))) (and (= .cse0 |ULTIMATE.start___ieee754_atan2_~y#1|) (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) .cse1) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|) .cse1) (fp.lt .cse0 (_ +zero 11 53))))) (= (_ +zero 11 53) ~zero_atan2~0) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_atan2_~x#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) [2022-07-12 02:57:10,688 INFO L899 garLoopResultBuilder]: For program point L149-3(lines 149 154) no Hoare annotation was computed. [2022-07-12 02:57:10,689 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-07-12 02:57:10,689 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 167) no Hoare annotation was computed. [2022-07-12 02:57:10,689 INFO L899 garLoopResultBuilder]: For program point L249-1(lines 249 254) no Hoare annotation was computed. [2022-07-12 02:57:10,689 INFO L895 garLoopResultBuilder]: At program point L249-2(lines 249 254) the Hoare annotation is: (and (= (_ +zero 11 53) ~zero_atan2~0) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_main_~x~0#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) [2022-07-12 02:57:10,689 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-07-12 02:57:10,689 INFO L899 garLoopResultBuilder]: For program point L249-3(lines 249 254) no Hoare annotation was computed. [2022-07-12 02:57:10,689 INFO L899 garLoopResultBuilder]: For program point L183-2(line 183) no Hoare annotation was computed. [2022-07-12 02:57:10,689 INFO L899 garLoopResultBuilder]: For program point L299(line 299) no Hoare annotation was computed. [2022-07-12 02:57:10,689 INFO L899 garLoopResultBuilder]: For program point L299-2(lines 299 302) no Hoare annotation was computed. [2022-07-12 02:57:10,689 INFO L895 garLoopResultBuilder]: At program point L167(line 167) the Hoare annotation is: false [2022-07-12 02:57:10,689 INFO L899 garLoopResultBuilder]: For program point L167-1(line 167) no Hoare annotation was computed. [2022-07-12 02:57:10,693 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:10,695 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:57:10,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,704 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,713 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,714 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,715 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,715 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,725 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,725 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,727 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,727 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,727 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,727 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,727 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,728 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,728 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,728 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,728 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,728 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,728 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,728 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,728 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,728 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,729 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,729 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,729 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,729 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,729 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,730 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,730 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,730 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,732 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,732 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,732 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,737 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,737 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,737 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,737 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,737 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,737 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,737 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,754 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,756 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,756 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,756 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,756 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,756 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,756 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,756 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,757 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,760 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:57:10 BoogieIcfgContainer [2022-07-12 02:57:10,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:57:10,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:57:10,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:57:10,761 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:57:10,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:55:26" (3/4) ... [2022-07-12 02:57:10,766 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 02:57:10,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2022-07-12 02:57:10,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_double [2022-07-12 02:57:10,780 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2022-07-12 02:57:10,782 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-07-12 02:57:10,783 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-12 02:57:10,783 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 02:57:10,804 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ~Pluszero~LONGDOUBLE() == zero_atan2 && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) [2022-07-12 02:57:10,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ~Pluszero~LONGDOUBLE() == zero_atan2 && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) [2022-07-12 02:57:10,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~Pluszero~LONGDOUBLE() == zero_atan2 && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()))) && x == y [2022-07-12 02:57:10,806 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~Pluszero~LONGDOUBLE() == zero_atan2 && (\exists v_skolemized_q#valueAsBitvector_35 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == y && v_skolemized_q#valueAsBitvector_35[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]) && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32))) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) [2022-07-12 02:57:10,806 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_skolemized_q#valueAsBitvector_35 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == y && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32) == 0bv32)) && v_skolemized_q#valueAsBitvector_35[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]), ~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == zero_atan2) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) [2022-07-12 02:57:10,807 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_skolemized_q#valueAsBitvector_36 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7 : bv32, currentRoundingMode : FloatRoundingMode :: (((ix == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32], 2147483647bv32) && lx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32] == v_skolemized_q#valueAsBitvector_36[63:32]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_36[63:63], v_skolemized_q#valueAsBitvector_36[62:52], v_skolemized_q#valueAsBitvector_36[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32] == v_skolemized_q#valueAsBitvector_36[31:0]) && ~Pluszero~LONGDOUBLE() == zero_atan2) && (\exists v_skolemized_q#valueAsBitvector_100 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_100[63:32] == hx && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_100[63:63], v_skolemized_q#valueAsBitvector_100[62:52], v_skolemized_q#valueAsBitvector_100[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_35 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == y && !(~bvlshr32(~bvadd64(2148532224bv32, ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_35[63:32])), 31bv32) == 0bv32)) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]), ~Pluszero~LONGDOUBLE())) [2022-07-12 02:57:10,807 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-switch (m) { case 0: return zero_atan2; case 1: return -zero_atan2; case 2: return pi + tiny_atan2; case 3: return -pi - tiny_atan2; }-aux && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == zero_atan2 [2022-07-12 02:57:10,808 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == zero_atan2) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2022-07-12 02:57:10,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~Pluszero~LONGDOUBLE() == zero_atan2 && aux-res == -0.0 && __signbit_double(res) == 1-aux) && 1bv32 == \result [2022-07-12 02:57:10,847 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 02:57:10,847 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:57:10,848 INFO L158 Benchmark]: Toolchain (without parser) took 127552.08ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 48.2MB in the beginning and 55.8MB in the end (delta: -7.6MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2022-07-12 02:57:10,848 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 69.2MB. Free memory was 49.3MB in the beginning and 49.3MB in the end (delta: 32.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:57:10,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.43ms. Allocated memory is still 69.2MB. Free memory was 48.0MB in the beginning and 46.0MB in the end (delta: 2.0MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-07-12 02:57:10,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.39ms. Allocated memory is still 69.2MB. Free memory was 46.0MB in the beginning and 43.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:57:10,849 INFO L158 Benchmark]: Boogie Preprocessor took 53.77ms. Allocated memory is still 69.2MB. Free memory was 43.2MB in the beginning and 40.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:57:10,850 INFO L158 Benchmark]: RCFGBuilder took 22753.52ms. Allocated memory is still 69.2MB. Free memory was 40.0MB in the beginning and 28.2MB in the end (delta: 11.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-07-12 02:57:10,850 INFO L158 Benchmark]: TraceAbstraction took 104276.22ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 27.6MB in the beginning and 62.9MB in the end (delta: -35.2MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-07-12 02:57:10,850 INFO L158 Benchmark]: Witness Printer took 86.55ms. Allocated memory is still 86.0MB. Free memory was 62.9MB in the beginning and 55.8MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 02:57:10,856 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.15ms. Allocated memory is still 69.2MB. Free memory was 49.3MB in the beginning and 49.3MB in the end (delta: 32.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.43ms. Allocated memory is still 69.2MB. Free memory was 48.0MB in the beginning and 46.0MB in the end (delta: 2.0MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.39ms. Allocated memory is still 69.2MB. Free memory was 46.0MB in the beginning and 43.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.77ms. Allocated memory is still 69.2MB. Free memory was 43.2MB in the beginning and 40.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 22753.52ms. Allocated memory is still 69.2MB. Free memory was 40.0MB in the beginning and 28.2MB in the end (delta: 11.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 104276.22ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 27.6MB in the beginning and 62.9MB in the end (delta: -35.2MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Witness Printer took 86.55ms. Allocated memory is still 86.0MB. Free memory was 62.9MB in the beginning and 55.8MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. 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[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,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[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,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[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,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[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,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[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,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[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,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[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#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[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#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 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 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 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] * 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: 300]: 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, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 104.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 15.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 6636 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 284 IncrementalHoareTripleChecker+Unchecked, 5165 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1471 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 46.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=0, InterpolantAutomatonStates: 86, 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, 64 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 84 PreInvPairs, 94 NumberOfFragments, 290 HoareAnnotationTreeSize, 84 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 195 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 65.7s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 348 ConstructedInterpolants, 135 QuantifiedInterpolants, 3329 SizeOfPredicates, 98 NumberOfNonLiveVariables, 2395 ConjunctsInSsa, 156 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: 149]: Loop Invariant [2022-07-12 02:57:10,878 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,878 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,878 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,878 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,879 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,880 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,881 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,881 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((\exists v_skolemized_q#valueAsBitvector_35 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == y && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32) == 0bv32)) && v_skolemized_q#valueAsBitvector_35[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]), ~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == zero_atan2) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 156]: Loop Invariant [2022-07-12 02:57:10,882 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,882 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,882 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,882 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,882 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,882 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,882 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,882 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,882 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,883 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,884 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,885 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_36,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_100,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,886 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,887 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,887 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,887 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] Derived loop invariant: (((\exists v_skolemized_q#valueAsBitvector_36 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7 : bv32, currentRoundingMode : FloatRoundingMode :: (((ix == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32], 2147483647bv32) && lx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32] == v_skolemized_q#valueAsBitvector_36[63:32]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_36[63:63], v_skolemized_q#valueAsBitvector_36[62:52], v_skolemized_q#valueAsBitvector_36[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32] == v_skolemized_q#valueAsBitvector_36[31:0]) && ~Pluszero~LONGDOUBLE() == zero_atan2) && (\exists v_skolemized_q#valueAsBitvector_100 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_100[63:32] == hx && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_100[63:63], v_skolemized_q#valueAsBitvector_100[62:52], v_skolemized_q#valueAsBitvector_100[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_35 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == y && !(~bvlshr32(~bvadd64(2148532224bv32, ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_35[63:32])), 31bv32) == 0bv32)) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 261]: Loop Invariant [2022-07-12 02:57:10,887 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:57:10,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:57:10,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (~Pluszero~LONGDOUBLE() == zero_atan2 && (\exists v_skolemized_q#valueAsBitvector_35 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == y && v_skolemized_q#valueAsBitvector_35[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]) && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32))) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (aux-switch (m) { case 0: return zero_atan2; case 1: return -zero_atan2; case 2: return pi + tiny_atan2; case 3: return -pi - tiny_atan2; }-aux && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == zero_atan2 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 249]: Loop Invariant [2022-07-12 02:57:10,890 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,891 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,891 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,891 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ~Pluszero~LONGDOUBLE() == zero_atan2 && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: (((\result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == zero_atan2) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == zero_atan2 && aux-res == -0.0 && __signbit_double(res) == 1-aux) && 1bv32 == \result - InvariantResult [Line: 263]: Loop Invariant [2022-07-12 02:57:10,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,893 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (~Pluszero~LONGDOUBLE() == zero_atan2 && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()))) && x == y - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 247]: Loop Invariant [2022-07-12 02:57:10,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:57:10,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ~Pluszero~LONGDOUBLE() == zero_atan2 && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 02:57:11,111 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-12 02:57:11,188 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE