./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_Newton-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-benchs/inv_Newton-1.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 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:23:25,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:23:25,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:23:26,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:23:26,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:23:26,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:23:26,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:23:26,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:23:26,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:23:26,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:23:26,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:23:26,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:23:26,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:23:26,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:23:26,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:23:26,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:23:26,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:23:26,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:23:26,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:23:26,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:23:26,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:23:26,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:23:26,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:23:26,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:23:26,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:23:26,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:23:26,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:23:26,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:23:26,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:23:26,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:23:26,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:23:26,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:23:26,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:23:26,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:23:26,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:23:26,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:23:26,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:23:26,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:23:26,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:23:26,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:23:26,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:23:26,089 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:23:26,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:23:26,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:23:26,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:23:26,115 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:23:26,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:23:26,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:23:26,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:23:26,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:23:26,117 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:23:26,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:23:26,118 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:23:26,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:23:26,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:23:26,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:23:26,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:23:26,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:23:26,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:23:26,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:23:26,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:23:26,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:23:26,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:23:26,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:23:26,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:23:26,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:23:26,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:26,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:23:26,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:23:26,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:23:26,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:23:26,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:23:26,121 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:23:26,121 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:23:26,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:23:26,122 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 -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2022-02-20 16:23:26,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:23:26,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:23:26,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:23:26,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:23:26,379 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:23:26,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-02-20 16:23:26,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a17edc4/a3c49dea2b2148b989810be3331ecb59/FLAG56bcd7f2f [2022-02-20 16:23:26,780 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:23:26,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-02-20 16:23:26,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a17edc4/a3c49dea2b2148b989810be3331ecb59/FLAG56bcd7f2f [2022-02-20 16:23:27,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a17edc4/a3c49dea2b2148b989810be3331ecb59 [2022-02-20 16:23:27,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:23:27,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:23:27,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:27,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:23:27,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:23:27,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2ba5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27, skipping insertion in model container [2022-02-20 16:23:27,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:23:27,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:23:27,370 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-benchs/inv_Newton-1.c[598,611] [2022-02-20 16:23:27,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:27,389 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:23:27,397 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-benchs/inv_Newton-1.c[598,611] [2022-02-20 16:23:27,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:27,414 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:23:27,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27 WrapperNode [2022-02-20 16:23:27,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:27,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:27,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:23:27,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:23:27,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,449 INFO L137 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2022-02-20 16:23:27,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:27,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:23:27,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:23:27,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:23:27,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:23:27,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:23:27,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:23:27,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:23:27,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (1/1) ... [2022-02-20 16:23:27,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:27,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:23:27,496 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-02-20 16:23:27,503 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-02-20 16:23:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:23:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:23:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:23:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:23:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:23:27,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:23:27,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:23:27,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:23:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:23:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:23:27,580 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:23:27,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:23:27,761 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:23:27,765 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:23:27,765 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:23:27,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:27 BoogieIcfgContainer [2022-02-20 16:23:27,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:23:27,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:23:27,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:23:27,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:23:27,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:23:27" (1/3) ... [2022-02-20 16:23:27,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110c6915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:27, skipping insertion in model container [2022-02-20 16:23:27,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:27" (2/3) ... [2022-02-20 16:23:27,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110c6915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:27, skipping insertion in model container [2022-02-20 16:23:27,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:27" (3/3) ... [2022-02-20 16:23:27,772 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2022-02-20 16:23:27,776 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:23:27,791 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:23:27,826 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:23:27,833 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:23:27,833 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:23:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:23:27,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:27,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:27,855 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:27,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-02-20 16:23:27,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:23:27,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170603609] [2022-02-20 16:23:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:27,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:23:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:28,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {17#true} is VALID [2022-02-20 16:23:28,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~r~0#1;havoc main_~a~0#1;havoc main_~r~0#1;main_~a~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~a~0#1, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0#1, 30.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {17#true} is VALID [2022-02-20 16:23:28,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {18#false} is VALID [2022-02-20 16:23:28,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {18#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_inv } true;inv_#in~A#1 := main_~a~0#1;havoc inv_#res#1;havoc inv_#t~mem4#1, inv_#t~mem5#1, inv_~A#1, inv_~xi~0#1, inv_~xsi~0#1, inv_~temp~0#1, inv_~cond~0#1, inv_~exp~0#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset;inv_~A#1 := inv_#in~A#1;havoc inv_~xi~0#1;havoc inv_~xsi~0#1;havoc inv_~temp~0#1;havoc inv_~cond~0#1;havoc inv_~exp~0#1;call inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset := #Ultimate.allocOnStack(8);call inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset := #Ultimate.allocOnStack(8);call write~real(inv_~A#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8);call inv_#t~mem4#1 := read~int(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8);inv_~exp~0#1 := (if (if 0 == inv_#t~mem4#1 then 0 else (if 1 == inv_#t~mem4#1 then 0 else ~bitwiseAnd(inv_#t~mem4#1, 9218868437227405312))) / 4503599627370496 % 4294967296 <= 2147483647 then (if 0 == inv_#t~mem4#1 then 0 else (if 1 == inv_#t~mem4#1 then 0 else ~bitwiseAnd(inv_#t~mem4#1, 9218868437227405312))) / 4503599627370496 % 4294967296 else (if 0 == inv_#t~mem4#1 then 0 else (if 1 == inv_#t~mem4#1 then 0 else ~bitwiseAnd(inv_#t~mem4#1, 9218868437227405312))) / 4503599627370496 % 4294967296 - 4294967296) - 1023;havoc inv_#t~mem4#1;call write~real(~convertINTToDOUBLE(1), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8);call write~int(4503599627370496 * (1023 - inv_~exp~0#1), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8);call inv_#t~mem5#1 := read~real(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8);inv_~xi~0#1 := inv_#t~mem5#1;havoc inv_#t~mem5#1;inv_~cond~0#1 := 1; {18#false} is VALID [2022-02-20 16:23:28,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#false} assume !(0 != inv_~cond~0#1); {18#false} is VALID [2022-02-20 16:23:28,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {18#false} inv_#res#1 := inv_~xi~0#1;call ULTIMATE.dealloc(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset);havoc inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset;call ULTIMATE.dealloc(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset);havoc inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset; {18#false} is VALID [2022-02-20 16:23:28,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {18#false} main_#t~ret7#1 := inv_#res#1;assume { :end_inline_inv } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, 0.06) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {18#false} is VALID [2022-02-20 16:23:28,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {18#false} assume 0 == __VERIFIER_assert_~cond#1; {18#false} is VALID [2022-02-20 16:23:28,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {18#false} assume !false; {18#false} is VALID [2022-02-20 16:23:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:28,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:23:28,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170603609] [2022-02-20 16:23:28,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170603609] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:28,048 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:28,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:23:28,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890230879] [2022-02-20 16:23:28,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:23:28,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:28,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:28,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:28,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:23:28,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:23:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:23:28,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:23:28,102 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:28,130 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 16:23:28,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:23:28,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:23:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2022-02-20 16:23:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2022-02-20 16:23:28,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 30 transitions. [2022-02-20 16:23:28,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:28,196 INFO L225 Difference]: With dead ends: 25 [2022-02-20 16:23:28,197 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 16:23:28,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:23:28,201 INFO L933 BasicCegarLoop]: 14 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, 14 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-02-20 16:23:28,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:23:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 16:23:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 16:23:28,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:28,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-02-20 16:23:28,220 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-02-20 16:23:28,220 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-02-20 16:23:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:28,221 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:23:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:28,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:28,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:28,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 16:23:28,222 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 16:23:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:28,223 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:23:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:28,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:28,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:28,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:28,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-02-20 16:23:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-20 16:23:28,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-02-20 16:23:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:28,226 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-20 16:23:28,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:23:28,227 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:28,227 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:28,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:23:28,228 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:28,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-02-20 16:23:28,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:23:28,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45580571] [2022-02-20 16:23:28,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:28,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:23:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:28,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {86#true} is VALID [2022-02-20 16:23:28,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~r~0#1;havoc main_~a~0#1;havoc main_~r~0#1;main_~a~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~a~0#1, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0#1, 30.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {86#true} is VALID [2022-02-20 16:23:28,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {86#true} assume !(0 == assume_abort_if_not_~cond#1); {86#true} is VALID [2022-02-20 16:23:28,324 INFO L290 TraceCheckUtils]: 3: Hoare triple {86#true} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_inv } true;inv_#in~A#1 := main_~a~0#1;havoc inv_#res#1;havoc inv_#t~mem4#1, inv_#t~mem5#1, inv_~A#1, inv_~xi~0#1, inv_~xsi~0#1, inv_~temp~0#1, inv_~cond~0#1, inv_~exp~0#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset;inv_~A#1 := inv_#in~A#1;havoc inv_~xi~0#1;havoc inv_~xsi~0#1;havoc inv_~temp~0#1;havoc inv_~cond~0#1;havoc inv_~exp~0#1;call inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset := #Ultimate.allocOnStack(8);call inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset := #Ultimate.allocOnStack(8);call write~real(inv_~A#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8);call inv_#t~mem4#1 := read~int(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8);inv_~exp~0#1 := (if (if 0 == inv_#t~mem4#1 then 0 else (if 1 == inv_#t~mem4#1 then 0 else ~bitwiseAnd(inv_#t~mem4#1, 9218868437227405312))) / 4503599627370496 % 4294967296 <= 2147483647 then (if 0 == inv_#t~mem4#1 then 0 else (if 1 == inv_#t~mem4#1 then 0 else ~bitwiseAnd(inv_#t~mem4#1, 9218868437227405312))) / 4503599627370496 % 4294967296 else (if 0 == inv_#t~mem4#1 then 0 else (if 1 == inv_#t~mem4#1 then 0 else ~bitwiseAnd(inv_#t~mem4#1, 9218868437227405312))) / 4503599627370496 % 4294967296 - 4294967296) - 1023;havoc inv_#t~mem4#1;call write~real(~convertINTToDOUBLE(1), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8);call write~int(4503599627370496 * (1023 - inv_~exp~0#1), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8);call inv_#t~mem5#1 := read~real(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8);inv_~xi~0#1 := inv_#t~mem5#1;havoc inv_#t~mem5#1;inv_~cond~0#1 := 1; {88#(= |ULTIMATE.start_inv_~cond~0#1| 1)} is VALID [2022-02-20 16:23:28,324 INFO L290 TraceCheckUtils]: 4: Hoare triple {88#(= |ULTIMATE.start_inv_~cond~0#1| 1)} assume !(0 != inv_~cond~0#1); {87#false} is VALID [2022-02-20 16:23:28,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {87#false} inv_#res#1 := inv_~xi~0#1;call ULTIMATE.dealloc(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset);havoc inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset;call ULTIMATE.dealloc(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset);havoc inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset; {87#false} is VALID [2022-02-20 16:23:28,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {87#false} main_#t~ret7#1 := inv_#res#1;assume { :end_inline_inv } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, 0.06) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {87#false} is VALID [2022-02-20 16:23:28,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {87#false} assume 0 == __VERIFIER_assert_~cond#1; {87#false} is VALID [2022-02-20 16:23:28,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {87#false} assume !false; {87#false} is VALID [2022-02-20 16:23:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:28,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:23:28,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45580571] [2022-02-20 16:23:28,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45580571] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:28,326 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:28,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:23:28,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090513481] [2022-02-20 16:23:28,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:28,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:23:28,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:28,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:28,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:28,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:23:28,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:23:28,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:23:28,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:23:28,341 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:28,369 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:23:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:23:28,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:23:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 16:23:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 16:23:28,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-02-20 16:23:28,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:28,392 INFO L225 Difference]: With dead ends: 16 [2022-02-20 16:23:28,392 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 16:23:28,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:23:28,397 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:23:28,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:23:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 16:23:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 16:23:28,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:28,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 16:23:28,402 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 16:23:28,402 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 16:23:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:28,403 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:23:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:23:28,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:28,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:28,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 16:23:28,404 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 16:23:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:28,406 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:23:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:23:28,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:28,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:28,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:28,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 16:23:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-02-20 16:23:28,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-02-20 16:23:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:28,410 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-02-20 16:23:28,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:23:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:23:28,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:28,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:28,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:23:28,412 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:28,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-02-20 16:23:28,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:23:28,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505911043] [2022-02-20 16:23:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:23:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:23:28,465 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:23:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:23:28,537 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:23:28,538 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:23:28,538 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:23:28,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:23:28,542 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:23:28,543 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:23:28,567 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 16:23:28,568 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 16:23:28,568 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:23:28,568 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:23:28,568 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:23:28,568 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:23:28,568 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:23:28,568 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:23:28,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:23:28 BoogieIcfgContainer [2022-02-20 16:23:28,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:23:28,569 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:23:28,569 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:23:28,569 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:23:28,569 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:27" (3/4) ... [2022-02-20 16:23:28,582 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:23:28,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:23:28,583 INFO L158 Benchmark]: Toolchain (without parser) took 1357.03ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 63.3MB in the beginning and 99.6MB in the end (delta: -36.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:23:28,583 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:23:28,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.84ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 65.3MB in the end (delta: -2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:23:28,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.12ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 63.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:23:28,584 INFO L158 Benchmark]: Boogie Preprocessor took 20.68ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 61.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:23:28,584 INFO L158 Benchmark]: RCFGBuilder took 295.75ms. Allocated memory is still 90.2MB. Free memory was 61.9MB in the beginning and 49.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:23:28,584 INFO L158 Benchmark]: TraceAbstraction took 800.75ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 49.1MB in the beginning and 99.6MB in the end (delta: -50.5MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2022-02-20 16:23:28,584 INFO L158 Benchmark]: Witness Printer took 13.18ms. Allocated memory is still 123.7MB. Free memory was 99.6MB in the beginning and 99.6MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:23:28,586 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.84ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 65.3MB in the end (delta: -2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.12ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 63.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.68ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 61.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 295.75ms. Allocated memory is still 90.2MB. Free memory was 61.9MB in the beginning and 49.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 800.75ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 49.1MB in the beginning and 99.6MB in the end (delta: -50.5MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * Witness Printer took 13.18ms. Allocated memory is still 123.7MB. Free memory was 99.6MB in the beginning and 99.6MB in the end (delta: 47.6kB). 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: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 31. Possible FailurePath: [L46] double a,r; [L48] a = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not(a >= 20. && a <= 30.) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume_abort_if_not(a >= 20. && a <= 30.) [L51] CALL, EXPR inv(a) [L26] double xi, xsi, temp; [L27] signed int cond, exp; [L28] union double_int A_u, xi_u; [L29] A_u.d = A [L30] EXPR A_u.i [L30] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L31] xi_u.d = 1 [L32] xi_u.i = (((long long)(1023-exp)) << 52) [L33] EXPR xi_u.d [L33] xi = xi_u.d [L34] cond = 1 VAL [\old(A)=9214364837600034821, A=9214364837600034821, A_u={4:0}, cond=1, exp=-1023, xi=9214364837600034820, xi_u={5:0}] [L35] COND TRUE \read(cond) [L36] xsi = 2*xi-A*xi*xi [L37] temp = xsi-xi [L38] cond = ((temp > 1e-10) || (temp < -1e-10)) [L39] xi = xsi VAL [\old(A)=9214364837600034821, A=9214364837600034821, A_u={4:0}, cond=0, exp=-1023, xi=9214364837600034817, xi_u={5:0}, xsi=9214364837600034817] [L35] COND FALSE !(\read(cond)) VAL [\old(A)=9214364837600034821, A=9214364837600034821, A_u={4:0}, cond=0, exp=-1023, xi=9214364837600034817, xi_u={5:0}, xsi=9214364837600034817] [L41] return xi; [L41] return xi; [L41] return xi; VAL [\old(A)=9214364837600034821, \result=9214364837600034817, A=9214364837600034821, cond=0, exp=-1023, xi=9214364837600034817, xsi=9214364837600034817] [L51] RET, EXPR inv(a) [L51] r = inv(a) [L53] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 3 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=14occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 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-02-20 16:23:28,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-benchs/inv_Newton-1.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 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:23:30,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:23:30,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:23:30,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:23:30,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:23:30,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:23:30,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:23:30,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:23:30,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:23:30,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:23:30,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:23:30,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:23:30,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:23:30,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:23:30,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:23:30,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:23:30,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:23:30,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:23:30,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:23:30,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:23:30,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:23:30,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:23:30,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:23:30,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:23:30,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:23:30,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:23:30,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:23:30,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:23:30,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:23:30,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:23:30,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:23:30,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:23:30,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:23:30,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:23:30,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:23:30,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:23:30,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:23:30,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:23:30,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:23:30,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:23:30,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:23:30,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:23:30,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:23:30,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:23:30,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:23:30,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:23:30,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:23:30,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:23:30,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:23:30,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:23:30,414 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:23:30,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:23:30,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:23:30,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:23:30,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:23:30,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:23:30,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:23:30,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:23:30,416 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:23:30,416 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:23:30,416 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:23:30,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:23:30,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:23:30,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:23:30,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:23:30,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:23:30,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:23:30,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:23:30,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:30,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:23:30,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:23:30,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:23:30,425 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:23:30,425 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:23:30,426 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:23:30,426 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:23:30,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:23:30,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:23:30,426 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 -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2022-02-20 16:23:30,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:23:30,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:23:30,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:23:30,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:23:30,680 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:23:30,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-02-20 16:23:30,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5559e92/604625eabbf244c69418064caaa69857/FLAG9941a70b1 [2022-02-20 16:23:31,179 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:23:31,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-02-20 16:23:31,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5559e92/604625eabbf244c69418064caaa69857/FLAG9941a70b1 [2022-02-20 16:23:31,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5559e92/604625eabbf244c69418064caaa69857 [2022-02-20 16:23:31,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:23:31,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:23:31,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:31,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:23:31,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:23:31,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f70a8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31, skipping insertion in model container [2022-02-20 16:23:31,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:23:31,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:23:31,363 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-benchs/inv_Newton-1.c[598,611] [2022-02-20 16:23:31,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:31,419 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:23:31,430 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-benchs/inv_Newton-1.c[598,611] [2022-02-20 16:23:31,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:31,470 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:23:31,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31 WrapperNode [2022-02-20 16:23:31,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:31,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:31,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:23:31,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:23:31,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,517 INFO L137 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2022-02-20 16:23:31,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:31,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:23:31,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:23:31,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:23:31,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:23:31,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:23:31,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:23:31,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:23:31,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (1/1) ... [2022-02-20 16:23:31,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:31,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:23:31,595 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-02-20 16:23:31,607 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-02-20 16:23:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:23:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-02-20 16:23:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:23:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:23:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:23:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-02-20 16:23:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:23:31,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:23:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-02-20 16:23:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:23:31,700 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:23:31,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:23:34,002 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:23:34,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:23:34,006 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:23:34,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:34 BoogieIcfgContainer [2022-02-20 16:23:34,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:23:34,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:23:34,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:23:34,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:23:34,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:23:31" (1/3) ... [2022-02-20 16:23:34,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8aa8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:34, skipping insertion in model container [2022-02-20 16:23:34,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:31" (2/3) ... [2022-02-20 16:23:34,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8aa8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:34, skipping insertion in model container [2022-02-20 16:23:34,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:34" (3/3) ... [2022-02-20 16:23:34,012 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2022-02-20 16:23:34,016 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:23:34,016 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:23:34,048 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:23:34,052 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:23:34,052 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:23:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:23:34,064 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:34,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:34,065 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:34,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:34,069 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-02-20 16:23:34,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:23:34,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751436628] [2022-02-20 16:23:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:34,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:23:34,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:23:34,081 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-02-20 16:23:34,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:23:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:34,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:23:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:34,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:23:34,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {17#true} is VALID [2022-02-20 16:23:34,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~r~0#1;havoc main_~a~0#1;havoc main_~r~0#1;main_~a~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~a~0#1, ~to_fp~DOUBLE(currentRoundingMode, 20.0)) && ~fp.leq~DOUBLE(main_~a~0#1, ~to_fp~DOUBLE(currentRoundingMode, 30.0)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {17#true} is VALID [2022-02-20 16:23:34,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {18#false} is VALID [2022-02-20 16:23:34,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {18#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_inv } true;inv_#in~A#1 := main_~a~0#1;havoc inv_#res#1;havoc inv_#t~mem4#1, inv_#t~mem5#1, inv_~A#1, inv_~xi~0#1, inv_~xsi~0#1, inv_~temp~0#1, inv_~cond~0#1, inv_~exp~0#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset;inv_~A#1 := inv_#in~A#1;havoc inv_~xi~0#1;havoc inv_~xsi~0#1;havoc inv_~temp~0#1;havoc inv_~cond~0#1;havoc inv_~exp~0#1;call inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(inv_~A#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8bv32);call inv_#t~mem4#1 := read~intINTTYPE8(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8bv32);inv_~exp~0#1 := ~bvsub32(~bvashr64(~bvand64(9218868437227405312bv64, inv_#t~mem4#1), 52bv64)[32:0], 1023bv32);havoc inv_#t~mem4#1;call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, 1bv32), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8bv32);call write~intINTTYPE8(~bvshl64(~sign_extendFrom32To64(~bvsub32(1023bv32, inv_~exp~0#1)), 52bv64), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8bv32);call inv_#t~mem5#1 := read~intFLOATTYPE8(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8bv32);inv_~xi~0#1 := inv_#t~mem5#1;havoc inv_#t~mem5#1;inv_~cond~0#1 := 1bv32; {18#false} is VALID [2022-02-20 16:23:34,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#false} assume !(0bv32 != inv_~cond~0#1); {18#false} is VALID [2022-02-20 16:23:34,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {18#false} inv_#res#1 := inv_~xi~0#1;call ULTIMATE.dealloc(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset);havoc inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset;call ULTIMATE.dealloc(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset);havoc inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset; {18#false} is VALID [2022-02-20 16:23:34,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {18#false} main_#t~ret7#1 := inv_#res#1;assume { :end_inline_inv } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~r~0#1, ~convertINTToDOUBLE(currentRoundingMode, 0bv32)) && ~fp.leq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 0.06)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {18#false} is VALID [2022-02-20 16:23:34,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {18#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {18#false} is VALID [2022-02-20 16:23:34,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {18#false} assume !false; {18#false} is VALID [2022-02-20 16:23:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:34,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:23:34,272 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:23:34,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751436628] [2022-02-20 16:23:34,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751436628] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:34,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:34,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:23:34,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045729482] [2022-02-20 16:23:34,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:34,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:23:34,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:34,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:34,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:34,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:23:34,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:23:34,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:23:34,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:23:34,324 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:36,523 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 16:23:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:23:36,524 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:23:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2022-02-20 16:23:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2022-02-20 16:23:36,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 30 transitions. [2022-02-20 16:23:37,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:37,145 INFO L225 Difference]: With dead ends: 25 [2022-02-20 16:23:37,145 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 16:23:37,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:23:37,149 INFO L933 BasicCegarLoop]: 14 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, 14 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-02-20 16:23:37,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:23:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 16:23:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 16:23:37,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:37,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-02-20 16:23:37,175 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-02-20 16:23:37,175 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-02-20 16:23:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:37,176 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:23:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:37,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:37,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:37,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 16:23:37,179 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 16:23:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:37,180 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:23:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:37,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:37,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:37,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:37,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-02-20 16:23:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-20 16:23:37,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-02-20 16:23:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:37,183 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-20 16:23:37,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:37,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:23:37,184 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:37,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:37,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:23:37,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:23:37,388 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-02-20 16:23:37,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:23:37,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166371705] [2022-02-20 16:23:37,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:37,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:23:37,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:23:37,390 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-02-20 16:23:37,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:23:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:37,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:23:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:37,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:23:37,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {110#true} is VALID [2022-02-20 16:23:37,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~r~0#1;havoc main_~a~0#1;havoc main_~r~0#1;main_~a~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~a~0#1, ~to_fp~DOUBLE(currentRoundingMode, 20.0)) && ~fp.leq~DOUBLE(main_~a~0#1, ~to_fp~DOUBLE(currentRoundingMode, 30.0)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {110#true} is VALID [2022-02-20 16:23:37,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {110#true} is VALID [2022-02-20 16:23:37,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {110#true} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_inv } true;inv_#in~A#1 := main_~a~0#1;havoc inv_#res#1;havoc inv_#t~mem4#1, inv_#t~mem5#1, inv_~A#1, inv_~xi~0#1, inv_~xsi~0#1, inv_~temp~0#1, inv_~cond~0#1, inv_~exp~0#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset;inv_~A#1 := inv_#in~A#1;havoc inv_~xi~0#1;havoc inv_~xsi~0#1;havoc inv_~temp~0#1;havoc inv_~cond~0#1;havoc inv_~exp~0#1;call inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(inv_~A#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8bv32);call inv_#t~mem4#1 := read~intINTTYPE8(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8bv32);inv_~exp~0#1 := ~bvsub32(~bvashr64(~bvand64(9218868437227405312bv64, inv_#t~mem4#1), 52bv64)[32:0], 1023bv32);havoc inv_#t~mem4#1;call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, 1bv32), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8bv32);call write~intINTTYPE8(~bvshl64(~sign_extendFrom32To64(~bvsub32(1023bv32, inv_~exp~0#1)), 52bv64), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8bv32);call inv_#t~mem5#1 := read~intFLOATTYPE8(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8bv32);inv_~xi~0#1 := inv_#t~mem5#1;havoc inv_#t~mem5#1;inv_~cond~0#1 := 1bv32; {124#(= |ULTIMATE.start_inv_~cond~0#1| (_ bv1 32))} is VALID [2022-02-20 16:23:37,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {124#(= |ULTIMATE.start_inv_~cond~0#1| (_ bv1 32))} assume !(0bv32 != inv_~cond~0#1); {111#false} is VALID [2022-02-20 16:23:37,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {111#false} inv_#res#1 := inv_~xi~0#1;call ULTIMATE.dealloc(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset);havoc inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset;call ULTIMATE.dealloc(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset);havoc inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset; {111#false} is VALID [2022-02-20 16:23:37,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#false} main_#t~ret7#1 := inv_#res#1;assume { :end_inline_inv } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~r~0#1, ~convertINTToDOUBLE(currentRoundingMode, 0bv32)) && ~fp.leq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 0.06)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {111#false} is VALID [2022-02-20 16:23:37,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {111#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {111#false} is VALID [2022-02-20 16:23:37,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#false} assume !false; {111#false} is VALID [2022-02-20 16:23:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:37,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:23:37,545 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:23:37,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166371705] [2022-02-20 16:23:37,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166371705] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:37,545 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:37,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:23:37,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480545617] [2022-02-20 16:23:37,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:37,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:23:37,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:37,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:37,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:37,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:23:37,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:23:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:23:37,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:23:37,565 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:39,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:23:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:40,008 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:23:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:23:40,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:23:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 16:23:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 16:23:40,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-02-20 16:23:40,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:40,709 INFO L225 Difference]: With dead ends: 16 [2022-02-20 16:23:40,709 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 16:23:40,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-02-20 16:23:40,711 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:23:40,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 16:23:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 16:23:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 16:23:40,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:40,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 16:23:40,713 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 16:23:40,713 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 16:23:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:40,714 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:23:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:23:40,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:40,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:40,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 16:23:40,715 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 16:23:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:40,716 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:23:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:23:40,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:40,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:40,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:40,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-20 16:23:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-02-20 16:23:40,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-02-20 16:23:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:40,718 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-02-20 16:23:40,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:23:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:23:40,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:40,719 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:40,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:23:40,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:23:40,924 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:40,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-02-20 16:23:40,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:23:40,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445134082] [2022-02-20 16:23:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:40,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:23:40,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:23:40,926 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-02-20 16:23:40,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:23:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:42,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 16:23:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-20 16:23:44,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:23:44,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 219 [2022-02-20 16:23:44,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 213